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-19.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-19.pddl Parsing... Parsing: [0.010s CPU, 0.013s 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.010s wall-clock] Preparing model... [0.010s CPU, 0.005s wall-clock] Generated 21 rules. Computing model... [0.050s CPU, 0.053s wall-clock] 382 relevant atoms 250 auxiliary atoms 632 final queue length 1054 total queue pushes Completing instantiation... [0.070s CPU, 0.072s wall-clock] Instantiating: [0.140s CPU, 0.145s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.003s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 11 uncovered facts Choosing groups: [0.010s CPU, 0.004s wall-clock] Building translation key... [0.000s CPU, 0.002s wall-clock] Computing fact groups: [0.040s CPU, 0.038s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.002s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.003s wall-clock] Translating task: [0.080s CPU, 0.069s wall-clock] 290 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 20 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.039s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 11 of 21 mutex groups necessary. 200 of 200 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.030s CPU, 0.022s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 132 Translator goal facts: 9 Translator mutex groups: 11 Translator total mutex groups size: 121 Translator operators: 200 Translator axioms: 0 Translator task size: 1753 Translator peak memory: 33880 KB Writing output... [0.030s CPU, 0.030s wall-clock] Done! [0.360s CPU, 0.366s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 49MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.04s Memory: 51MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.05s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.02s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.02s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.04s Memory: 54MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+0MB) UNSAT Iteration Time: 0.05s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.03s Memory: 56MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 57MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 6 Queue: [27] Grounded Until: 19 Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])] Grounding Time: 0.05s Memory: 60MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 61MB (+1MB) UNSAT Iteration Time: 0.08s Iteration 7 Queue: [39] Grounded Until: 27 Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])] Grounding Time: 0.08s Memory: 67MB (+6MB) Unblocking actions... Solving... Solving Time: 0.30s Memory: 69MB (+2MB) UNSAT Iteration Time: 0.41s Iteration 8 Queue: [55] Grounded Until: 39 Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.13s Memory: 77MB (+8MB) Unblocking actions... Solving... Solving Time: 0.26s Memory: 80MB (+3MB) UNSAT Iteration Time: 0.42s Iteration 9 Queue: [78] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('check', [78])] Grounding Time: 0.20s Memory: 92MB (+12MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","c","e")),1) occurs(action(("stack","c","f")),2) occurs(action(("unstack","e","j")),3) occurs(action(("put-down","e")),4) occurs(action(("unstack","j","b")),5) occurs(action(("stack","j","e")),6) occurs(action(("unstack","b","g")),7) occurs(action(("put-down","b")),8) occurs(action(("unstack","g","h")),9) occurs(action(("stack","g","j")),10) occurs(action(("unstack","h","a")),11) occurs(action(("put-down","h")),12) occurs(action(("unstack","a","d")),13) occurs(action(("stack","a","b")),14) occurs(action(("unstack","d","i")),15) occurs(action(("put-down","d")),16) occurs(action(("pick-up","i")),17) occurs(action(("stack","i","a")),18) occurs(action(("unstack","g","j")),19) occurs(action(("stack","g","i")),20) occurs(action(("unstack","c","f")),21) occurs(action(("stack","c","g")),22) occurs(action(("pick-up","f")),23) occurs(action(("stack","f","c")),24) occurs(action(("pick-up","h")),25) occurs(action(("stack","h","f")),26) occurs(action(("unstack","j","e")),27) occurs(action(("stack","j","e")),28) occurs(action(("unstack","h","f")),29) occurs(action(("stack","h","f")),30) occurs(action(("unstack","j","e")),31) occurs(action(("stack","j","e")),32) occurs(action(("unstack","h","f")),33) occurs(action(("stack","h","j")),34) occurs(action(("pick-up","d")),35) occurs(action(("put-down","d")),36) occurs(action(("unstack","f","c")),37) occurs(action(("put-down","f")),38) occurs(action(("unstack","c","g")),39) occurs(action(("put-down","c")),40) occurs(action(("unstack","h","j")),41) occurs(action(("stack","h","g")),42) occurs(action(("unstack","j","e")),43) occurs(action(("stack","j","h")),44) occurs(action(("pick-up","e")),45) occurs(action(("stack","e","f")),46) occurs(action(("unstack","j","h")),47) occurs(action(("stack","j","c")),48) occurs(action(("unstack","h","g")),49) occurs(action(("stack","h","j")),50) occurs(action(("unstack","g","i")),51) occurs(action(("stack","g","h")),52) occurs(action(("unstack","i","a")),53) occurs(action(("stack","i","a")),54) occurs(action(("unstack","e","f")),55) occurs(action(("stack","e","d")),56) occurs(action(("unstack","g","h")),57) occurs(action(("stack","g","f")),58) occurs(action(("unstack","i","a")),59) occurs(action(("put-down","i")),60) occurs(action(("unstack","g","f")),61) occurs(action(("stack","g","i")),62) occurs(action(("unstack","a","b")),63) occurs(action(("stack","a","g")),64) occurs(action(("pick-up","b")),65) occurs(action(("stack","b","a")),66) occurs(action(("unstack","h","j")),67) occurs(action(("stack","h","b")),68) occurs(action(("unstack","e","d")),69) occurs(action(("stack","e","h")),70) occurs(action(("unstack","j","c")),71) occurs(action(("stack","j","e")),72) occurs(action(("pick-up","f")),73) occurs(action(("stack","f","j")),74) occurs(action(("pick-up","c")),75) occurs(action(("stack","c","f")),76) occurs(action(("pick-up","d")),77) occurs(action(("stack","d","c")),78) Solving Time: 0.08s Memory: 96MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 1.512s (Solving: 0.63s 1st Model: 0.07s Unsat: 0.55s) CPU Time : 1.510s Choices : 8248 Conflicts : 4178 (Analyzed: 4172) Restarts : 47 (Average: 88.77 Last: 37) Model-Level : 120.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 4172 (Deleted: 0) Binary : 336 (Ratio: 8.05%) Ternary : 180 (Ratio: 4.31%) Conflict : 4172 (Average Length: 216.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 4172 (Average: 2.53 Max: 102 Sum: 10551) Executed : 4087 (Average: 1.93 Max: 102 Sum: 8066 Ratio: 76.45%) Bounded : 85 (Average: 29.24 Max: 57 Sum: 2485 Ratio: 23.55%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 32937 (Eliminated: 0 Frozen: 25863) Constraints : 209984 (Binary: 92.2% Ternary: 4.3% Other: 3.6%) Memory Peak : 97MB Max. Length : 78 steps Sol. Length : 78 steps