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

169 lines
11 KiB
Plaintext

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.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.030s CPU, 0.024s wall-clock]
Generated 43 rules.
Computing model... [0.910s CPU, 0.915s wall-clock]
7130 relevant atoms
5437 auxiliary atoms
12567 final queue length
27375 total queue pushes
Completing instantiation... [2.230s CPU, 2.231s wall-clock]
Instantiating: [3.220s CPU, 3.217s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.060s CPU, 0.061s wall-clock]
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
Instantiating groups... [0.120s CPU, 0.125s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
Choosing groups...
51 uncovered facts
Choosing groups: [0.030s CPU, 0.029s wall-clock]
Building translation key... [0.010s CPU, 0.009s wall-clock]
Computing fact groups: [0.280s CPU, 0.281s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.100s CPU, 0.093s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.017s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.120s CPU, 0.119s wall-clock]
Translating task: [2.660s CPU, 2.652s 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.264s 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.590s 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.873s wall-clock]
Done! [9.050s CPU, 9.119s wall-clock]
planner.py version 0.0.1
Time: 1.85s
Memory: 174MB
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: 174MB (+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: 1.11s
Memory: 174MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 192MB (+18MB)
UNSAT
Iteration Time: 1.54s
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: 1.08s
Memory: 217MB (+25MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 237MB (+20MB)
UNSAT
Iteration Time: 1.48s
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: 1.28s
Memory: 277MB (+40MB)
Unblocking actions...
Solving...
Solving Time: 20.71s
Memory: 360MB (+83MB)
UNKNOWN
Iteration Time: 22.36s
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: 1.12s
Memory: 398MB (+38MB)
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","truck3","distributor1","distributor2")),1) occurs(action(("drive","truck1","depot0","distributor3")),1) occurs(action(("drive","truck0","distributor2","depot3")),1) occurs(action(("drive","truck2","depot1","depot3")),1) occurs(action(("lift","hoist6","crate8","crate7","distributor2")),1) occurs(action(("drop","hoist1","crate14","crate11","depot1")),2) occurs(action(("load","hoist6","crate8","truck3","distributor2")),2) occurs(action(("load","hoist3","crate5","truck2","depot3")),2) occurs(action(("load","hoist7","crate10","truck1","distributor3")),2) occurs(action(("lift","hoist7","crate0","pallet7","distributor3")),3) occurs(action(("lift","hoist6","crate7","pallet6","distributor2")),3) occurs(action(("lift","hoist3","crate2","pallet3","depot3")),3) occurs(action(("drive","truck1","distributor3","distributor2")),3) occurs(action(("drive","truck3","distributor2","distributor3")),3) occurs(action(("lift","hoist1","crate12","crate6","depot1")),3) occurs(action(("drive","truck2","depot3","depot1")),3) occurs(action(("load","hoist6","crate7","truck1","distributor2")),4) occurs(action(("load","hoist3","crate2","truck0","depot3")),4) occurs(action(("load","hoist7","crate0","truck3","distributor3")),4) occurs(action(("load","hoist1","crate12","truck2","depot1")),4) occurs(action(("unload","hoist7","crate8","truck3","distributor3")),5) occurs(action(("lift","hoist1","crate6","pallet1","depot1")),5) occurs(action(("drive","truck1","distributor2","depot1")),5) occurs(action(("drive","truck0","depot3","distributor2")),5) occurs(action(("drop","hoist7","crate8","pallet7","distributor3")),6) occurs(action(("unload","hoist6","crate2","truck0","distributor2")),6) occurs(action(("load","hoist1","crate6","truck1","depot1")),6) occurs(action(("drive","truck3","distributor3","distributor1")),6) occurs(action(("drop","hoist6","crate2","pallet6","distributor2")),7) occurs(action(("lift","hoist1","crate14","crate11","depot1")),7) occurs(action(("load","hoist5","crate9","truck3","distributor1")),7) occurs(action(("drive","truck0","distributor2","depot1")),7) occurs(action(("drive","truck1","depot1","distributor0")),7) occurs(action(("drop","hoist1","crate14","pallet1","depot1")),8) occurs(action(("unload","hoist4","crate6","truck1","distributor0")),8) occurs(action(("lift","hoist5","crate1","pallet5","distributor1")),8) occurs(action(("drop","hoist4","crate6","pallet4","distributor0")),9) occurs(action(("unload","hoist1","crate5","truck2","depot1")),9) occurs(action(("drive","truck1","distributor0","depot2")),9) occurs(action(("load","hoist5","crate1","truck3","distributor1")),9) occurs(action(("drop","hoist1","crate5","crate14","depot1")),10) occurs(action(("unload","hoist2","crate7","truck1","depot2")),10) occurs(action(("drive","truck2","depot1","depot0")),10) occurs(action(("drive","truck3","distributor1","depot3")),10) occurs(action(("drop","hoist2","crate7","pallet2","depot2")),11) occurs(action(("unload","hoist3","crate0","truck3","depot3")),11) occurs(action(("lift","hoist1","crate11","pallet8","depot1")),11) occurs(action(("load","hoist0","crate13","truck2","depot0")),11) occurs(action(("drive","truck1","depot2","depot0")),11) occurs(action(("drop","hoist3","crate0","pallet3","depot3")),12) occurs(action(("lift","hoist0","crate4","crate3","depot0")),12) occurs(action(("load","hoist1","crate11","truck0","depot1")),12) occurs(action(("drive","truck2","depot0","distributor0")),12) occurs(action(("drive","truck3","depot3","distributor3")),12) occurs(action(("unload","hoist7","crate9","truck3","distributor3")),13) occurs(action(("load","hoist0","crate4","truck1","depot0")),13) occurs(action(("drive","truck0","depot1","distributor1")),13) occurs(action(("unload","hoist4","crate12","truck2","distributor0")),13) occurs(action(("drop","hoist7","crate9","crate8","distributor3")),14) occurs(action(("lift","hoist0","crate3","pallet0","depot0")),14) occurs(action(("unload","hoist5","crate11","truck0","distributor1")),14) occurs(action(("drive","truck2","distributor0","distributor2")),14) occurs(action(("drop","hoist4","crate12","crate6","distributor0")),14) occurs(action(("drive","truck3","distributor3","distributor1")),14) occurs(action(("drop","hoist5","crate11","pallet5","distributor1")),15) occurs(action(("unload","hoist6","crate13","truck2","distributor2")),15) occurs(action(("load","hoist0","crate3","truck1","depot0")),15) occurs(action(("drive","truck0","distributor1","distributor3")),15) occurs(action(("drop","hoist6","crate13","crate2","distributor2")),16) occurs(action(("unload","hoist5","crate1","truck3","distributor1")),16) occurs(action(("drive","truck1","depot0","depot3")),16) occurs(action(("drop","hoist5","crate1","crate11","distributor1")),17) occurs(action(("unload","hoist3","crate3","truck1","depot3")),17) occurs(action(("drop","hoist3","crate3","crate0","depot3")),18) occurs(action(("drive","truck1","depot3","depot1")),18) occurs(action(("unload","hoist1","crate4","truck1","depot1")),19) occurs(action(("drop","hoist1","crate4","crate5","depot1")),20)
Solving Time: 0.25s
Memory: 419MB (+21MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 29.157s (Solving: 20.86s 1st Model: 0.17s Unsat: 0.02s)
CPU Time : 29.050s
Choices : 91509 (Domain: 91494)
Conflicts : 10048 (Analyzed: 10047)
Restarts : 100 (Average: 100.47 Last: 69)
Model-Level : 1011.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 10047 (Deleted: 6441)
Binary : 31 (Ratio: 0.31%)
Ternary : 9 (Ratio: 0.09%)
Conflict : 10047 (Average Length: 5062.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 10047 (Average: 5.48 Max: 526 Sum: 55076)
Executed : 10007 (Average: 5.43 Max: 526 Sum: 54512 Ratio: 98.98%)
Bounded : 40 (Average: 14.10 Max: 17 Sum: 564 Ratio: 1.02%)
Rules : 173284
Atoms : 173284
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 142641 (Eliminated: 0 Frozen: 123063)
Constraints : 1573532 (Binary: 98.3% Ternary: 0.8% Other: 0.9%)
Memory Peak : 423MB
Max. Length : 20 steps
Sol. Length : 20 steps