1
0
tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-2002_driverlog-strips-automatic_17.out

156 lines
11 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.040s CPU, 0.039s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.016s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
Preparing model... [0.040s CPU, 0.037s wall-clock]
Generated 35 rules.
Computing model... [0.640s CPU, 0.643s wall-clock]
7293 relevant atoms
2871 auxiliary atoms
10164 final queue length
16104 total queue pushes
Completing instantiation... [1.090s CPU, 1.096s wall-clock]
Instantiating: [1.810s CPU, 1.820s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.030s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.070s CPU, 0.067s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.010s CPU, 0.012s wall-clock]
Building translation key... [0.010s CPU, 0.007s wall-clock]
Computing fact groups: [0.170s CPU, 0.155s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.061s wall-clock]
Translating task: [1.220s CPU, 1.225s 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.630s CPU, 0.625s 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.150s CPU, 0.160s 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: 51288 KB
Writing output... [0.470s CPU, 0.511s wall-clock]
Done! [4.560s CPU, 4.604s wall-clock]
planner.py version 0.0.1
Time: 0.88s
Memory: 109MB
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: 109MB (+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.47s
Memory: 109MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 124MB (+15MB)
UNSAT
Iteration Time: 0.74s
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.46s
Memory: 137MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.92s
Memory: 152MB (+15MB)
UNSAT
Iteration Time: 1.61s
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.48s
Memory: 168MB (+16MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package13","truck1","s2")),1) occurs(action(("load-truck","package3","truck4","s3")),1) occurs(action(("load-truck","package5","truck1","s2")),1) occurs(action(("board-truck","driver3","truck5","s10")),1) occurs(action(("walk","driver1","s10","p2-10")),1) occurs(action(("walk","driver2","s13","p13-4")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("walk","driver5","s2","p2-12")),1) occurs(action(("drive-truck","truck5","s10","s14","driver3")),2) occurs(action(("walk","driver1","p2-10","s2")),2) occurs(action(("walk","driver2","p13-4","s4")),2) occurs(action(("walk","driver4","p8-9","s8")),2) occurs(action(("walk","driver5","p2-12","s12")),2) occurs(action(("board-truck","driver5","truck3","s12")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("board-truck","driver1","truck1","s2")),3) occurs(action(("disembark-truck","driver3","truck5","s14")),3) occurs(action(("walk","driver2","s4","p4-14")),3) occurs(action(("drive-truck","truck3","s12","s10","driver5")),4) occurs(action(("drive-truck","truck2","s8","s4","driver4")),4) occurs(action(("drive-truck","truck1","s2","s6","driver1")),4) occurs(action(("walk","driver2","p4-14","s14")),4) occurs(action(("walk","driver3","s14","p3-14")),4) occurs(action(("unload-truck","package5","truck1","s6")),5) occurs(action(("load-truck","package4","truck1","s6")),5) occurs(action(("board-truck","driver2","truck5","s14")),5) occurs(action(("drive-truck","truck3","s10","s14","driver5")),5) occurs(action(("drive-truck","truck2","s4","s12","driver4")),5) occurs(action(("walk","driver3","p3-14","s3")),5) occurs(action(("load-truck","package1","truck2","s12")),6) occurs(action(("load-truck","package15","truck3","s14")),6) occurs(action(("load-truck","package2","truck3","s14")),6) occurs(action(("load-truck","package8","truck2","s12")),6) occurs(action(("load-truck","package9","truck2","s12")),6) occurs(action(("board-truck","driver3","truck4","s3")),6) occurs(action(("drive-truck","truck5","s14","s5","driver2")),6) occurs(action(("drive-truck","truck1","s6","s2","driver1")),6) occurs(action(("drive-truck","truck3","s14","s13","driver5")),7) occurs(action(("drive-truck","truck4","s3","s15","driver3")),7) occurs(action(("drive-truck","truck2","s12","s13","driver4")),7) occurs(action(("drive-truck","truck1","s2","s11","driver1")),7) occurs(action(("drive-truck","truck5","s5","s9","driver2")),7) occurs(action(("unload-truck","package8","truck2","s13")),8) occurs(action(("load-truck","package12","truck5","s9")),8) occurs(action(("load-truck","package14","truck4","s15")),8) occurs(action(("drive-truck","truck1","s11","s3","driver1")),8) occurs(action(("drive-truck","truck3","s13","s15","driver5")),8) occurs(action(("unload-truck","package2","truck3","s15")),9) occurs(action(("unload-truck","package4","truck1","s3")),9) occurs(action(("drive-truck","truck2","s13","s1","driver4")),9) occurs(action(("drive-truck","truck5","s9","s2","driver2")),9) occurs(action(("drive-truck","truck4","s15","s3","driver3")),9) occurs(action(("unload-truck","package13","truck1","s3")),9) occurs(action(("unload-truck","package1","truck2","s1")),10) occurs(action(("unload-truck","package9","truck2","s1")),10) occurs(action(("drive-truck","truck5","s2","s6","driver2")),10) occurs(action(("load-truck","package11","truck2","s1")),10) occurs(action(("load-truck","package13","truck4","s3")),10) occurs(action(("load-truck","package6","truck2","s1")),10) occurs(action(("drive-truck","truck3","s15","s4","driver5")),10) occurs(action(("drive-truck","truck1","s3","s5","driver1")),10) occurs(action(("unload-truck","package12","truck5","s6")),11) occurs(action(("unload-truck","package15","truck3","s4")),11) occurs(action(("load-truck","package10","truck1","s5")),11) occurs(action(("drive-truck","truck4","s3","s10","driver3")),11) occurs(action(("drive-truck","truck2","s1","s10","driver4")),11) occurs(action(("disembark-truck","driver2","truck5","s6")),11) occurs(action(("unload-truck","package13","truck4","s10")),12) occurs(action(("unload-truck","package3","truck4","s10")),12) occurs(action(("drive-truck","truck3","s4","s5","driver5")),12) occurs(action(("unload-truck","package11","truck2","s10")),12) occurs(action(("unload-truck","package14","truck4","s10")),12) occurs(action(("unload-truck","package6","truck2","s10")),12) occurs(action(("drive-truck","truck1","s5","s2","driver1")),12) occurs(action(("walk","driver2","s6","p2-6")),12) occurs(action(("load-truck","package11","truck4","s10")),13) occurs(action(("load-truck","package14","truck2","s10")),13) occurs(action(("load-truck","package6","truck4","s10")),13) occurs(action(("drive-truck","truck1","s2","s11","driver1")),13) occurs(action(("walk","driver2","p2-6","s2")),13) occurs(action(("disembark-truck","driver5","truck3","s5")),13) occurs(action(("unload-truck","package10","truck1","s11")),14) occurs(action(("drive-truck","truck4","s10","s8","driver3")),14) occurs(action(("drive-truck","truck2","s10","s1","driver4")),14) occurs(action(("walk","driver5","s5","p5-15")),14) occurs(action(("walk","driver2","s2","p2-1")),14) occurs(action(("unload-truck","package11","truck4","s8")),15) occurs(action(("unload-truck","package14","truck2","s1")),15) occurs(action(("unload-truck","package6","truck4","s8")),15) occurs(action(("walk","driver5","p5-15","s15")),15) occurs(action(("disembark-truck","driver4","truck2","s1")),15) occurs(action(("walk","driver2","p2-1","s1")),15) occurs(action(("drive-truck","truck1","s11","s14","driver1")),15) occurs(action(("disembark-truck","driver3","truck4","s8")),15)
Solving Time: 2.67s
Memory: 194MB (+26MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 6.715s (Solving: 3.56s 1st Model: 2.64s Unsat: 0.91s)
CPU Time : 6.650s
Choices : 97312 (Domain: 97241)
Conflicts : 6809 (Analyzed: 6807)
Restarts : 72 (Average: 94.54 Last: 24)
Model-Level : 544.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 6807 (Deleted: 4036)
Binary : 108 (Ratio: 1.59%)
Ternary : 16 (Ratio: 0.24%)
Conflict : 6807 (Average Length: 556.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6807 (Average: 11.90 Max: 659 Sum: 81037)
Executed : 6627 (Average: 11.66 Max: 659 Sum: 79403 Ratio: 97.98%)
Bounded : 180 (Average: 9.08 Max: 17 Sum: 1634 Ratio: 2.02%)
Rules : 91278
Atoms : 91278
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 104064 (Eliminated: 0 Frozen: 92263)
Constraints : 554944 (Binary: 97.1% Ternary: 1.7% Other: 1.2%)
Memory Peak : 194MB
Max. Length : 15 steps
Sol. Length : 15 steps