tplp-planning-benchmark/fd-pb-e3/ipc-2002_depots-strips-automatic_11.out

156 lines
11 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.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/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.pddl
Parsing...
Parsing: [0.020s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.010s CPU, 0.015s wall-clock]
Generated 43 rules.
Computing model... [0.330s CPU, 0.324s wall-clock]
2415 relevant atoms
2024 auxiliary atoms
4439 final queue length
9131 total queue pushes
Completing instantiation... [0.710s CPU, 0.711s wall-clock]
Instantiating: [1.080s CPU, 1.082s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.050s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.060s CPU, 0.057s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
34 uncovered facts
Choosing groups: [0.020s CPU, 0.012s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.150s CPU, 0.148s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.037s wall-clock]
Translating task: [0.790s CPU, 0.794s wall-clock]
2520 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
46 propositions removed
Detecting unreachable propositions: [0.400s CPU, 0.395s wall-clock]
Reordering and filtering variables...
44 of 44 variables necessary.
32 of 44 mutex groups necessary.
1800 of 1800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.190s CPU, 0.191s wall-clock]
Translator variables: 44
Translator derived variables: 0
Translator facts: 356
Translator goal facts: 10
Translator mutex groups: 32
Translator total mutex groups size: 452
Translator operators: 1800
Translator axioms: 0
Translator task size: 16702
Translator peak memory: 43608 KB
Writing output... [0.260s CPU, 0.275s wall-clock]
Done! [2.930s CPU, 2.950s wall-clock]
planner.py version 0.0.1
Time: 5.13s
Memory: 306MB
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.03s
Memory: 306MB (+0MB)
UNSAT
Iteration Time: 0.03s
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: 2.90s
Memory: 617MB (+311MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 617MB (+0MB)
UNSAT
Iteration Time: 3.32s
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: 2.26s
Memory: 712MB (+95MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 712MB (+0MB)
UNSAT
Iteration Time: 2.75s
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: 2.43s
Memory: 807MB (+95MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate3","crate0","depot1")),1) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),1) occurs(action(("drive","truck0","depot2","distributor2")),1) occurs(action(("lift","hoist2","crate9","crate5","depot2")),2) occurs(action(("load","hoist5","crate8","truck0","distributor2")),2) occurs(action(("drive","truck1","distributor0","depot2")),2) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),3) occurs(action(("load","hoist2","crate9","truck1","depot2")),3) occurs(action(("drive","truck1","depot2","depot1")),3) occurs(action(("lift","hoist2","crate5","crate4","depot2")),4) occurs(action(("load","hoist5","crate7","truck0","distributor2")),4) occurs(action(("load","hoist1","crate3","truck1","depot1")),4) occurs(action(("drive","truck0","distributor2","depot1")),4) occurs(action(("drive","truck1","depot1","depot2")),4) occurs(action(("unload","hoist1","crate7","truck0","depot1")),5) occurs(action(("lift","hoist5","crate6","pallet5","distributor2")),5) occurs(action(("load","hoist2","crate5","truck1","depot2")),5) occurs(action(("drive","truck0","depot1","depot0")),5) occurs(action(("drive","truck1","depot2","distributor2")),5) occurs(action(("lift","hoist2","crate4","crate2","depot2")),6) occurs(action(("drop","hoist1","crate7","crate0","depot1")),6) occurs(action(("load","hoist5","crate6","truck1","distributor2")),6) occurs(action(("load","hoist0","crate1","truck0","depot0")),6) occurs(action(("drive","truck1","distributor2","depot2")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("unload","hoist3","crate8","truck0","distributor0")),7) occurs(action(("load","hoist2","crate4","truck1","depot2")),7) occurs(action(("drive","truck1","depot2","depot0")),7) occurs(action(("drive","truck0","distributor0","depot1")),7) occurs(action(("drop","hoist3","crate8","pallet3","distributor0")),8) occurs(action(("lift","hoist2","crate2","pallet2","depot2")),8) occurs(action(("unload","hoist0","crate4","truck1","depot0")),8) occurs(action(("unload","hoist1","crate1","truck0","depot1")),8) occurs(action(("drive","truck1","depot0","depot1")),8) occurs(action(("drive","truck0","depot1","depot2")),8) occurs(action(("lift","hoist3","crate8","pallet3","distributor0")),9) occurs(action(("load","hoist2","crate2","truck0","depot2")),9) occurs(action(("load","hoist1","crate1","truck1","depot1")),9) occurs(action(("drive","truck1","depot1","distributor1")),9) occurs(action(("drive","truck0","depot2","distributor2")),9) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),10) occurs(action(("lift","hoist1","crate7","crate0","depot1")),10) occurs(action(("unload","hoist5","crate2","truck0","distributor2")),10) occurs(action(("unload","hoist4","crate1","truck1","distributor1")),10) occurs(action(("drive","truck0","distributor2","depot1")),10) occurs(action(("drive","truck1","distributor1","depot2")),10) occurs(action(("drop","hoist3","crate8","pallet3","distributor0")),11) occurs(action(("drop","hoist5","crate2","pallet5","distributor2")),11) occurs(action(("drop","hoist4","crate1","pallet4","distributor1")),11) occurs(action(("unload","hoist2","crate5","truck1","depot2")),11) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),11) occurs(action(("load","hoist1","crate7","truck0","depot1")),11) occurs(action(("drive","truck0","depot1","distributor1")),11) occurs(action(("drive","truck1","depot2","distributor2")),11) occurs(action(("drop","hoist2","crate5","pallet2","depot2")),12) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),12) occurs(action(("unload","hoist5","crate9","truck1","distributor2")),12) occurs(action(("lift","hoist3","crate8","pallet3","distributor0")),12) occurs(action(("unload","hoist4","crate7","truck0","distributor1")),12) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),12) occurs(action(("drive","truck0","distributor1","depot1")),12) occurs(action(("drive","truck1","distributor2","depot2")),12) occurs(action(("drop","hoist5","crate9","crate2"
Solving Time: 0.68s
Memory: 808MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 14.793s (Solving: 0.54s 1st Model: 0.54s Unsat: 0.00s)
CPU Time : 14.760s
Choices : 9485
Conflicts : 3015 (Analyzed: 3014)
Restarts : 40 (Average: 75.35 Last: 71)
Model-Level : 93.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 3014 (Deleted: 785)
Binary : 281 (Ratio: 9.32%)
Ternary : 126 (Ratio: 4.18%)
Conflict : 3014 (Average Length: 94.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3014 (Average: 4.03 Max: 109 Sum: 12148)
Executed : 2838 (Average: 3.09 Max: 109 Sum: 9321 Ratio: 76.73%)
Bounded : 176 (Average: 16.06 Max: 17 Sum: 2827 Ratio: 23.27%)
Rules : 2337831
Atoms : 2337831
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 75524 (Eliminated: 0 Frozen: 66383)
Constraints : 269217 (Binary: 96.9% Ternary: 1.5% Other: 1.5%)
Memory Peak : 808MB
Max. Length : 15 steps
Sol. Length : 15 steps