tplp-planning-benchmark/fd-pb-e0-sh-h/ipc-2002_driverlog-strips-automatic_16.out

156 lines
10 KiB
Plaintext
Raw Permalink 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-16.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-16.pddl
Parsing...
Parsing: [0.040s CPU, 0.037s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.015s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.040s CPU, 0.036s wall-clock]
Generated 35 rules.
Computing model... [0.590s CPU, 0.596s wall-clock]
5963 relevant atoms
2481 auxiliary atoms
8444 final queue length
13369 total queue pushes
Completing instantiation... [1.020s CPU, 1.025s wall-clock]
Instantiating: [1.690s CPU, 1.699s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.031s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.050s CPU, 0.054s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.010s CPU, 0.009s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.140s CPU, 0.133s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.057s wall-clock]
Translating task: [1.100s CPU, 1.094s wall-clock]
375 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
20 propositions removed
Detecting unreachable propositions: [0.630s CPU, 0.630s wall-clock]
Reordering and filtering variables...
24 of 25 variables necessary.
5 of 25 mutex groups necessary.
4890 of 5040 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.150s CPU, 0.147s wall-clock]
Translator variables: 24
Translator derived variables: 0
Translator facts: 500
Translator goal facts: 19
Translator mutex groups: 5
Translator total mutex groups size: 30
Translator operators: 4890
Translator axioms: 0
Translator task size: 20718
Translator peak memory: 50892 KB
Writing output... [0.420s CPU, 0.443s wall-clock]
Done! [4.210s CPU, 4.243s wall-clock]
planner.py version 0.0.1
Time: 0.87s
Memory: 102MB
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: 103MB (+1MB)
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.24s
Memory: 103MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 106MB (+3MB)
UNSAT
Iteration Time: 0.43s
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.29s
Memory: 121MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 2.62s
Memory: 136MB (+15MB)
UNKNOWN
Iteration Time: 3.09s
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.25s
Memory: 150MB (+14MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package4","truck5","s3")),1) occurs(action(("board-truck","driver2","truck2","s1")),1) occurs(action(("walk","driver1","s14","p13-14")),1) occurs(action(("walk","driver3","s0","p9-0")),1) occurs(action(("walk","driver4","s10","p3-10")),1) occurs(action(("walk","driver5","s12","p12-4")),1) occurs(action(("drive-truck","truck2","s1","s6","driver2")),2) occurs(action(("walk","driver1","p13-14","s13")),2) occurs(action(("walk","driver3","p9-0","s9")),2) occurs(action(("walk","driver4","p3-10","s3")),2) occurs(action(("walk","driver5","p12-4","s4")),2) occurs(action(("disembark-truck","driver2","truck2","s1")),2) occurs(action(("board-truck","driver4","truck5","s3")),3) occurs(action(("board-truck","driver1","truck4","s13")),3) occurs(action(("walk","driver2","s1","p1-2")),3) occurs(action(("walk","driver3","s9","p7-9")),3) occurs(action(("walk","driver5","s4","p4-6")),3) occurs(action(("drive-truck","truck5","s3","s11","driver4")),4) occurs(action(("drive-truck","truck4","s13","s0","driver1")),4) occurs(action(("walk","driver2","p1-2","s2")),4) occurs(action(("walk","driver3","p7-9","s7")),4) occurs(action(("walk","driver5","p4-6","s6")),4) occurs(action(("unload-truck","package4","truck5","s11")),5) occurs(action(("load-truck","package1","truck4","s0")),5) occurs(action(("load-truck","package5","truck5","s11")),5) occurs(action(("drive-truck","truck4","s0","s14","driver1")),5) occurs(action(("board-truck","driver2","truck3","s2")),5) occurs(action(("board-truck","driver3","truck1","s7")),5) occurs(action(("drive-truck","truck5","s11","s7","driver4")),5) occurs(action(("walk","driver5","s6","p2-6")),5) occurs(action(("drive-truck","truck1","s7","s5","driver3")),6) occurs(action(("load-truck","package10","truck5","s7")),6) occurs(action(("load-truck","package2","truck4","s14")),6) occurs(action(("load-truck","package6","truck5","s7")),6) occurs(action(("drive-truck","truck5","s7","s2","driver4")),6) occurs(action(("drive-truck","truck4","s14","s0","driver1")),6) occurs(action(("drive-truck","truck3","s2","s1","driver2")),6) occurs(action(("disembark-truck","driver3","truck1","s7")),6) occurs(action(("walk","driver5","p2-6","s2")),6) occurs(action(("unload-truck","package2","truck4","s0")),7) occurs(action(("unload-truck","package6","truck5","s2")),7) occurs(action(("drive-truck","truck3","s1","s8","driver2")),7) occurs(action(("load-truck","package9","truck5","s2")),7) occurs(action(("drive-truck","truck4","s0","s13","driver1")),7) occurs(action(("drive-truck","truck5","s2","s7","driver4")),7) occurs(action(("walk","driver3","s7","p3-7")),7) occurs(action(("walk","driver5","s2","p2-3")),7) occurs(action(("unload-truck","package1","truck4","s13")),8) occurs(action(("drive-truck","truck5","s7","s9","driver4")),8) occurs(action(("load-truck","package8","truck3","s8")),8) occurs(action(("drive-truck","truck3","s8","s6","driver2")),8) occurs(action(("unload-truck","package9","truck5","s7")),8) occurs(action(("drive-truck","truck4","s13","s7","driver1")),8) occurs(action(("walk","driver3","p3-7","s3")),8) occurs(action(("walk","driver5","p2-3","s3")),8) occurs(action(("unload-truck","package5","truck5","s9")),9) occurs(action(("unload-truck","package8","truck3","s6")),9) occurs(action(("drive-truck","truck3","s6","s8","driver2")),9) occurs(action(("load-truck","package9","truck4","s7")),9) occurs(action(("drive-truck","truck4","s7","s4","driver1")),9) occurs(action(("walk","driver5","s3","p3-11")),9) occurs(action(("walk","driver3","s3","p3-11")),9) occurs(action(("drive-truck","truck5","s9","s7","driver4")),9) occurs(action(("disembark-truck","driver2","truck3","s6")),9) occurs(action(("unload-truck","package9","truck4","s4")),10) occurs(action(("walk","driver5","p3-11","s11")),10) occurs(action(("walk","driver3","p3-11","s11")),10) occurs(action(("drive-truck","truck5","s7","s6","driver4")),10) occurs(action(("drive-truck","truck4","s4","s10","driver1")),10) occurs(action(("walk","driver2","s6","p2-6")),10) occurs(action(("drive-truck","truck4","s10","s12","driver1")),11) occurs(action(("drive-truck"
Solving Time: 0.84s
Memory: 169MB (+19MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 5.690s (Solving: 3.43s 1st Model: 0.81s Unsat: 0.00s)
CPU Time : 5.656s
Choices : 76000 (Domain: 76000)
Conflicts : 12312 (Analyzed: 12312)
Restarts : 129 (Average: 95.44 Last: 124)
Model-Level : 654.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 12312 (Deleted: 8741)
Binary : 69 (Ratio: 0.56%)
Ternary : 53 (Ratio: 0.43%)
Conflict : 12312 (Average Length: 696.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 12312 (Average: 5.00 Max: 690 Sum: 61580)
Executed : 12283 (Average: 4.99 Max: 690 Sum: 61414 Ratio: 99.73%)
Bounded : 29 (Average: 5.72 Max: 17 Sum: 166 Ratio: 0.27%)
Rules : 67695
Atoms : 67695
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 82346 (Eliminated: 0 Frozen: 6880)
Constraints : 329322 (Binary: 96.5% Ternary: 2.2% Other: 1.3%)
Memory Peak : 169MB
Max. Length : 15 steps
Sol. Length : 15 steps