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

169 lines
9.5 KiB
Plaintext
Raw 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-5.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-5.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.027s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 43 rules.
Computing model... [0.180s CPU, 0.187s wall-clock]
1194 relevant atoms
992 auxiliary atoms
2186 final queue length
4280 total queue pushes
Completing instantiation... [0.300s CPU, 0.304s wall-clock]
Instantiating: [0.540s CPU, 0.544s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.047s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.030s CPU, 0.031s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
22 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.110s CPU, 0.107s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.017s wall-clock]
Translating task: [0.350s CPU, 0.352s wall-clock]
1080 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
34 propositions removed
Detecting unreachable propositions: [0.170s CPU, 0.172s wall-clock]
Reordering and filtering variables...
38 of 38 variables necessary.
26 of 38 mutex groups necessary.
792 of 792 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.096s wall-clock]
Translator variables: 38
Translator derived variables: 0
Translator facts: 248
Translator goal facts: 10
Translator mutex groups: 26
Translator total mutex groups size: 296
Translator operators: 792
Translator axioms: 0
Translator task size: 7558
Translator peak memory: 37720 KB
Writing output... [0.120s CPU, 0.126s wall-clock]
Done! [1.430s CPU, 1.449s wall-clock]
planner.py version 0.0.1
Time: 0.29s
Memory: 63MB
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: 63MB (+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.13s
Memory: 64MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 67MB (+3MB)
UNSAT
Iteration Time: 0.17s
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.14s
Memory: 71MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 74MB (+3MB)
UNSAT
Iteration Time: 0.18s
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.15s
Memory: 81MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 84MB (+3MB)
UNSAT
Iteration Time: 0.21s
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.14s
Memory: 88MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist1","crate8","crate7","distributor0")),1) occurs(action(("lift","hoist0","crate4","crate3","depot0")),1) occurs(action(("lift","hoist2","crate9","crate5","distributor1")),1) occurs(action(("drive","truck1","distributor0","depot0")),1) occurs(action(("drive","truck0","depot0","distributor1")),1) occurs(action(("load","hoist2","crate9","truck0","distributor1")),2) occurs(action(("load","hoist0","crate4","truck1","depot0")),2) occurs(action(("lift","hoist0","crate3","crate1","depot0")),3) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),3) occurs(action(("drive","truck0","distributor1","distributor0")),3) occurs(action(("load","hoist1","crate8","truck0","distributor0")),4) occurs(action(("load","hoist0","crate3","truck1","depot0")),4) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),5) occurs(action(("lift","hoist1","crate7","crate6","distributor0")),5) occurs(action(("drive","truck0","distributor0","depot0")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("load","hoist1","crate7","truck1","distributor0")),6) occurs(action(("load","hoist0","crate1","truck0","depot0")),6) occurs(action(("unload","hoist0","crate9","truck0","depot0")),7) occurs(action(("lift","hoist1","crate6","pallet1","distributor0")),7) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),8) occurs(action(("load","hoist1","crate6","truck1","distributor0")),8) occurs(action(("drive","truck0","depot0","distributor1")),8) occurs(action(("load","hoist2","crate5","truck0","distributor1")),9) occurs(action(("drive","truck1","distributor0","depot0")),9) occurs(action(("unload","hoist0","crate6","truck1","depot0")),10) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),10) occurs(action(("drop","hoist0","crate6","crate9","depot0")),11) occurs(action(("load","hoist2","crate2","truck0","distributor1")),11) occurs(action(("unload","hoist0","crate4","truck1","depot0")),12) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),12) occurs(action(("drive","truck0","distributor1","distributor0")),12) occurs(action(("drop","hoist0","crate4","crate6","depot0")),13) occurs(action(("unload","hoist1","crate1","truck0","distributor0")),13) occurs(action(("drive","truck1","depot0","distributor1")),13) occurs(action(("drop","hoist1","crate1","pallet1","distributor0")),14) occurs(action(("load","hoist2","crate0","truck1","distributor1")),14) occurs(action(("drive","truck0","distributor0","depot0")),14) occurs(action(("unload","hoist0","crate5","truck0","depot0")),15) occurs(action(("unload","hoist2","crate3","truck1","distributor1")),15) occurs(action(("drop","hoist0","crate5","crate4","depot0")),16) occurs(action(("drop","hoist2","crate3","pallet2","distributor1")),16) occurs(action(("drive","truck1","distributor1","depot0")),16) occurs(action(("drive","truck0","depot0","distributor1")),16) occurs(action(("unload","hoist2","crate8","truck0","distributor1")),17) occurs(action(("unload","hoist0","crate0","truck1","depot0")),17) occurs(action(("drop","hoist2","crate8","crate3","distributor1")),18) occurs(action(("drop","hoist0","crate0","crate5","depot0")),18) occurs(action(("drive","truck0","distributor1","depot0")),18) occurs(action(("drive","truck1","depot0","distributor0")),18) occurs(action(("unload","hoist1","crate7","truck1","distributor0")),19) occurs(action(("unload","hoist0","crate2","truck0","depot0")),19) occurs(action(("drop","hoist1","crate7","crate1","distributor0")),20) occurs(action(("drive","truck0","depot0","distributor1")),20) occurs(action(("drive","truck1","distributor0","distributor1")),20) occurs(action(("drop","hoist0","crate2","crate0","depot0")),20)
Solving Time: 0.25s
Memory: 92MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 1.339s (Solving: 0.25s 1st Model: 0.24s Unsat: 0.01s)
CPU Time : 1.310s
Choices : 3306 (Domain: 3302)
Conflicts : 610 (Analyzed: 608)
Restarts : 5 (Average: 121.60 Last: 116)
Model-Level : 177.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 608 (Deleted: 0)
Binary : 2 (Ratio: 0.33%)
Ternary : 11 (Ratio: 1.81%)
Conflict : 608 (Average Length: 1230.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 608 (Average: 4.20 Max: 164 Sum: 2552)
Executed : 598 (Average: 3.97 Max: 164 Sum: 2414 Ratio: 94.59%)
Bounded : 10 (Average: 13.80 Max: 22 Sum: 138 Ratio: 5.41%)
Rules : 24585
Atoms : 24585
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 26698 (Eliminated: 0 Frozen: 18834)
Constraints : 222154 (Binary: 95.4% Ternary: 2.1% Other: 2.5%)
Memory Peak : 93MB
Max. Length : 20 steps
Sol. Length : 20 steps