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-4.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-4.pddl Parsing... Parsing: [0.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.025s wall-clock] Preparing model... [0.010s CPU, 0.012s wall-clock] Generated 43 rules. Computing model... [0.040s CPU, 0.037s wall-clock] 165 relevant atoms 239 auxiliary atoms 404 final queue length 516 total queue pushes Completing instantiation... [0.020s CPU, 0.026s wall-clock] Instantiating: [0.100s CPU, 0.106s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.040s CPU, 0.036s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 17 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.041s 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.001s wall-clock] Translating task: [0.030s CPU, 0.024s wall-clock] 77 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 15 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.013s wall-clock] Reordering and filtering variables... 12 of 14 variables necessary. 1 of 4 mutex groups necessary. 58 of 58 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock] Translator variables: 12 Translator derived variables: 0 Translator facts: 39 Translator goal facts: 2 Translator mutex groups: 1 Translator total mutex groups size: 3 Translator operators: 58 Translator axioms: 0 Translator task size: 475 Translator peak memory: 36300 KB Writing output... [0.010s CPU, 0.011s wall-clock] Done! [0.220s CPU, 0.228s wall-clock] planner.py version 0.0.1 Time: 0.03s Memory: 50MB 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: 50MB (+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: 50MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+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: 52.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.02s Memory: 52MB (+0MB) Answer: 1 occurs(action(("move","hoist0","depot0-1-1","depot0-2-1")),1) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),2) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),3) occurs(action(("go-in","hoist0","loadarea","depot0-2-1")),3) occurs(action(("drop","hoist0","crate1","depot0-1-1","depot0-2-1","depot0")),4) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),4) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),5) occurs(action(("drop","hoist0","crate0","depot0-2-1","loadarea","depot0")),6) occurs(action(("go-in","hoist0","loadarea","container-0-1")),7) occurs(action(("go-out","hoist0","container-0-1","loadarea")),8) occurs(action(("go-in","hoist0","loadarea","container-0-0")),9) occurs(action(("go-out","hoist0","container-0-0","loadarea")),10) SATISFIABLE Models : 1+ Calls : 3 Time : 0.070s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.068s Choices : 40 (Domain: 33) Conflicts : 15 (Analyzed: 14) Restarts : 0 Model-Level : 34.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 14 (Deleted: 0) Binary : 7 (Ratio: 50.00%) Ternary : 1 (Ratio: 7.14%) Conflict : 14 (Average Length: 19.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 14 (Average: 1.36 Max: 4 Sum: 19) Executed : 13 (Average: 1.29 Max: 4 Sum: 18 Ratio: 94.74%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 5.26%) Rules : 1487 Atoms : 1487 Bodies : 1 (Original: 0) Tight : Yes Variables : 1346 (Eliminated: 0 Frozen: 192) Constraints : 5463 (Binary: 89.3% Ternary: 6.7% Other: 4.0%) Memory Peak : 52MB Max. Length : 10 steps Sol. Length : 10 steps Models : 1