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-28.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-28.pddl Parsing... Parsing: [0.010s CPU, 0.015s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock] Preparing model... [0.000s CPU, 0.007s wall-clock] Generated 21 rules. Computing model... [0.090s CPU, 0.088s wall-clock] 613 relevant atoms 403 auxiliary atoms 1016 final queue length 1720 total queue pushes Completing instantiation... [0.110s CPU, 0.113s wall-clock] Instantiating: [0.220s CPU, 0.223s 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.002s wall-clock] Instantiating groups... [0.010s CPU, 0.006s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 14 uncovered facts Choosing groups: [0.010s CPU, 0.008s wall-clock] Building translation key... [0.010s CPU, 0.002s wall-clock] Computing fact groups: [0.060s CPU, 0.050s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.004s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.006s wall-clock] Translating task: [0.120s CPU, 0.121s wall-clock] 494 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 26 propositions removed Detecting unreachable propositions: [0.070s CPU, 0.067s wall-clock] Reordering and filtering variables... 27 of 27 variables necessary. 14 of 27 mutex groups necessary. 338 of 338 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.040s CPU, 0.038s wall-clock] Translator variables: 27 Translator derived variables: 0 Translator facts: 210 Translator goal facts: 12 Translator mutex groups: 14 Translator total mutex groups size: 196 Translator operators: 338 Translator axioms: 0 Translator task size: 2941 Translator peak memory: 34648 KB Writing output... [0.050s CPU, 0.050s wall-clock] Done! [0.580s CPU, 0.580s wall-clock] planner.py version 0.0.1 Time: 0.12s Memory: 51MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.06s Memory: 54MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 56MB (+2MB) UNSAT Iteration Time: 0.08s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.02s Memory: 56MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 56MB (+0MB) UNSAT Iteration Time: 0.03s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.02s Memory: 56MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 56MB (+0MB) UNSAT Iteration Time: 0.03s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.05s Memory: 59MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+1MB) UNSAT Iteration Time: 0.07s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.06s Memory: 63MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 65MB (+2MB) UNSAT Iteration Time: 0.08s 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.09s Memory: 70MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 72MB (+2MB) UNSAT Iteration Time: 0.12s 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.15s Memory: 82MB (+10MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 85MB (+3MB) UNSAT Iteration Time: 0.23s 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.19s Memory: 94MB (+9MB) Unblocking actions... Solving... Solving Time: 1.50s Memory: 99MB (+5MB) UNSAT Iteration Time: 1.75s 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.36s Memory: 121MB (+22MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","j","e")),1) occurs(action(("put-down","j")),2) occurs(action(("unstack","e","d")),3) occurs(action(("put-down","e")),4) occurs(action(("unstack","d","c")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","c","a")),7) occurs(action(("stack","c","j")),8) occurs(action(("unstack","a","l")),9) occurs(action(("stack","a","e")),10) occurs(action(("unstack","l","h")),11) occurs(action(("put-down","l")),12) occurs(action(("unstack","h","g")),13) occurs(action(("stack","h","b")),14) occurs(action(("unstack","g","m")),15) occurs(action(("put-down","g")),16) occurs(action(("unstack","m","i")),17) occurs(action(("stack","m","d")),18) occurs(action(("unstack","i","f")),19) occurs(action(("stack","i","f")),20) occurs(action(("unstack","i","f")),21) occurs(action(("put-down","i")),22) occurs(action(("pick-up","f")),23) occurs(action(("stack","f","l")),24) occurs(action(("unstack","c","j")),25) occurs(action(("stack","c","m")),26) occurs(action(("pick-up","j")),27) occurs(action(("stack","j","f")),28) occurs(action(("unstack","a","e")),29) occurs(action(("stack","a","j")),30) occurs(action(("pick-up","g")),31) occurs(action(("stack","g","a")),32) occurs(action(("unstack","h","b")),33) occurs(action(("stack","h","g")),34) occurs(action(("unstack","b","k")),35) occurs(action(("put-down","b")),36) occurs(action(("pick-up","i")),37) occurs(action(("stack","i","h")),38) occurs(action(("unstack","i","h")),39) occurs(action(("stack","i","b")),40) occurs(action(("unstack","c","m")),41) occurs(action(("stack","c","e")),42) occurs(action(("unstack","h","g")),43) occurs(action(("stack","h","i")),44) occurs(action(("unstack","g","a")),45) occurs(action(("stack","g","h")),46) occurs(action(("pick-up","k")),47) occurs(action(("stack","k","c")),48) occurs(action(("unstack","a","j")),49) occurs(action(("stack","a","j")),50) occurs(action(("unstack","m","d")),51) occurs(action(("put-down","m")),52) occurs(action(("unstack","a","j")),53) occurs(action(("stack","a","d")),54) occurs(action(("unstack","j","f")),55) occurs(action(("stack","j","m")),56) occurs(action(("unstack","k","c")),57) occurs(action(("stack","k","g")),58) occurs(action(("unstack","f","l")),59) occurs(action(("stack","f","k")),60) occurs(action(("unstack","j","m")),61) occurs(action(("stack","j","f")),62) occurs(action(("unstack","c","e")),63) occurs(action(("stack","c","j")),64) occurs(action(("unstack","a","d")),65) occurs(action(("stack","a","d")),66) occurs(action(("pick-up","m")),67) occurs(action(("stack","m","c")),68) occurs(action(("unstack","m","c")),69) occurs(action(("stack","m","c")),70) occurs(action(("pick-up","l")),71) occurs(action(("stack","l","m")),72) occurs(action(("pick-up","e")),73) occurs(action(("stack","e","l")),74) occurs(action(("unstack","a","d")),75) occurs(action(("stack","a","e")),76) occurs(action(("pick-up","d")),77) occurs(action(("stack","d","a")),78) Solving Time: 0.09s Memory: 128MB (+7MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 3.049s (Solving: 1.59s 1st Model: 0.07s Unsat: 1.52s) CPU Time : 3.040s Choices : 12469 Conflicts : 5853 (Analyzed: 5848) Restarts : 60 (Average: 97.47 Last: 97) Model-Level : 135.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 5848 (Deleted: 2263) Binary : 392 (Ratio: 6.70%) Ternary : 198 (Ratio: 3.39%) Conflict : 5848 (Average Length: 394.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 5848 (Average: 2.71 Max: 197 Sum: 15877) Executed : 5754 (Average: 2.08 Max: 197 Sum: 12176 Ratio: 76.69%) Bounded : 94 (Average: 39.37 Max: 80 Sum: 3701 Ratio: 23.31%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 53926 (Eliminated: 0 Frozen: 41514) Constraints : 341707 (Binary: 93.2% Ternary: 4.1% Other: 2.8%) Memory Peak : 129MB Max. Length : 78 steps Sol. Length : 78 steps