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-16.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-16.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.020s CPU, 0.011s wall-clock] Preparing model... [0.000s CPU, 0.005s wall-clock] Generated 21 rules. Computing model... [0.050s CPU, 0.047s wall-clock] 317 relevant atoms 207 auxiliary atoms 524 final queue length 868 total queue pushes Completing instantiation... [0.060s CPU, 0.061s wall-clock] Instantiating: [0.130s CPU, 0.127s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.024s 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... 10 uncovered facts Choosing groups: [0.000s CPU, 0.004s 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.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.002s 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.056s wall-clock] 234 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 18 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.032s wall-clock] Reordering and filtering variables... 19 of 19 variables necessary. 10 of 19 mutex groups necessary. 162 of 162 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.018s wall-clock] Translator variables: 19 Translator derived variables: 0 Translator facts: 110 Translator goal facts: 8 Translator mutex groups: 10 Translator total mutex groups size: 100 Translator operators: 162 Translator axioms: 0 Translator task size: 1425 Translator peak memory: 33624 KB Writing output... [0.030s CPU, 0.025s wall-clock] Done! [0.320s CPU, 0.323s wall-clock] planner.py version 0.0.1 Time: 0.07s Memory: 48MB 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: 50MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+0MB) UNSAT Iteration Time: 0.04s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.02s Memory: 50MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+1MB) UNSAT Iteration Time: 0.02s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.01s 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.03s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.04s 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: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 55MB (+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: 58MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 59MB (+1MB) UNSAT Iteration Time: 0.07s 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: 64MB (+5MB) Unblocking actions... Solving... Solving Time: 0.33s Memory: 66MB (+2MB) UNSAT Iteration Time: 0.42s 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.10s Memory: 72MB (+6MB) Unblocking actions... Solving... Solving Time: 0.13s Memory: 75MB (+3MB) UNSAT Iteration Time: 0.26s 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.17s Memory: 85MB (+10MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","f","g")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","g","e")),3) occurs(action(("put-down","g")),4) occurs(action(("unstack","e","a")),5) occurs(action(("stack","e","c")),6) occurs(action(("unstack","a","i")),7) occurs(action(("put-down","a")),8) occurs(action(("unstack","i","d")),9) occurs(action(("put-down","i")),10) occurs(action(("pick-up","a")),11) occurs(action(("stack","a","f")),12) occurs(action(("unstack","d","h")),13) occurs(action(("stack","d","a")),14) occurs(action(("unstack","h","b")),15) occurs(action(("put-down","h")),16) occurs(action(("unstack","d","a")),17) occurs(action(("stack","d","b")),18) occurs(action(("unstack","e","c")),19) occurs(action(("stack","e","a")),20) occurs(action(("pick-up","g")),21) occurs(action(("stack","g","e")),22) occurs(action(("pick-up","c")),23) occurs(action(("stack","c","h")),24) occurs(action(("unstack","c","h")),25) occurs(action(("stack","c","d")),26) occurs(action(("pick-up","i")),27) occurs(action(("put-down","i")),28) occurs(action(("unstack","g","e")),29) occurs(action(("stack","g","c")),30) occurs(action(("pick-up","i")),31) occurs(action(("stack","i","h")),32) occurs(action(("unstack","e","a")),33) occurs(action(("stack","e","a")),34) occurs(action(("unstack","e","a")),35) occurs(action(("stack","e","i")),36) occurs(action(("unstack","g","c")),37) occurs(action(("stack","g","e")),38) occurs(action(("unstack","g","e")),39) occurs(action(("put-down","g")),40) occurs(action(("unstack","c","d")),41) occurs(action(("stack","c","g")),42) occurs(action(("unstack","a","f")),43) occurs(action(("stack","a","c")),44) occurs(action(("unstack","e","i")),45) occurs(action(("stack","e","a")),46) occurs(action(("unstack","i","h")),47) occurs(action(("stack","i","h")),48) occurs(action(("unstack","i","h")),49) occurs(action(("stack","i","d")),50) occurs(action(("unstack","e","a")),51) occurs(action(("stack","e","h")),52) occurs(action(("pick-up","f")),53) occurs(action(("stack","f","e")),54) occurs(action(("unstack","i","d")),55) occurs(action(("stack","i","f")),56) occurs(action(("unstack","d","b")),57) occurs(action(("put-down","d")),58) occurs(action(("pick-up","d")),59) occurs(action(("put-down","d")),60) occurs(action(("unstack","a","c")),61) occurs(action(("stack","a","i")),62) occurs(action(("pick-up","d")),63) occurs(action(("stack","d","c")),64) occurs(action(("unstack","d","c")),65) occurs(action(("put-down","d")),66) occurs(action(("unstack","c","g")),67) occurs(action(("stack","c","b")),68) occurs(action(("unstack","c","b")),69) occurs(action(("stack","c","b")),70) occurs(action(("unstack","c","b")),71) occurs(action(("stack","c","a")),72) occurs(action(("pick-up","b")),73) occurs(action(("stack","b","c")),74) occurs(action(("pick-up","d")),75) occurs(action(("stack","d","b")),76) occurs(action(("pick-up","g")),77) occurs(action(("stack","g","d")),78) Solving Time: 0.04s Memory: 89MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 1.225s (Solving: 0.48s 1st Model: 0.03s Unsat: 0.45s) CPU Time : 1.220s Choices : 7401 Conflicts : 3892 (Analyzed: 3886) Restarts : 43 (Average: 90.37 Last: 85) Model-Level : 138.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 3886 (Deleted: 911) Binary : 234 (Ratio: 6.02%) Ternary : 128 (Ratio: 3.29%) Conflict : 3886 (Average Length: 273.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 3886 (Average: 2.16 Max: 139 Sum: 8375) Executed : 3841 (Average: 1.87 Max: 139 Sum: 7268 Ratio: 86.78%) Bounded : 45 (Average: 24.60 Max: 46 Sum: 1107 Ratio: 13.22%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 27705 (Eliminated: 0 Frozen: 21344) Constraints : 176771 (Binary: 91.7% Ternary: 4.4% Other: 3.9%) Memory Peak : 90MB Max. Length : 78 steps Sol. Length : 78 steps