INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-14.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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-14.pddl Parsing... Parsing: [0.020s CPU, 0.019s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock] Preparing model... [0.010s CPU, 0.015s wall-clock] Generated 43 rules. Computing model... [0.150s CPU, 0.144s wall-clock] 895 relevant atoms 1006 auxiliary atoms 1901 final queue length 3133 total queue pushes Completing instantiation... [0.210s CPU, 0.212s wall-clock] Instantiating: [0.400s CPU, 0.401s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.030s CPU, 0.030s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.006s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 52 uncovered facts Choosing groups: [0.000s CPU, 0.003s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [0.050s CPU, 0.051s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s CPU, 0.011s wall-clock] Translating task: [0.240s CPU, 0.238s wall-clock] 800 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 37 propositions removed Detecting unreachable propositions: [0.130s CPU, 0.124s wall-clock] Reordering and filtering variables... 29 of 44 variables necessary. 2 of 9 mutex groups necessary. 564 of 564 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.055s wall-clock] Translator variables: 29 Translator derived variables: 0 Translator facts: 161 Translator goal facts: 5 Translator mutex groups: 2 Translator total mutex groups size: 12 Translator operators: 564 Translator axioms: 0 Translator task size: 4253 Translator peak memory: 39116 KB Writing output... [0.080s CPU, 0.084s wall-clock] Done! [0.980s CPU, 0.988s wall-clock] planner.py version 0.0.1 Time: 0.20s Memory: 60MB 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: 61MB (+1MB) 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 Expected Memory: 61MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.05s Memory: 61MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 61MB (+0MB) UNSAT Iteration Time: 0.07s 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 Expected Memory: 61MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.06s Memory: 64MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 66MB (+2MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.19s Memory: 73MB (+7MB) Solving... Solving Time: 1.40s Memory: 72MB (+-1MB) UNKNOWN Iteration Time: 1.67s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 77.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.09s Memory: 73MB (+1MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 75MB (+2MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 75MB (+0MB) Answer: 2 occurs(action(("move","hoist0","depot0-1-1","depot0-2-1")),1) occurs(action(("move","hoist1","depot1-1-2","depot1-1-3")),1) occurs(action(("move","hoist0","depot0-2-1","depot0-2-2")),2) occurs(action(("move","hoist1","depot1-1-3","depot1-2-3")),2) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),3) occurs(action(("go-out","hoist1","depot1-2-3","loadarea")),3) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),4) occurs(action(("lift","hoist1","crate3","container-0-3","loadarea","container0")),4) occurs(action(("go-in","hoist0","loadarea","depot0-2-2")),5) occurs(action(("go-in","hoist1","loadarea","depot1-2-3")),5) occurs(action(("drop","hoist0","crate1","depot0-2-1","depot0-2-2","depot0")),6) occurs(action(("drop","hoist1","crate3","depot1-1-3","depot1-2-3","depot1")),6) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),7) occurs(action(("go-out","hoist1","depot1-2-3","loadarea")),7) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),8) occurs(action(("lift","hoist1","crate4","container-1-0","loadarea","container1")),8) occurs(action(("drop","hoist1","crate4","depot1-2-3","loadarea","depot1")),9) occurs(action(("go-in","hoist0","loadarea","depot0-2-2")),9) occurs(action(("drop","hoist0","crate2","depot0-1-2","depot0-2-2","depot0")),10) occurs(action(("lift","hoist1","crate0","container-0-0","loadarea","container0")),10) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),11) occurs(action(("drop","hoist1","crate0","depot0-2-2","loadarea","depot0")),12) occurs(action(("go-in","hoist0","loadarea","container-0-2")),13) occurs(action(("go-in","hoist1","loadarea","container-0-1")),13) occurs(action(("go-out","hoist1","container-0-1","loadarea")),14) occurs(action(("go-in","hoist1","loadarea","container-0-0")),15) SATISFIABLE Models : 1+ Calls : 5 Time : 1.994s (Solving: 1.47s 1st Model: 0.07s Unsat: 0.00s) CPU Time : 1.980s Choices : 26526 (Domain: 25708) Conflicts : 10004 (Analyzed: 10003) Restarts : 102 (Average: 98.07 Last: 101) Model-Level : 65.5 Problems : 5 (Average Length: 10.00 Splits: 0) Lemmas : 10003 (Deleted: 6122) Binary : 139 (Ratio: 1.39%) Ternary : 352 (Ratio: 3.52%) Conflict : 10003 (Average Length: 89.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 10003 (Average: 2.59 Max: 80 Sum: 25867) Executed : 9973 (Average: 2.55 Max: 80 Sum: 25535 Ratio: 98.72%) Bounded : 30 (Average: 11.07 Max: 17 Sum: 332 Ratio: 1.28%) Rules : 23180 (Original: 23029) Atoms : 14613 Bodies : 6116 (Original: 5990) Count : 150 (Original: 174) Equivalences : 3221 (Atom=Atom: 33 Body=Body: 0 Other: 3188) Tight : Yes Variables : 13472 (Eliminated: 0 Frozen: 7695) Constraints : 88263 (Binary: 95.1% Ternary: 2.8% Other: 2.1%) Memory Peak : 75MB Max. Length : 15 steps Sol. Length : 15 steps Models : 2