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-7.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-7.pddl Parsing... Parsing: [0.020s CPU, 0.025s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.030s wall-clock] Preparing model... [0.020s CPU, 0.014s wall-clock] Generated 43 rules. Computing model... [0.060s CPU, 0.062s wall-clock] 291 relevant atoms 424 auxiliary atoms 715 final queue length 982 total queue pushes Completing instantiation... [0.060s CPU, 0.052s wall-clock] Instantiating: [0.170s CPU, 0.165s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.030s CPU, 0.034s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.002s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 25 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.040s CPU, 0.042s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.003s wall-clock] Translating task: [0.050s CPU, 0.055s wall-clock] 180 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 22 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.030s wall-clock] Reordering and filtering variables... 17 of 20 variables necessary. 1 of 5 mutex groups necessary. 130 of 130 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.014s wall-clock] Translator variables: 17 Translator derived variables: 0 Translator facts: 66 Translator goal facts: 3 Translator mutex groups: 1 Translator total mutex groups size: 4 Translator operators: 130 Translator axioms: 0 Translator task size: 1056 Translator peak memory: 36812 KB Writing output... [0.020s CPU, 0.022s wall-clock] Done! [0.350s CPU, 0.360s wall-clock] planner.py version 0.0.1 Time: 0.05s Memory: 51MB 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: 51MB (+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 Expected Memory: 51MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.02s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.02s 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: 53.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.02s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.03s Memory: 54MB (+0MB) Answer: 1 occurs(action(("move","hoist0","depot0-1-3","depot0-1-2")),1) occurs(action(("move","hoist0","depot0-1-2","depot0-1-1")),2) occurs(action(("move","hoist0","depot0-1-1","depot0-2-1")),3) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),4) occurs(action(("go-in","hoist0","loadarea","depot0-2-1")),5) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),5) occurs(action(("drop","hoist0","crate2","depot0-1-1","depot0-2-1","depot0")),6) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),6) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),7) occurs(action(("go-in","hoist0","loadarea","depot0-2-1")),7) occurs(action(("drop","hoist0","crate1","depot0-2-2","depot0-2-1","depot0")),8) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),8) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),9) occurs(action(("drop","hoist0","crate0","depot0-2-1","loadarea","depot0")),10) occurs(action(("go-in","hoist0","loadarea","container-0-0")),10) SATISFIABLE Models : 1+ Calls : 3 Time : 0.098s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.088s Choices : 30 (Domain: 25) Conflicts : 9 (Analyzed: 9) Restarts : 0 Model-Level : 23.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 9 (Deleted: 0) Binary : 4 (Ratio: 44.44%) Ternary : 1 (Ratio: 11.11%) Conflict : 9 (Average Length: 4.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 9 (Average: 2.11 Max: 4 Sum: 19) Executed : 9 (Average: 2.11 Max: 4 Sum: 19 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 3267 Atoms : 3267 Bodies : 1 (Original: 0) Tight : Yes Variables : 2434 (Eliminated: 0 Frozen: 363) Constraints : 8675 (Binary: 91.5% Ternary: 5.3% Other: 3.2%) Memory Peak : 55MB Max. Length : 10 steps Sol. Length : 10 steps Models : 1