tplp-planning-benchmark/fd-pc-e1-sh/ipc-2002_driverlog-strips-automatic_18.out

242 lines
26 KiB
Plaintext
Raw Normal View History

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-18.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-18.pddl
Parsing...
Parsing: [0.030s CPU, 0.030s 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.010s CPU, 0.015s wall-clock]
Preparing model... [0.040s CPU, 0.033s wall-clock]
Generated 35 rules.
Computing model... [0.860s CPU, 0.868s wall-clock]
10402 relevant atoms
3678 auxiliary atoms
14080 final queue length
22680 total queue pushes
Completing instantiation... [1.670s CPU, 1.667s wall-clock]
Instantiating: [2.600s CPU, 2.608s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.036s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.090s CPU, 0.088s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.005s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.010s CPU, 0.015s wall-clock]
Building translation key... [0.000s CPU, 0.009s wall-clock]
Computing fact groups: [0.200s CPU, 0.203s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.090s CPU, 0.090s wall-clock]
Translating task: [1.780s CPU, 1.784s wall-clock]
500 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.910s CPU, 0.909s wall-clock]
Reordering and filtering variables...
32 of 35 variables necessary.
5 of 35 mutex groups necessary.
8360 of 8960 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.230s CPU, 0.225s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 825
Translator goal facts: 23
Translator mutex groups: 5
Translator total mutex groups size: 30
Translator operators: 8360
Translator axioms: 0
Translator task size: 35190
Translator peak memory: 59480 KB
Writing output... [0.670s CPU, 0.737s wall-clock]
Done! [6.520s CPU, 6.588s wall-clock]
planner.py version 0.0.1
Time: 1.59s
Memory: 131MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.95s
Memory: 141MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 162MB (+21MB)
UNSAT
Iteration Time: 1.53s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.40s
Memory: 162MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 168MB (+6MB)
UNSAT
Iteration Time: 0.62s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.30s
Memory: 170MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 180MB (+10MB)
UNSAT
Iteration Time: 0.54s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.74s
Memory: 211MB (+31MB)
Unblocking actions...
Solving...
Solving Time: 9.18s
Memory: 237MB (+26MB)
UNKNOWN
Iteration Time: 10.26s
Iteration 5
Queue: [19, 14]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.66s
Memory: 257MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 13.18s
Memory: 290MB (+33MB)
UNKNOWN
Iteration Time: 14.22s
Iteration 6
Queue: [14, 27, 19]
Grounded Until: 19
Blocking actions...
Solving...
Solving Time: 10.26s
Memory: 290MB (+0MB)
UNKNOWN
Iteration Time: 10.27s
Iteration 7
Queue: [27, 19, 39, 14]
Grounded Until: 19
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time: 1.08s
Memory: 333MB (+43MB)
Unblocking actions...
Solving...
Solving Time: 19.62s
Memory: 386MB (+53MB)
UNKNOWN
Iteration Time: 21.27s
Iteration 8
Queue: [19, 39, 14, 55, 27]
Grounded Until: 27
Blocking actions...
Solving...
Solving Time: 13.14s
Memory: 386MB (+0MB)
UNKNOWN
Iteration Time: 13.17s
Iteration 9
Queue: [39, 14, 55, 27, 78, 19]
Grounded Until: 27
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time: 1.82s
Memory: 475MB (+89MB)
Unblocking actions...
Solving...
Solving Time: 29.24s
Memory: 556MB (+81MB)
UNKNOWN
Iteration Time: 31.94s
Iteration 10
Queue: [14, 55, 27, 78, 19, 110, 39]
Grounded Until: 39
Blocking actions...
Solving...
Solving Time: 10.92s
Memory: 556MB (+0MB)
UNKNOWN
Iteration Time: 10.95s
Iteration 11
Queue: [55, 27, 78, 19, 110, 39, 155, 14]
Grounded Until: 39
Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 2.18s
Memory: 627MB (+71MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package16","truck5","s2")),1) occurs(action(("load-truck","package4","truck5","s2")),1) occurs(action(("board-truck","driver4","truck5","s2")),1) occurs(action(("walk","driver1","s11","p11-8")),1) occurs(action(("walk","driver2","s6","p6-19")),1) occurs(action(("walk","driver3","s1","p1-7")),1) occurs(action(("walk","driver5","s4","p2-4")),1) occurs(action(("load-truck","package15","truck2","s3")),2) occurs(action(("drive-truck","truck5","s2","s8","driver4")),2) occurs(action(("walk","driver1","p11-8","s8")),2) occurs(action(("walk","driver3","p1-7","s7")),2) occurs(action(("walk","driver5","p2-4","s2")),2) occurs(action(("board-truck","driver1","truck4","s8")),3) occurs(action(("unload-truck","package4","truck5","s8")),3) occurs(action(("disembark-truck","driver4","truck5","s8")),3) occurs(action(("walk","driver3","s7","p7-5")),3) occurs(action(("walk","driver5","s2","p2-12")),3) occurs(action(("load-truck","package1","truck2","s3")),4) occurs(action(("load-truck","package5","truck2","s3")),4) occurs(action(("board-truck","driver4","truck3","s8")),4) occurs(action(("drive-truck","truck4","s8","s19","driver1")),4) occurs(action(("walk","driver3","p7-5","s5")),4) occurs(action(("walk","driver5","p2-12","s12")),4) occurs(action(("unload-truck","package15","truck2","s3")),4) occurs(action(("load-truck","package15","truck2","s3")),5) occurs(action(("drive-truck","truck3","s8","s7","driver4")),5) occurs(action(("board-truck","driver5","truck1","s12")),5) occurs(action(("disembark-truck","driver1","truck4","s19")),5) occurs(action(("walk","driver2","p6-19","s19")),5) occurs(action(("walk","driver3","s5","p5-3")),5) occurs(action(("drive-truck","truck1","s12","s8","driver5")),6) occurs(action(("board-truck","driver2","truck4","s19")),6) occurs(action(("walk","driver3","p5-3","s3")),6) occurs(action(("disembark-truck","driver4","truck3","s7")),6) occurs(action(("unload-truck","package1","truck2","s3")),6) occurs(action(("walk","driver1","s19","p6-19")),6) occurs(action(("load-truck","package10","truck2","s3")),7) occurs(action(("board-truck","driver3","truck2","s3")),7) occurs(action(("drive-truck","truck4","s19","s0","driver2")),7) occurs(action(("walk","driver1","p6-19","s6")),7) occurs(action(("walk","driver4","s7","p7-5")),7) occurs(action(("load-truck","package4","truck5","s8")),8) occurs(action(("drive-truck","truck4","s0","s10","driver2")),8) occurs(action(("disembark-truck","driver3","truck2","s3")),8) occurs(action(("walk","driver4","p7-5","s5")),8) occurs(action(("drive-truck","truck1","s8","s19","driver5")),8) occurs(action(("drive-truck","truck1","s19","s16","driver5")),9) occurs(action(("board-truck","driver3","truck2","s3")),9) occurs(action(("disembark-truck","driver2","truck4","s10")),9) occurs(action(("unload-truck","package5","truck2","s3")),9) occurs(action(("walk","driver1","s6","p6-10")),9) occurs(action(("walk","driver4","s5","p5-3")),9) occurs(action(("load-truck","package1","truck2","s3")),10) occurs(action(("load-truck","package11","truck1","s16")),10) occurs(action(("load-truck","package19","truck1","s16")),10) occurs(action(("walk","driver1","p6-10","s10")),10) occurs(action(("disembark-truck","driver3","truck2","s3")),10) occurs(action(("walk","driver4","p5-3","s3")),10) occurs(action(("walk","driver2","s10","p10-11")),10) occurs(action(("unload-truck","package16","truck5","s8")),11) occurs(action(("load-truck","package5","truck2","s3")),11) occurs(action(("board-truck","driver4","truck2","s3")),11) occurs(action(("walk","driver2","p10-11","s11")),11) occurs(action(("drive-truck","truck1","s16","s0","driver5")),11) occurs(action(("walk","driver3","s3","p3-18")),11) occurs(action(("board-truck","driver1","truck4","s10")),12) occurs(action(("drive-truck","truck2","s3","s18","driver4")),12) occurs(action(("drive-truck","truck1","s0","s13","driver5")),12) occurs(action(("walk","driver3","p3-18","s18")),12) occurs(action(("walk","driver2","s11","p11-8")),12) occurs(action(("drive-truck","truck4","s10","s0","driver1")),13) occurs(action(("drive-truck","truck2","s18","s17","driv
Solving Time: 44.64s
Memory: 707MB (+80MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 164.352s (Solving: 149.75s 1st Model: 44.46s Unsat: 0.09s)
CPU Time : 164.340s
Choices : 2982379
Conflicts : 85189 (Analyzed: 85186)
Restarts : 800 (Average: 106.48 Last: 118)
Model-Level : 5782.0
Problems : 11 (Average Length: 25.64 Splits: 0)
Lemmas : 85186 (Deleted: 66593)
Binary : 2162 (Ratio: 2.54%)
Ternary : 764 (Ratio: 0.90%)
Conflict : 85186 (Average Length: 171.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 85186 (Average: 32.10 Max: 7796 Sum: 2734177)
Executed : 84287 (Average: 31.88 Max: 7796 Sum: 2715695 Ratio: 99.32%)
Bounded : 899 (Average: 20.56 Max: 57 Sum: 18482 Ratio: 0.68%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 552307 (Eliminated: 0 Frozen: 490890)
Constraints : 3535044 (Binary: 97.4% Ternary: 1.5% Other: 1.1%)
Memory Peak : 717MB
Max. Length : 55 steps
Sol. Length : 55 steps