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

169 lines
12 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-9.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-9.pddl
Parsing...
Parsing: [0.010s CPU, 0.019s 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.021s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 43 rules.
Computing model... [0.320s CPU, 0.325s wall-clock]
2520 relevant atoms
1935 auxiliary atoms
4455 final queue length
9269 total queue pushes
Completing instantiation... [0.720s CPU, 0.721s wall-clock]
Instantiating: [1.090s CPU, 1.094s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.049s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.060s CPU, 0.064s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
33 uncovered facts
Choosing groups: [0.020s CPU, 0.017s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.180s CPU, 0.172s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.010s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.039s wall-clock]
Translating task: [0.810s CPU, 0.817s wall-clock]
2610 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
50 propositions removed
Detecting unreachable propositions: [0.410s CPU, 0.406s wall-clock]
Reordering and filtering variables...
56 of 56 variables necessary.
39 of 56 mutex groups necessary.
1812 of 1812 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.220s CPU, 0.227s wall-clock]
Translator variables: 56
Translator derived variables: 0
Translator facts: 489
Translator goal facts: 13
Translator mutex groups: 39
Translator total mutex groups size: 564
Translator operators: 1812
Translator axioms: 0
Translator task size: 17538
Translator peak memory: 43864 KB
Writing output... [0.270s CPU, 0.290s wall-clock]
Done! [3.050s CPU, 3.079s wall-clock]
planner.py version 0.0.1
Time: 5.78s
Memory: 365MB
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: 365MB (+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: 4.71s
Memory: 848MB (+483MB)
Unblocking actions...
Solving...
Solving Time: 0.17s
Memory: 851MB (+3MB)
UNSAT
Iteration Time: 5.71s
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: 5.93s
Memory: 1118MB (+267MB)
Unblocking actions...
Solving...
Solving Time: 0.22s
Memory: 1124MB (+6MB)
UNSAT
Iteration Time: 7.10s
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: 4.35s
Memory: 1287MB (+163MB)
Unblocking actions...
Solving...
Solving Time: 0.35s
Memory: 1301MB (+14MB)
UNSAT
Iteration Time: 5.75s
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: 4.57s
Memory: 1463MB (+162MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate13","crate4","distributor1")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist1","crate14","crate9","distributor0")),1) occurs(action(("lift","hoist0","crate8","pallet5","depot0")),2) occurs(action(("load","hoist1","crate14","truck0","distributor0")),2) occurs(action(("load","hoist2","crate13","truck1","distributor1")),2) occurs(action(("drive","truck1","distributor1","depot0")),2) occurs(action(("lift","hoist1","crate9","crate7","distributor0")),3) occurs(action(("lift","hoist2","crate4","crate0","distributor1")),3) occurs(action(("drive","truck0","distributor0","distributor1")),3) occurs(action(("load","hoist0","crate8","truck1","depot0")),3) occurs(action(("drive","truck1","depot0","distributor0")),3) occurs(action(("lift","hoist0","crate2","crate1","depot0")),4) occurs(action(("load","hoist1","crate9","truck1","distributor0")),4) occurs(action(("load","hoist2","crate4","truck0","distributor1")),4) occurs(action(("drive","truck0","distributor1","depot0")),4) occurs(action(("drive","truck1","distributor0","depot0")),4) occurs(action(("lift","hoist1","crate7","crate6","distributor0")),5) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),5) occurs(action(("load","hoist0","crate2","truck0","depot0")),5) occurs(action(("drive","truck0","depot0","distributor1")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),6) occurs(action(("drive","truck0","distributor1","depot0")),6) occurs(action(("load","hoist2","crate0","truck0","distributor1")),6) occurs(action(("load","hoist1","crate7","truck1","distributor0")),6) occurs(action(("lift","hoist1","crate6","crate3","distributor0")),7) occurs(action(("lift","hoist2","crate10","crate5","distributor1")),7) occurs(action(("load","hoist0","crate1","truck0","depot0")),7) occurs(action(("drive","truck1","distributor0","depot0")),7) occurs(action(("drive","truck0","depot0","distributor0")),7) occurs(action(("drop","hoist2","crate10","pallet2","distributor1")),8) occurs(action(("load","hoist1","crate6","truck0","distributor0")),8) occurs(action(("drive","truck0","distributor0","depot0")),8) occurs(action(("unload","hoist0","crate7","truck1","depot0")),8) occurs(action(("lift","hoist2","crate5","pallet3","distributor1")),9) occurs(action(("lift","hoist1","crate3","pallet1","distributor0")),9) occurs(action(("drive","truck0","depot0","distributor1")),9) occurs(action(("load","hoist0","crate7","truck0","depot0")),9) occurs(action(("drive","truck1","depot0","distributor0")),9) occurs(action(("load","hoist2","crate5","truck0","distributor1")),10) occurs(action(("load","hoist1","crate3","truck1","distributor0")),10) occurs(action(("drive","truck1","distributor0","depot0")),10) occurs(action(("unload","hoist0","crate3","truck1","depot0")),11) occurs(action(("unload","hoist2","crate2","truck0","distributor1")),11) occurs(action(("lift","hoist1","crate12","crate11","distributor0")),11) occurs(action(("drive","truck0","distributor1","depot0")),11) occurs(action(("drive","truck1","depot0","distributor0")),11) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),12) occurs(action(("drop","hoist2","crate2","crate10","distributor1")),12) occurs(action(("load","hoist1","crate12","truck1","distributor0")),12) occurs(action(("drive","truck1","distributor0","depot0")),12) occurs(action(("drive","truck0","depot0","distributor1")),12) occurs(action(("lift","hoist1","crate11","pallet4","distributor0")),13) occurs(action(("unload","hoist0","crate13","truck1","depot0")),13) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),13) occurs(action(("drive","truck0","distributor1","depot0")),13) occurs(action(("drop","hoist0","crate13","crate3","depot0")),14) occurs(action(("drop","hoist1","crate11","pallet1","distributor0")),14) occurs(action(("drop","hoist2","crate1","crate2","distributor1")),14) occurs(action(("drive","truck1","depot0","distributor1")),14) occurs(action(("unload","hoist2","crate9","truck1","distribu
Solving Time: 1.75s
Memory: 1477MB (+14MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 31.796s (Solving: 1.63s 1st Model: 1.48s Unsat: 0.15s)
CPU Time : 31.760s
Choices : 10796
Conflicts : 5201 (Analyzed: 5199)
Restarts : 60 (Average: 86.65 Last: 60)
Model-Level : 68.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 5199 (Deleted: 2332)
Binary : 290 (Ratio: 5.58%)
Ternary : 258 (Ratio: 4.96%)
Conflict : 5199 (Average Length: 152.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 5199 (Average: 2.63 Max: 113 Sum: 13651)
Executed : 5043 (Average: 2.05 Max: 113 Sum: 10679 Ratio: 78.23%)
Bounded : 156 (Average: 19.05 Max: 22 Sum: 2972 Ratio: 21.77%)
Rules : 2602638
Atoms : 2602638
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 111966 (Eliminated: 0 Frozen: 99826)
Constraints : 400983 (Binary: 96.3% Ternary: 1.9% Other: 1.8%)
Memory Peak : 1495MB
Max. Length : 20 steps
Sol. Length : 20 steps