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

169 lines
15 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-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.030s CPU, 0.033s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
Preparing model... [0.040s CPU, 0.034s wall-clock]
Generated 35 rules.
Computing model... [0.630s CPU, 0.634s wall-clock]
7293 relevant atoms
2871 auxiliary atoms
10164 final queue length
16104 total queue pushes
Completing instantiation... [1.090s CPU, 1.094s wall-clock]
Instantiating: [1.800s CPU, 1.802s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.030s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.070s CPU, 0.066s wall-clock]
Collecting mutex groups... [0.000s 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.150s CPU, 0.155s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s 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.230s CPU, 1.230s 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.630s 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.160s CPU, 0.159s 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.460s CPU, 0.512s wall-clock]
Done! [4.540s CPU, 4.588s 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.31s
Memory: 109MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 112MB (+3MB)
UNSAT
Iteration Time: 0.54s
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.34s
Memory: 128MB (+16MB)
Unblocking actions...
Solving...
Solving Time: 1.84s
Memory: 147MB (+19MB)
UNKNOWN
Iteration Time: 2.38s
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.33s
Memory: 155MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 2.64s
Memory: 178MB (+23MB)
UNKNOWN
Iteration Time: 3.18s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.40s
Memory: 192MB (+14MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package1","truck3","s12")),1) occurs(action(("load-truck","package13","truck1","s2")),1) occurs(action(("load-truck","package3","truck4","s3")),1) occurs(action(("load-truck","package8","truck3","s12")),1) occurs(action(("load-truck","package9","truck3","s12")),1) occurs(action(("walk","driver2","s13","p1-13")),1) occurs(action(("board-truck","driver1","truck5","s10")),1) occurs(action(("walk","driver3","s10","p2-10")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("walk","driver5","s2","p2-12")),1) occurs(action(("walk","driver2","p1-13","s1")),2) occurs(action(("drive-truck","truck5","s10","s1","driver1")),2) occurs(action(("walk","driver3","p2-10","s2")),2) occurs(action(("walk","driver4","p8-9","s8")),2) occurs(action(("walk","driver5","p2-12","s12")),2) occurs(action(("disembark-truck","driver1","truck5","s10")),2) occurs(action(("unload-truck","package3","truck4","s3")),2) occurs(action(("unload-truck","package13","truck1","s2")),2) occurs(action(("load-truck","package13","truck1","s2")),3) occurs(action(("board-truck","driver2","truck5","s1")),3) occurs(action(("board-truck","driver5","truck3","s12")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("board-truck","driver3","truck1","s2")),3) occurs(action(("drive-truck","truck3","s12","s5","driver5")),4) occurs(action(("drive-truck","truck2","s8","s11","driver4")),4) occurs(action(("load-truck","package3","truck4","s3")),4) occurs(action(("drive-truck","truck5","s1","s9","driver2")),4) occurs(action(("walk","driver1","s10","p2-10")),4) occurs(action(("load-truck","package10","truck3","s5")),5) occurs(action(("load-truck","package12","truck5","s9")),5) occurs(action(("load-truck","package5","truck1","s2")),5) occurs(action(("drive-truck","truck5","s9","s8","driver2")),5) occurs(action(("drive-truck","truck3","s5","s14","driver5")),5) occurs(action(("unload-truck","package1","truck3","s5")),5) occurs(action(("drive-truck","truck2","s11","s2","driver4")),5) occurs(action(("walk","driver1","p2-10","s2")),5) occurs(action(("disembark-truck","driver2","truck5","s9")),5) occurs(action(("disembark-truck","driver3","truck1","s2")),5) occurs(action(("disembark-truck","driver4","truck2","s11")),5) occurs(action(("drive-truck","truck1","s2","s9","driver3")),5) occurs(action(("load-truck","package15","truck3","s14")),6) occurs(action(("load-truck","package2","truck3","s14")),6) occurs(action(("drive-truck","truck3","s14","s8","driver5")),6) occurs(action(("board-truck","driver1","truck2","s2")),6) occurs(action(("board-truck","driver2","truck1","s9")),6) occurs(action(("unload-truck","package12","truck5","s8")),6) occurs(action(("unload-truck","package13","truck1","s9")),6) occurs(action(("walk","driver4","s11","p6-11")),6) occurs(action(("drive-truck","truck3","s8","s11","driver5")),7) occurs(action(("load-truck","package12","truck5","s8")),7) occurs(action(("drive-truck","truck2","s2","s9","driver1")),7) occurs(action(("unload-truck","package15","truck3","s8")),7) occurs(action(("unload-truck","package2","truck3","s8")),7) occurs(action(("walk","driver4","p6-11","s11")),7) occurs(action(("disembark-truck","driver5","truck3","s8")),7) occurs(action(("drive-truck","truck1","s9","s2","driver2")),7) occurs(action(("walk","driver3","s2","p2-1")),7) occurs(action(("drive-truck","truck2","s9","s1","driver1")),8) occurs(action(("load-truck","package13","truck2","s9")),8) occurs(action(("board-truck","driver4","truck3","s11")),8) occurs(action(("drive-truck","truck1","s2","s5","driver2")),8) occurs(action(("walk","driver3","p2-1","s1")),8) occurs(action(("unload-truck","package10","truck3","s11")),9) occurs(action(("load-truck","package1","truck1","s5")),9) occurs(action(("load-truck","package11","truck2","s1")),9) occurs(action(("drive-truck","truck1","s5","s3","driver2")),9) occurs(action(("load-truck","package6","truck2","s1")),9) occurs(action(("board-truck","driver5","truck5","s8")),9) occurs(action(("drive-truck","truck3","s11","s3","driver4")),9) occurs(action(("drive-truck","truck2","s1","s10","drive
Solving Time: 1.24s
Memory: 205MB (+13MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 8.923s (Solving: 5.65s 1st Model: 1.20s Unsat: 0.00s)
CPU Time : 8.860s
Choices : 143900
Conflicts : 24494 (Analyzed: 24493)
Restarts : 229 (Average: 106.96 Last: 112)
Model-Level : 1515.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 24493 (Deleted: 16049)
Binary : 1431 (Ratio: 5.84%)
Ternary : 755 (Ratio: 3.08%)
Conflict : 24493 (Average Length: 92.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 24493 (Average: 5.55 Max: 1292 Sum: 135843)
Executed : 24254 (Average: 5.42 Max: 1292 Sum: 132839 Ratio: 97.79%)
Bounded : 239 (Average: 12.57 Max: 22 Sum: 3004 Ratio: 2.21%)
Rules : 84868
Atoms : 84868
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 139869 (Eliminated: 0 Frozen: 12075)
Constraints : 620019 (Binary: 96.5% Ternary: 2.1% Other: 1.4%)
Memory Peak : 217MB
Max. Length : 20 steps
Sol. Length : 20 steps