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

173 lines
9.5 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-12.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-12.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.016s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 35 rules.
Computing model... [0.150s CPU, 0.155s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.170s CPU, 0.168s wall-clock]
Instantiating: [0.360s CPU, 0.368s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.048s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.009s wall-clock]
Translating task: [0.180s CPU, 0.179s wall-clock]
60 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.096s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
948 of 948 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.026s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 176
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 948
Translator axioms: 0
Translator task size: 4037
Translator peak memory: 35928 KB
Writing output... [0.080s CPU, 0.080s wall-clock]
Done! [0.830s CPU, 0.833s wall-clock]
planner.py version 0.0.1
Time: 0.18s
Memory: 55MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.06s
Memory: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+2MB)
UNSAT
Iteration Time: 0.09s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.02s
Memory: 58MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.03s
Memory: 59MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.06s
Memory: 64MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.34s
Memory: 67MB (+3MB)
UNSAT
Iteration Time: 0.43s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.06s
Memory: 70MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package4","truck1","s7")),1) occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("board-truck","driver1","truck1","s7")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("drive-truck","truck1","s7","s4","driver1")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("load-truck","package1","truck2","s3")),5) occurs(action(("load-truck","package2","truck1","s4")),5) occurs(action(("load-truck","package5","truck1","s4")),5) occurs(action(("drive-truck","truck2","s3","s1","driver2")),6) occurs(action(("drive-truck","truck1","s4","s2","driver1")),6) occurs(action(("unload-truck","package2","truck1","s2")),7) occurs(action(("load-truck","package6","truck2","s1")),7) occurs(action(("unload-truck","package4","truck1","s2")),7) occurs(action(("unload-truck","package5","truck1","s2")),7) occurs(action(("disembark-truck","driver1","truck1","s2")),7) occurs(action(("load-truck","package4","truck3","s2")),8) occurs(action(("load-truck","package5","truck3","s2")),8) occurs(action(("board-truck","driver1","truck3","s2")),8) occurs(action(("drive-truck","truck2","s1","s2","driver2")),8) occurs(action(("unload-truck","package1","truck2","s2")),9) occurs(action(("unload-truck","package6","truck2","s2")),9) occurs(action(("drive-truck","truck3","s2","s1","driver1")),9) occurs(action(("load-truck","package2","truck1","s2")),10) occurs(action(("load-truck","package6","truck1","s2")),10) occurs(action(("drive-truck","truck2","s2","s7","driver2")),10) occurs(action(("unload-truck","package5","truck3","s1")),10) occurs(action(("disembark-truck","driver1","truck3","s1")),10) occurs(action(("unload-truck","package4","truck3","s1")),11) occurs(action(("unload-truck","package6","truck1","s2")),11) occurs(action(("load-truck","package1","truck1","s2")),11) occurs(action(("load-truck","package5","truck3","s1")),11) occurs(action(("load-truck","package4","truck3","s1")),12) occurs(action(("unload-truck","package5","truck3","s1")),12) occurs(action(("disembark-truck","driver2","truck2","s7")),12) occurs(action(("unload-truck","package1","truck1","s2")),13) occurs(action(("unload-truck","package2","truck1","s2")),13) occurs(action(("unload-truck","package4","truck3","s1")),13) occurs(action(("load-truck","package5","truck3","s1")),13) occurs(action(("board-truck","driver1","truck3","s1")),13) occurs(action(("board-truck","driver2","truck2","s7")),13) occurs(action(("drive-truck","truck3","s1","s0","driver1")),14) occurs(action(("drive-truck","truck2","s7","s5","driver2")),14) occurs(action(("load-truck","package1","truck1","s2")),14) occurs(action(("load-truck","package2","truck1","s2")),14) occurs(action(("load-truck","package6","truck1","s2")),14) occurs(action(("unload-truck","package1","truck1","s2")),15) occurs(action(("unload-truck","package6","truck1","s2")),15) occurs(action(("disembark-truck","driver1","truck3","s0")),15) occurs(action(("disembark-truck","driver2","truck2","s5")),15) occurs(action(("unload-truck","package2","truck1","s2")),16) occurs(action(("unload-truck","package5","truck3","s0")),16) occurs(action(("load-truck","package6","truck1","s2")),16) occurs(action(("walk","driver1","s0","p6-0")),16) occurs(action(("walk","driver2","s5","p6-5")),16) occurs(action(("load-truck","package1","truck1","s2")),17) occurs(action(("load-truck","package2","truck1","s2")),17) occurs(action(("walk","driver1","p6-0","s6")),17) occurs(action(("walk","driver2","p6-5","s5")),17) occurs(action(("unload-truck","package6","truck1","s2")),18) occurs(action(("walk","driver2","s5","p5-9")),18) occurs(action(("walk","driver1","s6","p6-4")),18) occurs(action(("unload-truck","package1","truck1","s2")),19) occurs(action(("unload-truck","package2","truck1","s2")),19) occurs(action(("walk","driver2","p5-9","s9")),19) occurs(action(("walk","driver1","p6-4","s4")),19)
Solving Time: 0.19s
Memory: 73MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 1.079s (Solving: 0.53s 1st Model: 0.19s Unsat: 0.34s)
CPU Time : 1.060s
Choices : 7597
Conflicts : 3832 (Analyzed: 3829)
Restarts : 44 (Average: 87.02 Last: 93)
Model-Level : 83.0
Problems : 5 (Average Length: 12.80 Splits: 0)
Lemmas : 3829 (Deleted: 932)
Binary : 107 (Ratio: 2.79%)
Ternary : 63 (Ratio: 1.65%)
Conflict : 3829 (Average Length: 54.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3829 (Average: 2.21 Max: 60 Sum: 8471)
Executed : 3731 (Average: 1.93 Max: 60 Sum: 7373 Ratio: 87.04%)
Bounded : 98 (Average: 11.20 Max: 21 Sum: 1098 Ratio: 12.96%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 23556 (Eliminated: 0 Frozen: 17801)
Constraints : 107337 (Binary: 94.8% Ternary: 3.0% Other: 2.2%)
Memory Peak : 74MB
Max. Length : 19 steps
Sol. Length : 19 steps