INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-23.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-23.pddl Parsing... Parsing: [0.010s CPU, 0.012s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.002s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock] Preparing model... [0.010s CPU, 0.005s wall-clock] Generated 21 rules. Computing model... [0.060s CPU, 0.061s wall-clock] 453 relevant atoms 297 auxiliary atoms 750 final queue length 1260 total queue pushes Completing instantiation... [0.080s CPU, 0.087s wall-clock] Instantiating: [0.160s CPU, 0.169s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.030s CPU, 0.021s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.000s CPU, 0.005s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 12 uncovered facts Choosing groups: [0.010s CPU, 0.006s wall-clock] Building translation key... [0.000s CPU, 0.002s wall-clock] Computing fact groups: [0.050s CPU, 0.046s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s 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.000s CPU, 0.004s wall-clock] Translating task: [0.090s CPU, 0.094s wall-clock] 352 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 22 propositions removed Detecting unreachable propositions: [0.060s CPU, 0.053s wall-clock] Reordering and filtering variables... 23 of 23 variables necessary. 12 of 23 mutex groups necessary. 242 of 242 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.030s CPU, 0.030s wall-clock] Translator variables: 23 Translator derived variables: 0 Translator facts: 156 Translator goal facts: 10 Translator mutex groups: 12 Translator total mutex groups size: 144 Translator operators: 242 Translator axioms: 0 Translator task size: 2115 Translator peak memory: 37324 KB Writing output... [0.040s CPU, 0.040s wall-clock] Done! [0.450s CPU, 0.459s wall-clock] planner.py version 0.0.1 Time: 0.07s Memory: 53MB 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: 53MB (+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.03s Memory: 55MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 55MB (+0MB) UNSAT Iteration Time: 0.04s 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.03s Memory: 57MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 58MB (+1MB) UNSAT Iteration Time: 0.04s 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.03s Memory: 59MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.03s Memory: 62MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 62MB (+0MB) UNSAT Iteration Time: 0.04s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.04s Memory: 65MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 66MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.03s Memory: 67MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 68MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.06s Memory: 69MB (+1MB) Answer: 1 occurs(action(("unstack","f","e")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","e","k")),3) occurs(action(("put-down","e")),4) occurs(action(("unstack","j","i")),5) occurs(action(("put-down","j")),6) occurs(action(("pick-up","i")),7) occurs(action(("stack","i","e")),8) occurs(action(("unstack","g","b")),9) occurs(action(("stack","g","i")),10) occurs(action(("pick-up","f")),11) occurs(action(("stack","f","g")),12) occurs(action(("unstack","d","c")),13) occurs(action(("put-down","d")),14) occurs(action(("unstack","c","h")),15) occurs(action(("stack","c","f")),16) occurs(action(("unstack","b","a")),17) occurs(action(("put-down","b")),18) occurs(action(("pick-up","a")),19) occurs(action(("stack","a","c")),20) occurs(action(("pick-up","h")),21) occurs(action(("stack","h","a")),22) occurs(action(("pick-up","k")),23) occurs(action(("stack","k","h")),24) occurs(action(("pick-up","j")),25) occurs(action(("stack","j","k")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","j")),28) occurs(action(("pick-up","b")),29) occurs(action(("stack","b","d")),30) SATISFIABLE Models : 1+ Calls : 7 Time : 0.356s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.01s) CPU Time : 0.352s Choices : 359 (Domain: 359) Conflicts : 45 (Analyzed: 40) Restarts : 0 Model-Level : 127.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 40 (Deleted: 0) Binary : 25 (Ratio: 62.50%) Ternary : 0 (Ratio: 0.00%) Conflict : 40 (Average Length: 31.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 40 (Average: 7.17 Max: 35 Sum: 287) Executed : 33 (Average: 6.60 Max: 35 Sum: 264 Ratio: 91.99%) Bounded : 7 (Average: 3.29 Max: 17 Sum: 23 Ratio: 8.01%) Rules : 6521 Atoms : 6521 Bodies : 1 (Original: 0) Tight : Yes Variables : 13464 (Eliminated: 0 Frozen: 4275) Constraints : 84901 (Binary: 92.7% Ternary: 5.0% Other: 2.3%) Memory Peak : 69MB Max. Length : 30 steps Sol. Length : 30 steps Models : 1