1
0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-2002_driverlog-strips-automatic_15.out

156 lines
9.8 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-15.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-15.pddl
Parsing...
Parsing: [0.020s CPU, 0.031s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
Preparing model... [0.020s CPU, 0.027s wall-clock]
Generated 35 rules.
Computing model... [0.320s CPU, 0.318s wall-clock]
3250 relevant atoms
1604 auxiliary atoms
4854 final queue length
7326 total queue pushes
Completing instantiation... [0.460s CPU, 0.455s wall-clock]
Instantiating: [0.840s CPU, 0.834s 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.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.029s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.000s CPU, 0.006s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.078s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.026s wall-clock]
Translating task: [0.520s CPU, 0.519s wall-clock]
192 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [0.260s CPU, 0.265s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
4 of 20 mutex groups necessary.
2592 of 2592 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.070s CPU, 0.070s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 336
Translator goal facts: 10
Translator mutex groups: 4
Translator total mutex groups size: 20
Translator operators: 2592
Translator axioms: 0
Translator task size: 10978
Translator peak memory: 40792 KB
Writing output... [0.200s CPU, 0.220s wall-clock]
Done! [2.030s CPU, 2.047s wall-clock]
planner.py version 0.0.1
Time: 0.39s
Memory: 72MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 72MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.17s
Memory: 73MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 79MB (+6MB)
UNSAT
Iteration Time: 0.26s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.19s
Memory: 85MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.20s
Memory: 92MB (+7MB)
UNSAT
Iteration Time: 0.48s
Iteration 4
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.19s
Memory: 98MB (+6MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package1","truck1","s3")),1) occurs(action(("load-truck","package7","truck2","s9")),1) occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p1-5")),1) occurs(action(("walk","driver3","s5","p5-9")),1) occurs(action(("walk","driver4","s10","p10-0")),1) occurs(action(("walk","driver1","p8-3","s3")),2) occurs(action(("walk","driver2","p1-5","s1")),2) occurs(action(("walk","driver3","p5-9","s9")),2) occurs(action(("walk","driver4","p10-0","s0")),2) occurs(action(("board-truck","driver3","truck2","s9")),3) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("walk","driver2","s1","p8-1")),3) occurs(action(("walk","driver4","s0","p0-6")),3) occurs(action(("drive-truck","truck3","s3","s11","driver1")),4) occurs(action(("drive-truck","truck2","s9","s0","driver3")),4) occurs(action(("walk","driver2","p8-1","s8")),4) occurs(action(("walk","driver4","p0-6","s6")),4) occurs(action(("load-truck","package4","truck3","s11")),5) occurs(action(("board-truck","driver4","truck4","s6")),5) occurs(action(("drive-truck","truck2","s0","s9","driver3")),5) occurs(action(("walk","driver2","s8","p8-3")),5) occurs(action(("drive-truck","truck2","s9","s1","driver3")),6) occurs(action(("drive-truck","truck3","s11","s7","driver1")),6) occurs(action(("drive-truck","truck4","s6","s8","driver4")),6) occurs(action(("walk","driver2","p8-3","s3")),6) occurs(action(("unload-truck","package4","truck3","s7")),7) occurs(action(("load-truck","package3","truck4","s8")),7) occurs(action(("load-truck","package5","truck2","s1")),7) occurs(action(("load-truck","package6","truck4","s8")),7) occurs(action(("board-truck","driver2","truck1","s3")),7) occurs(action(("drive-truck","truck1","s3","s11","driver2")),8) occurs(action(("drive-truck","truck2","s1","s2","driver3")),8) occurs(action(("drive-truck","truck4","s8","s2","driver4")),8) occurs(action(("drive-truck","truck3","s7","s6","driver1")),8) occurs(action(("load-truck","package2","truck2","s2")),9) occurs(action(("drive-truck","truck1","s11","s7","driver2")),9) occurs(action(("unload-truck","package3","truck4","s2")),9) occurs(action(("unload-truck","package5","truck2","s2")),9) occurs(action(("unload-truck","package6","truck4","s2")),9) occurs(action(("disembark-truck","driver3","truck2","s2")),9) occurs(action(("drive-truck","truck3","s6","s10","driver1")),9) occurs(action(("disembark-truck","driver4","truck4","s2")),9) occurs(action(("unload-truck","package7","truck2","s2")),10) occurs(action(("load-truck","package3","truck4","s2")),10) occurs(action(("load-truck","package5","truck2","s2")),10) occurs(action(("drive-truck","truck1","s7","s11","driver2")),10) occurs(action(("load-truck","package6","truck2","s2")),10) occurs(action(("load-truck","package8","truck3","s10")),10) occurs(action(("board-truck","driver3","truck4","s2")),10) occurs(action(("board-truck","driver4","truck2","s2")),10) occurs(action(("unload-truck","package2","truck2","s2")),10) occurs(action(("drive-truck","truck4","s2","s1","driver3")),11) occurs(action(("drive-truck","truck3","s10","s3","driver1")),11) occurs(action(("drive-truck","truck2","s2","s3","driver4")),11) occurs(action(("drive-truck","truck1","s11","s3","driver2")),11) occurs(action(("unload-truck","package3","truck4","s1")),12) occurs(action(("drive-truck","truck2","s3","s11","driver4")),12) occurs(action(("drive-truck","truck1","s3","s2","driver2")),12) occurs(action(("drive-truck","truck3","s3","s0","driver1")),12) occurs(action(("unload-truck","package1","truck1","s2")),13) occurs(action(("unload-truck","package6","truck2","s11")),13) occurs(action(("unload-truck","package8","truck3","s0")),13) occurs(action(("load-truck","package2","truck1","s2")),13) occurs(action(("drive-truck","truck4","s1","s6","driver3")),13) occurs(action(("drive-truck","truck1","s2","s5","driver2")),14) occurs(action(("drive-truck","truck2","s11","s0","driver4")),14) occurs(action(("drive-truck","truck4","s6","s8","driver3")),14) occurs(action(("drive-truck","truck3","s0","s3","driver1")),14) occurs(action(("unload-t
Solving Time: 0.44s
Memory: 106MB (+8MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 1.897s (Solving: 0.63s 1st Model: 0.43s Unsat: 0.20s)
CPU Time : 1.870s
Choices : 8820
Conflicts : 2290 (Analyzed: 2289)
Restarts : 26 (Average: 88.04 Last: 72)
Model-Level : 78.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 2289 (Deleted: 0)
Binary : 157 (Ratio: 6.86%)
Ternary : 67 (Ratio: 2.93%)
Conflict : 2289 (Average Length: 33.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 2289 (Average: 4.53 Max: 75 Sum: 10365)
Executed : 2163 (Average: 3.81 Max: 75 Sum: 8725 Ratio: 84.18%)
Bounded : 126 (Average: 13.02 Max: 17 Sum: 1640 Ratio: 15.82%)
Rules : 38811
Atoms : 38811
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 46077 (Eliminated: 0 Frozen: 39386)
Constraints : 219035 (Binary: 96.4% Ternary: 2.1% Other: 1.5%)
Memory Peak : 107MB
Max. Length : 15 steps
Sol. Length : 15 steps