tplp-planning-benchmark/fd-pb-e4/ipc-2002_depots-strips-automatic_20.out

156 lines
15 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-20.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-20.pddl
Parsing...
Parsing: [0.020s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.030s CPU, 0.026s wall-clock]
Generated 43 rules.
Computing model... [0.920s CPU, 0.921s wall-clock]
7130 relevant atoms
5437 auxiliary atoms
12567 final queue length
27375 total queue pushes
Completing instantiation... [2.240s CPU, 2.236s wall-clock]
Instantiating: [3.240s CPU, 3.231s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.056s wall-clock]
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
Instantiating groups... [0.120s CPU, 0.124s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
Choosing groups...
51 uncovered facts
Choosing groups: [0.030s CPU, 0.027s wall-clock]
Building translation key... [0.010s CPU, 0.009s wall-clock]
Computing fact groups: [0.270s CPU, 0.272s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.090s CPU, 0.094s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.016s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.120s CPU, 0.120s wall-clock]
Translating task: [2.660s CPU, 2.656s wall-clock]
8070 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
70 propositions removed
Detecting unreachable propositions: [1.260s CPU, 1.260s wall-clock]
Reordering and filtering variables...
67 of 67 variables necessary.
48 of 67 mutex groups necessary.
5894 of 5894 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.590s CPU, 0.592s wall-clock]
Translator variables: 67
Translator derived variables: 0
Translator facts: 773
Translator goal facts: 14
Translator mutex groups: 48
Translator total mutex groups size: 993
Translator operators: 5894
Translator axioms: 0
Translator task size: 52919
Translator peak memory: 65880 KB
Writing output... [0.810s CPU, 0.875s wall-clock]
Done! [9.060s CPU, 9.131s wall-clock]
planner.py version 0.0.1
Time: 42.12s
Memory: 1967MB
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.18s
Memory: 1967MB (+0MB)
UNSAT
Iteration Time: 0.18s
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: 5.18s
Memory: 2084MB (+117MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 2203MB (+119MB)
UNSAT
Iteration Time: 6.60s
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.29s
Memory: 2342MB (+139MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 2427MB (+85MB)
UNSAT
Iteration Time: 7.03s
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: 5.37s
Memory: 2550MB (+123MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist5","crate9","crate1","distributor1")),1) occurs(action(("lift","hoist3","crate5","crate2","depot3")),1) occurs(action(("lift","hoist7","crate10","crate0","distributor3")),1) occurs(action(("lift","hoist1","crate14","crate12","depot1")),1) occurs(action(("lift","hoist0","crate13","crate4","depot0")),1) occurs(action(("drive","truck2","depot1","depot0")),1) occurs(action(("drive","truck3","distributor1","depot1")),1) occurs(action(("drive","truck1","depot0","distributor3")),1) occurs(action(("drive","truck0","distributor2","depot3")),1) occurs(action(("lift","hoist6","crate8","crate7","distributor2")),1) occurs(action(("load","hoist3","crate5","truck0","depot3")),2) occurs(action(("load","hoist1","crate14","truck3","depot1")),2) occurs(action(("load","hoist0","crate13","truck2","depot0")),2) occurs(action(("drive","truck2","depot0","depot2")),2) occurs(action(("drive","truck0","depot3","distributor1")),2) occurs(action(("drive","truck3","depot1","distributor3")),2) occurs(action(("load","hoist7","crate10","truck1","distributor3")),2) occurs(action(("drive","truck1","distributor3","depot0")),2) occurs(action(("unload","hoist2","crate13","truck2","depot2")),3) occurs(action(("lift","hoist3","crate2","pallet3","depot3")),3) occurs(action(("drop","hoist6","crate8","crate7","distributor2")),3) occurs(action(("load","hoist5","crate9","truck0","distributor1")),3) occurs(action(("unload","hoist7","crate14","truck3","distributor3")),3) occurs(action(("drive","truck0","distributor1","distributor0")),3) occurs(action(("drive","truck1","depot0","depot3")),3) occurs(action(("lift","hoist1","crate12","crate6","depot1")),3) occurs(action(("unload","hoist0","crate10","truck1","depot0")),3) occurs(action(("drive","truck2","depot2","depot1")),3) occurs(action(("unload","hoist4","crate9","truck0","distributor0")),4) occurs(action(("load","hoist3","crate2","truck1","depot3")),4) occurs(action(("load","hoist7","crate14","truck3","distributor3")),4) occurs(action(("drive","truck2","depot1","depot0")),4) occurs(action(("drive","truck0","distributor0","depot1")),4) occurs(action(("drive","truck3","distributor3","distributor2")),4) occurs(action(("drive","truck1","depot3","distributor3")),4) occurs(action(("drop","hoist0","crate10","crate4","depot0")),4) occurs(action(("lift","hoist6","crate8","crate7","distributor2")),4) occurs(action(("load","hoist1","crate12","truck2","depot1")),4) occurs(action(("drop","hoist4","crate9","pallet4","distributor0")),5) occurs(action(("load","hoist6","crate8","truck3","distributor2")),5) occurs(action(("lift","hoist1","crate11","pallet8","depot1")),5) occurs(action(("drop","hoist2","crate13","pallet2","depot2")),5) occurs(action(("unload","hoist7","crate2","truck1","distributor3")),5) occurs(action(("unload","hoist0","crate12","truck2","depot0")),5) occurs(action(("drive","truck1","distributor3","depot0")),5) occurs(action(("drive","truck3","distributor2","distributor1")),5) occurs(action(("lift","hoist6","crate7","pallet6","distributor2")),6) occurs(action(("drop","hoist7","crate2","crate0","distributor3")),6) occurs(action(("unload","hoist5","crate14","truck3","distributor1")),6) occurs(action(("load","hoist1","crate11","truck0","depot1")),6) occurs(action(("drive","truck0","depot1","distributor1")),6) occurs(action(("drive","truck2","depot0","distributor2")),6) occurs(action(("drive","truck1","depot0","depot3")),6) occurs(action(("drive","truck3","distributor1","depot3")),6) occurs(action(("load","hoist0","crate12","truck2","depot0")),6) occurs(action(("lift","hoist4","crate9","pallet4","distributor0")),7) occurs(action(("lift","hoist7","crate2","crate0","distributor3")),7) occurs(action(("lift","hoist1","crate6","pallet1","depot1")),7) occurs(action(("lift","hoist2","crate13","pallet2","depot2")),7) occurs(action(("unload","hoist3","crate8","truck3","depot3")),7) occurs(action(("load","hoist6","crate7","truck2","distributor2")),7) occurs(action(("load","hoist5","crate14","truck0","distributor1")),7) occurs(action(("drive","truck1","depot3","depot1")),7) occurs(action(("drive","truc
Solving Time: 1.57s
Memory: 2715MB (+165MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 64.730s (Solving: 1.44s 1st Model: 1.42s Unsat: 0.01s)
CPU Time : 64.560s
Choices : 23350
Conflicts : 1833 (Analyzed: 1832)
Restarts : 21 (Average: 87.24 Last: 61)
Model-Level : 1228.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 1832 (Deleted: 0)
Binary : 159 (Ratio: 8.68%)
Ternary : 77 (Ratio: 4.20%)
Conflict : 1832 (Average Length: 204.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1832 (Average: 12.62 Max: 956 Sum: 23120)
Executed : 1686 (Average: 11.35 Max: 956 Sum: 20787 Ratio: 89.91%)
Bounded : 146 (Average: 15.98 Max: 17 Sum: 2333 Ratio: 10.09%)
Rules : 16811348
Atoms : 16811348
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 103289 (Eliminated: 0 Frozen: 82242)
Constraints : 888815 (Binary: 98.0% Ternary: 1.0% Other: 1.0%)
Memory Peak : 2780MB
Max. Length : 15 steps
Sol. Length : 15 steps