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

156 lines
12 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-18.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-18.pddl
Parsing...
Parsing: [0.040s CPU, 0.035s wall-clock]
Normalizing task... [0.000s 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.036s wall-clock]
Generated 35 rules.
Computing model... [0.980s CPU, 0.979s wall-clock]
10402 relevant atoms
3678 auxiliary atoms
14080 final queue length
22680 total queue pushes
Completing instantiation... [1.810s CPU, 1.815s wall-clock]
Instantiating: [2.870s CPU, 2.873s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.040s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.110s CPU, 0.101s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.006s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.020s CPU, 0.017s wall-clock]
Building translation key... [0.010s CPU, 0.011s wall-clock]
Computing fact groups: [0.230s CPU, 0.227s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.100s CPU, 0.101s wall-clock]
Translating task: [2.020s CPU, 2.016s wall-clock]
500 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [1.010s CPU, 1.004s wall-clock]
Reordering and filtering variables...
32 of 35 variables necessary.
5 of 35 mutex groups necessary.
8360 of 8960 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.250s CPU, 0.249s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 825
Translator goal facts: 23
Translator mutex groups: 5
Translator total mutex groups size: 30
Translator operators: 8360
Translator axioms: 0
Translator task size: 35190
Translator peak memory: 62668 KB
Writing output... [0.700s CPU, 0.760s wall-clock]
Done! [7.210s CPU, 7.268s wall-clock]
planner.py version 0.0.1
Time: 1.36s
Memory: 140MB
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.01s
Memory: 140MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.45s
Memory: 140MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 148MB (+8MB)
UNSAT
Iteration Time: 0.81s
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: 167MB (+19MB)
Unblocking actions...
Solving...
Solving Time: 3.41s
Memory: 188MB (+21MB)
UNKNOWN
Iteration Time: 4.17s
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.52s
Memory: 215MB (+27MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package1","truck2","s3")),1) occurs(action(("load-truck","package10","truck2","s3")),1) occurs(action(("load-truck","package15","truck2","s3")),1) occurs(action(("load-truck","package16","truck5","s2")),1) occurs(action(("load-truck","package4","truck5","s2")),1) occurs(action(("walk","driver1","s11","p11-8")),1) occurs(action(("walk","driver2","s6","p6-15")),1) occurs(action(("walk","driver3","s1","p1-7")),1) occurs(action(("walk","driver4","s2","p2-12")),1) occurs(action(("walk","driver5","s4","p2-4")),1) occurs(action(("walk","driver1","p11-8","s8")),2) occurs(action(("walk","driver2","p6-15","s15")),2) occurs(action(("walk","driver3","p1-7","s7")),2) occurs(action(("walk","driver4","p2-12","s12")),2) occurs(action(("walk","driver5","p2-4","s2")),2) occurs(action(("board-truck","driver5","truck5","s2")),3) occurs(action(("board-truck","driver1","truck3","s8")),3) occurs(action(("board-truck","driver4","truck1","s12")),3) occurs(action(("walk","driver2","s15","p5-15")),3) occurs(action(("drive-truck","truck1","s12","s17","driver4")),4) occurs(action(("drive-truck","truck5","s2","s15","driver5")),4) occurs(action(("drive-truck","truck3","s8","s7","driver1")),4) occurs(action(("walk","driver2","p5-15","s5")),4) occurs(action(("disembark-truck","driver4","truck1","s12")),4) occurs(action(("drive-truck","truck3","s7","s13","driver1")),5) occurs(action(("load-truck","package18","truck5","s15")),5) occurs(action(("load-truck","package7","truck3","s7")),5) occurs(action(("drive-truck","truck5","s15","s17","driver5")),5) occurs(action(("walk","driver2","s5","p5-3")),5) occurs(action(("walk","driver4","s12","p12-8")),5) occurs(action(("load-truck","package13","truck3","s13")),6) occurs(action(("drive-truck","truck5","s17","s3","driver5")),6) occurs(action(("drive-truck","truck3","s13","s10","driver1")),6) occurs(action(("walk","driver2","p5-3","s3")),6) occurs(action(("walk","driver4","p12-8","s8")),6) occurs(action(("unload-truck","package18","truck5","s3")),7) occurs(action(("unload-truck","package7","truck3","s10")),7) occurs(action(("load-truck","package5","truck5","s3")),7) occurs(action(("load-truck","package6","truck3","s10")),7) occurs(action(("board-truck","driver2","truck2","s3")),7) occurs(action(("unload-truck","package13","truck3","s10")),7) occurs(action(("unload-truck","package16","truck5","s3")),7) occurs(action(("unload-truck","package4","truck5","s3")),7) occurs(action(("board-truck","driver4","truck4","s8")),7) occurs(action(("drive-truck","truck5","s3","s14","driver5")),7) occurs(action(("drive-truck","truck3","s10","s0","driver1")),7) occurs(action(("load-truck","package14","truck5","s14")),8) occurs(action(("load-truck","package16","truck2","s3")),8) occurs(action(("drive-truck","truck3","s0","s16","driver1")),8) occurs(action(("load-truck","package4","truck2","s3")),8) occurs(action(("drive-truck","truck2","s3","s18","driver2")),8) occurs(action(("drive-truck","truck5","s14","s2","driver5")),8) occurs(action(("drive-truck","truck4","s8","s0","driver4")),8) occurs(action(("unload-truck","package15","truck2","s18")),9) occurs(action(("load-truck","package11","truck3","s16")),9) occurs(action(("drive-truck","truck4","s0","s16","driver4")),9) occurs(action(("drive-truck","truck5","s2","s15","driver5")),9) occurs(action(("load-truck","package9","truck2","s18")),9) occurs(action(("drive-truck","truck2","s18","s10","driver2")),9) occurs(action(("unload-truck","package16","truck2","s18")),9) occurs(action(("unload-truck","package5","truck5","s2")),9) occurs(action(("drive-truck","truck3","s16","s0","driver1")),9) occurs(action(("unload-truck","package10","truck2","s10")),10) occurs(action(("unload-truck","package14","truck5","s15")),10) occurs(action(("unload-truck","package4","truck2","s10")),10) occurs(action(("drive-truck","truck3","s0","s13","driver1")),10) occurs(action(("load-truck","package12","truck2","s10")),10) occurs(action(("load-truck","package13","truck2","s10")),10) occurs(action(("drive-truck","truck4","s16","s18","driver4")),10) occurs(action(("load-truck","package19
Solving Time: 0.12s
Memory: 252MB (+37MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 7.378s (Solving: 3.47s 1st Model: 0.07s Unsat: 0.00s)
CPU Time : 7.292s
Choices : 41592 (Domain: 41584)
Conflicts : 9566 (Analyzed: 9565)
Restarts : 101 (Average: 94.70 Last: 62)
Model-Level : 608.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 9565 (Deleted: 6367)
Binary : 79 (Ratio: 0.83%)
Ternary : 26 (Ratio: 0.27%)
Conflict : 9565 (Average Length: 717.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9565 (Average: 3.50 Max: 341 Sum: 33452)
Executed : 9535 (Average: 3.48 Max: 341 Sum: 33274 Ratio: 99.47%)
Bounded : 30 (Average: 5.93 Max: 17 Sum: 178 Ratio: 0.53%)
Rules : 114909
Atoms : 114909
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 140637 (Eliminated: 0 Frozen: 11433)
Constraints : 561570 (Binary: 96.7% Ternary: 1.9% Other: 1.3%)
Memory Peak : 252MB
Max. Length : 15 steps
Sol. Length : 15 steps