170 lines
12 KiB
Plaintext
170 lines
12 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-17.pddl']
|
||
|
|
INFO translator arguments: []
|
||
|
|
INFO translator time limit: None
|
||
|
|
INFO translator memory limit: None
|
||
|
|
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-17.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.710s CPU, 0.713s wall-clock]
|
||
|
|
7293 relevant atoms
|
||
|
|
2871 auxiliary atoms
|
||
|
|
10164 final queue length
|
||
|
|
16104 total queue pushes
|
||
|
|
Completing instantiation... [1.230s CPU, 1.226s wall-clock]
|
||
|
|
Instantiating: [2.020s CPU, 2.008s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.080s CPU, 0.079s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
5 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.170s CPU, 0.176s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.070s CPU, 0.070s wall-clock]
|
||
|
|
Translating task: [1.390s CPU, 1.385s wall-clock]
|
||
|
|
400 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
25 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.700s CPU, 0.699s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
30 of 30 variables necessary.
|
||
|
|
5 of 30 mutex groups necessary.
|
||
|
|
6170 of 6170 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.170s CPU, 0.178s wall-clock]
|
||
|
|
Translator variables: 30
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 665
|
||
|
|
Translator goal facts: 23
|
||
|
|
Translator mutex groups: 5
|
||
|
|
Translator total mutex groups size: 30
|
||
|
|
Translator operators: 6170
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 26008
|
||
|
|
Translator peak memory: 54476 KB
|
||
|
|
Writing output... [0.510s CPU, 0.556s wall-clock]
|
||
|
|
Done! [5.070s CPU, 5.106s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.99s
|
||
|
|
Memory: 116MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 116MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.31s
|
||
|
|
Memory: 116MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 120MB (+4MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.55s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.34s
|
||
|
|
Memory: 135MB (+15MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.48s
|
||
|
|
Memory: 154MB (+19MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.03s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.33s
|
||
|
|
Memory: 174MB (+20MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.10s
|
||
|
|
Memory: 197MB (+23MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 23.30s
|
||
|
|
Memory: 1346MB (+1149MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.61s
|
||
|
|
Memory: 1349MB (+3MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.81s
|
||
|
|
Memory: 1349MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("load-truck","package13","truck1","s2")),1) occurs(action(("load-truck","package3","truck4","s3")),1) occurs(action(("board-truck","driver1","truck5","s10")),1) occurs(action(("walk","driver2","s13","p3-13")),1) occurs(action(("walk","driver3","s10","p2-10")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("walk","driver5","s2","p2-12")),1) occurs(action(("drive-truck","truck5","s10","s3","driver1")),2) occurs(action(("walk","driver2","p3-13","s3")),2) occurs(action(("walk","driver3","p2-10","s2")),2) occurs(action(("walk","driver4","p8-9","s8")),2) occurs(action(("walk","driver5","p2-12","s12")),2) occurs(action(("board-truck","driver2","truck4","s3")),3) occurs(action(("board-truck","driver5","truck3","s12")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("board-truck","driver3","truck1","s2")),3) occurs(action(("drive-truck","truck5","s3","s5","driver1")),3) occurs(action(("drive-truck","truck3","s12","s5","driver5")),4) occurs(action(("load-truck","package10","truck5","s5")),4) occurs(action(("drive-truck","truck5","s5","s3","driver1")),4) occurs(action(("drive-truck","truck1","s2","s15","driver3")),4) occurs(action(("drive-truck","truck2","s8","s10","driver4")),4) occurs(action(("drive-truck","truck4","s3","s12","driver2")),4) occurs(action(("drive-truck","truck2","s10","s1","driver4")),5) occurs(action(("load-truck","package1","truck4","s12")),5) occurs(action(("drive-truck","truck5","s3","s11","driver1")),5) occurs(action(("load-truck","package14","truck1","s15")),5) occurs(action(("load-truck","package8","truck4","s12")),5) occurs(action(("load-truck","package9","truck4","s12")),5) occurs(action(("drive-truck","truck4","s12","s10","driver2")),5) occurs(action(("drive-truck","truck1","s15","s0","driver3")),5) occurs(action(("disembark-truck","driver5","truck3","s5")),5) occurs(action(("unload-truck","package10","truck5","s11")),6) occurs(action(("unload-truck","package3","truck4","s10")),6) occurs(action(("load-truck","package11","truck2","s1")),6) occurs(action(("load-truck","package6","truck2","s1")),6) occurs(action(("drive-truck","truck5","s11","s2","driver1")),6) occurs(action(("drive-truck","truck2","s1","s10","driver4")),6) occurs(action(("drive-truck","truck1","s0","s10","driver3")),6) occurs(action(("drive-truck","truck4","s10","s3","driver2")),6) occurs(action(("unload-truck","package1","truck4","s10")),6) occurs(action(("unload-truck","package9","truck4","s10")),6) occurs(action(("walk","driver5","s5","p5-0")),6) occurs(action(("unload-truck","package13","truck1","s10")),7) occurs(action(("drive-truck","truck5","s2","s6","driver1")),7) occurs(action(("load-truck","package1","truck2","s10")),7) occurs(action(("load-truck","package5","truck5","s2")),7) occurs(action(("load-truck","package9","truck2","s10")),7) occurs(action(("drive-truck","truck4","s3","s13","driver2")),7) occurs(action(("unload-truck","package11","truck2","s10")),7) occurs(action(("unload-truck","package14","truck1","s10")),7) occurs(action(("unload-truck","package6","truck2","s10")),7) occurs(action(("walk","driver5","p5-0","s0")),7) occurs(action(("unload-truck","package5","truck5","s6")),8) occurs(action(("unload-truck","package8","truck4","s13")),8) occurs(action(("drive-truck","truck4","s13","s8","driver2")),8) occurs(action(("drive-truck","truck2","s10","s1","driver4")),8) occurs(action(("load-truck","package11","truck1","s10")),8) occurs(action(("load-truck","package14","truck2","s10")),8) occurs(action(("load-truck","package4","truck5","s6")),8) occurs(action(("load-truck","package6","truck1","s10")),8) occurs(action(("drive-truck","truck5","s6","s2","driver1")),8) occurs(action(("drive-truck","truck1","s10","s8","driver3")),8) occurs(action(("walk","driver5","s0","p0-14")),8) occurs(action(("unload-truck","package1","truck2","s1")),9) occurs(action(("unload-truck","package11","truck1","s8")),9) occurs(action(("unload-truck","package14","truck2","s1")),9) occurs(action(("unload-truck","package6","truck1","s8")),9) occurs(action(("unload-truck","package9","truck2","s1
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 28.372s (Solving: 2.83s 1st Model: 0.35s Unsat: 0.00s)
|
||
|
|
CPU Time : 28.348s
|
||
|
|
|
||
|
|
Choices : 89422 (Domain: 89351)
|
||
|
|
Conflicts : 10185 (Analyzed: 10184)
|
||
|
|
Restarts : 106 (Average: 96.08 Last: 90)
|
||
|
|
Model-Level : 735.5
|
||
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
||
|
|
Lemmas : 10184 (Deleted: 6331)
|
||
|
|
Binary : 101 (Ratio: 0.99%)
|
||
|
|
Ternary : 28 (Ratio: 0.27%)
|
||
|
|
Conflict : 10184 (Average Length: 712.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 10184 (Average: 7.01 Max: 637 Sum: 71388)
|
||
|
|
Executed : 10128 (Average: 6.98 Max: 637 Sum: 71059 Ratio: 99.54%)
|
||
|
|
Bounded : 56 (Average: 5.88 Max: 17 Sum: 329 Ratio: 0.46%)
|
||
|
|
|
||
|
|
Rules : 12067967
|
||
|
|
Atoms : 12041095
|
||
|
|
Bodies : 49242 (Original: 49241)
|
||
|
|
Equivalences : 72197 (Atom=Atom: 15479 Body=Body: 12299 Other: 44419)
|
||
|
|
Tight : No (SCCs: 492 Non-Hcfs: 0 Nodes: 47094 Gammas: 0)
|
||
|
|
Variables : 122389 (Eliminated: 0 Frozen: 37173)
|
||
|
|
Constraints : 427665 (Binary: 96.4% Ternary: 2.2% Other: 1.4%)
|
||
|
|
|
||
|
|
Memory Peak : 1361MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|