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-3.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-3.pddl Parsing... Parsing: [0.020s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 43 rules. Computing model... [0.080s CPU, 0.082s wall-clock] 582 relevant atoms 540 auxiliary atoms 1122 final queue length 1976 total queue pushes Completing instantiation... [0.130s CPU, 0.131s wall-clock] Instantiating: [0.240s CPU, 0.248s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.040s CPU, 0.037s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.020s CPU, 0.017s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 18 uncovered facts Choosing groups: [0.010s CPU, 0.004s wall-clock] Building translation key... [0.010s CPU, 0.002s wall-clock] Computing fact groups: [0.080s CPU, 0.070s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.003s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.007s wall-clock] Translating task: [0.140s CPU, 0.143s wall-clock] 432 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 26 propositions removed Detecting unreachable propositions: [0.080s CPU, 0.074s wall-clock] Reordering and filtering variables... 26 of 26 variables necessary. 18 of 26 mutex groups necessary. 336 of 336 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.040s CPU, 0.039s wall-clock] Translator variables: 26 Translator derived variables: 0 Translator facts: 132 Translator goal facts: 6 Translator mutex groups: 18 Translator total mutex groups size: 156 Translator operators: 336 Translator axioms: 0 Translator task size: 3146 Translator peak memory: 34904 KB Writing output... [0.050s CPU, 0.053s wall-clock] Done! [0.650s CPU, 0.657s wall-clock] planner.py version 0.0.1 Time: 0.15s Memory: 52MB 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: 52MB (+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.06s Memory: 54MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 55MB (+1MB) UNSAT Iteration Time: 0.08s 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.05s Memory: 57MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 58MB (+1MB) UNSAT Iteration Time: 0.07s 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.07s Memory: 61MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist2","crate5","crate2","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("load","hoist2","crate5","truck1","distributor1")),2) occurs(action(("load","hoist0","crate1","truck0","depot0")),2) occurs(action(("lift","hoist2","crate2","pallet2","distributor1")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("load","hoist1","crate4","truck1","distributor0")),4) occurs(action(("load","hoist2","crate2","truck0","distributor1")),4) occurs(action(("lift","hoist1","crate3","crate0","distributor0")),5) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),5) occurs(action(("drop","hoist2","crate1","pallet2","distributor1")),6) occurs(action(("load","hoist1","crate3","truck1","distributor0")),6) occurs(action(("drive","truck0","distributor1","distributor0")),6) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),7) occurs(action(("load","hoist1","crate0","truck0","distributor0")),8) occurs(action(("unload","hoist1","crate4","truck1","distributor0")),9) occurs(action(("drive","truck0","distributor0","distributor1")),9) occurs(action(("drop","hoist1","crate4","pallet1","distributor0")),10) occurs(action(("unload","hoist2","crate0","truck0","distributor1")),10) occurs(action(("drive","truck1","distributor0","distributor1")),10) occurs(action(("drop","hoist2","crate0","crate1","distributor1")),11) occurs(action(("drive","truck0","distributor1","depot0")),11) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),12) occurs(action(("unload","hoist0","crate2","truck0","depot0")),12) occurs(action(("drop","hoist2","crate5","crate0","distributor1")),13) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),13) occurs(action(("drive","truck1","distributor1","depot0")),13) occurs(action(("unload","hoist0","crate3","truck1","depot0")),14) occurs(action(("drop","hoist0","crate3","crate2","depot0")),15) Solving Time: 0.01s Memory: 63MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 0.400s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.390s Choices : 206 (Domain: 202) Conflicts : 39 (Analyzed: 37) Restarts : 0 Model-Level : 87.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 37 (Deleted: 0) Binary : 2 (Ratio: 5.41%) Ternary : 2 (Ratio: 5.41%) Conflict : 37 (Average Length: 18.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 37 (Average: 5.00 Max: 26 Sum: 185) Executed : 32 (Average: 3.68 Max: 26 Sum: 136 Ratio: 73.51%) Bounded : 5 (Average: 9.80 Max: 12 Sum: 49 Ratio: 26.49%) Rules : 10253 Atoms : 10253 Bodies : 1 (Original: 0) Tight : Yes Variables : 9819 (Eliminated: 0 Frozen: 6220) Constraints : 66612 (Binary: 93.3% Ternary: 3.2% Other: 3.5%) Memory Peak : 63MB Max. Length : 15 steps Sol. Length : 15 steps