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-17.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-17.pddl Parsing... Parsing: [0.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock] Preparing model... [0.020s CPU, 0.018s wall-clock] Generated 43 rules. Computing model... [0.450s CPU, 0.450s wall-clock] 3667 relevant atoms 1884 auxiliary atoms 5551 final queue length 12993 total queue pushes Completing instantiation... [1.230s CPU, 1.227s wall-clock] Instantiating: [1.740s CPU, 1.732s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.050s CPU, 0.057s wall-clock] Checking invariant weight... [0.010s CPU, 0.005s wall-clock] Instantiating groups... [0.080s CPU, 0.080s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 42 uncovered facts Choosing groups: [0.020s CPU, 0.018s wall-clock] Building translation key... [0.010s CPU, 0.006s wall-clock] Computing fact groups: [0.190s CPU, 0.193s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.010s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.070s CPU, 0.068s wall-clock] Translating task: [1.480s CPU, 1.482s wall-clock] 3930 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 56 propositions removed Detecting unreachable propositions: [0.680s CPU, 0.680s wall-clock] Reordering and filtering variables... 50 of 50 variables necessary. 36 of 50 mutex groups necessary. 2938 of 2938 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.320s CPU, 0.316s wall-clock] Translator variables: 50 Translator derived variables: 0 Translator facts: 408 Translator goal facts: 7 Translator mutex groups: 36 Translator total mutex groups size: 556 Translator operators: 2938 Translator axioms: 0 Translator task size: 26125 Translator peak memory: 52684 KB Writing output... [0.440s CPU, 0.467s wall-clock] Done! [4.940s CPU, 4.970s wall-clock] planner.py version 0.0.1 Time: 1.03s Memory: 117MB 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: 117MB (+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.36s Memory: 117MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 120MB (+3MB) UNSAT Iteration Time: 0.53s 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.34s Memory: 131MB (+11MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 138MB (+7MB) SAT Testing... SERIALIZABLE Testing Time: 0.86s Memory: 138MB (+0MB) Answer: 1 occurs(action(("lift","hoist6","crate3","pallet6","depot0")),1) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),1) occurs(action(("drive","truck1","distributor1","depot1")),1) occurs(action(("drive","truck3","depot0","distributor0")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("drive","truck2","depot1","distributor1")),1) occurs(action(("lift","hoist3","crate8","crate6","distributor1")),1) occurs(action(("lift","hoist7","crate6","pallet7","distributor1")),2) occurs(action(("load","hoist3","crate8","truck0","distributor1")),2) occurs(action(("load","hoist1","crate4","truck1","depot1")),2) occurs(action(("drive","truck0","distributor1","depot0")),2) occurs(action(("drive","truck1","depot1","depot0")),2) occurs(action(("unload","hoist0","crate8","truck0","depot0")),3) occurs(action(("lift","hoist3","crate7","crate5","distributor1")),3) occurs(action(("unload","hoist5","crate4","truck1","depot0")),3) occurs(action(("load","hoist7","crate6","truck2","distributor1")),3) occurs(action(("drive","truck3","distributor0","depot1")),3) occurs(action(("drive","truck1","depot0","distributor0")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("drive","truck2","distributor1","depot1")),3) occurs(action(("drop","hoist0","crate8","pallet6","depot0")),4) occurs(action(("drop","hoist5","crate4","pallet0","depot0")),4) occurs(action(("unload","hoist1","crate6","truck2","depot1")),4) occurs(action(("lift","hoist7","crate1","pallet5","distributor1")),4) occurs(action(("load","hoist3","crate7","truck0","distributor1")),4) occurs(action(("drive","truck2","depot1","distributor0")),4) occurs(action(("drive","truck0","distributor1","depot0")),4) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),5) occurs(action(("drop","hoist6","crate3","crate8","depot0")),5) occurs(action(("drop","hoist7","crate1","pallet7","distributor1")),5) occurs(action(("unload","hoist4","crate7","truck0","depot0")),5) occurs(action(("drive","truck1","distributor0","depot1")),5) occurs(action(("drive","truck3","depot1","distributor0")),5) occurs(action(("drive","truck0","depot0","depot1")),5) occurs(action(("drive","truck2","distributor0","depot1")),5) occurs(action(("drop","hoist4","crate7","crate3","depot0")),6) occurs(action(("drive","truck1","depot1","distributor0")),7) occurs(action(("drive","truck3","distributor0","depot1")),8) occurs(action(("drive","truck1","distributor0","depot1")),9) occurs(action(("drive","truck2","depot1","depot0")),10) occurs(action(("drive","truck1","depot1","distributor1")),10) occurs(action(("drive","truck3","depot1","depot0")),10) SATISFIABLE Models : 1+ Calls : 3 Time : 2.147s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 2.076s Choices : 269 (Domain: 255) Conflicts : 6 (Analyzed: 5) Restarts : 0 Model-Level : 209.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 5 (Deleted: 0) Binary : 2 (Ratio: 40.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 5 (Average Length: 19.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 5 (Average: 14.40 Max: 59 Sum: 72) Executed : 5 (Average: 14.40 Max: 59 Sum: 72 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 77316 Atoms : 77316 Bodies : 1 (Original: 0) Tight : Yes Variables : 34302 (Eliminated: 0 Frozen: 3493) Constraints : 257032 (Binary: 97.5% Ternary: 1.3% Other: 1.2%) Memory Peak : 179MB Max. Length : 10 steps Sol. Length : 10 steps Models : 1