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-36.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-36.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.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.010s CPU, 0.006s wall-clock] Generated 21 rules. Computing model... [0.110s CPU, 0.109s wall-clock] 1005 relevant atoms 663 auxiliary atoms 1668 final queue length 2861 total queue pushes Completing instantiation... [0.180s CPU, 0.175s wall-clock] Instantiating: [0.310s CPU, 0.305s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.017s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.010s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 18 uncovered facts Choosing groups: [0.020s CPU, 0.011s wall-clock] Building translation key... [0.000s CPU, 0.004s wall-clock] Computing fact groups: [0.060s CPU, 0.069s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.020s CPU, 0.006s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.006s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.010s wall-clock] Translating task: [0.200s CPU, 0.202s wall-clock] 850 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 34 propositions removed Detecting unreachable propositions: [0.110s CPU, 0.110s wall-clock] Reordering and filtering variables... 35 of 35 variables necessary. 18 of 35 mutex groups necessary. 578 of 578 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.070s CPU, 0.064s wall-clock] Translator variables: 35 Translator derived variables: 0 Translator facts: 342 Translator goal facts: 16 Translator mutex groups: 18 Translator total mutex groups size: 324 Translator operators: 578 Translator axioms: 0 Translator task size: 5001 Translator peak memory: 35928 KB Writing output... [0.080s CPU, 0.085s wall-clock] Done! [0.870s CPU, 0.875s wall-clock] planner.py version 0.0.1 Time: 0.19s Memory: 55MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.08s Memory: 59MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 63MB (+4MB) UNSAT Iteration Time: 0.12s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.04s Memory: 64MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 65MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.04s Memory: 65MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 65MB (+0MB) UNSAT Iteration Time: 0.05s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.09s Memory: 68MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 70MB (+2MB) UNSAT Iteration Time: 0.12s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.11s Memory: 75MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 78MB (+3MB) UNSAT Iteration Time: 0.14s 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.15s Memory: 87MB (+9MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 91MB (+4MB) UNSAT Iteration Time: 0.21s 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.24s Memory: 104MB (+13MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 109MB (+5MB) UNSAT Iteration Time: 0.36s 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.35s Memory: 128MB (+19MB) Unblocking actions... Solving... Solving Time: 0.59s Memory: 135MB (+7MB) UNSAT Iteration Time: 1.05s 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.57s Memory: 162MB (+27MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","k","c")),1) occurs(action(("stack","k","l")),2) occurs(action(("unstack","c","m")),3) occurs(action(("put-down","c")),4) occurs(action(("unstack","m","i")),5) occurs(action(("stack","m","c")),6) occurs(action(("unstack","i","e")),7) occurs(action(("put-down","i")),8) occurs(action(("unstack","e","g")),9) occurs(action(("stack","e","k")),10) occurs(action(("unstack","g","q")),11) occurs(action(("put-down","g")),12) occurs(action(("unstack","q","b")),13) occurs(action(("stack","q","b")),14) occurs(action(("unstack","n","f")),15) occurs(action(("put-down","n")),16) occurs(action(("unstack","e","k")),17) occurs(action(("stack","e","i")),18) occurs(action(("unstack","q","b")),19) occurs(action(("stack","q","e")),20) occurs(action(("unstack","b","p")),21) occurs(action(("stack","b","p")),22) occurs(action(("unstack","k","l")),23) occurs(action(("put-down","k")),24) occurs(action(("unstack","l","d")),25) occurs(action(("stack","l","f")),26) occurs(action(("unstack","d","a")),27) occurs(action(("put-down","d")),28) occurs(action(("unstack","b","p")),29) occurs(action(("stack","b","a")),30) occurs(action(("unstack","m","c")),31) occurs(action(("stack","m","n")),32) occurs(action(("unstack","q","e")),33) occurs(action(("put-down","q")),34) occurs(action(("pick-up","c")),35) occurs(action(("stack","c","q")),36) occurs(action(("unstack","p","h")),37) occurs(action(("put-down","p")),38) occurs(action(("unstack","m","n")),39) occurs(action(("stack","m","d")),40) occurs(action(("unstack","b","a")),41) occurs(action(("stack","b","n")),42) occurs(action(("unstack","l","f")),43) occurs(action(("stack","l","p")),44) occurs(action(("unstack","h","j")),45) occurs(action(("stack","h","l")),46) occurs(action(("unstack","j","o")),47) occurs(action(("stack","j","f")),48) occurs(action(("pick-up","o")),49) occurs(action(("stack","o","m")),50) occurs(action(("unstack","e","i")),51) occurs(action(("stack","e","o")),52) occurs(action(("unstack","h","l")),53) occurs(action(("stack","h","e")),54) occurs(action(("pick-up","a")),55) occurs(action(("stack","a","h")),56) occurs(action(("pick-up","g")),57) occurs(action(("stack","g","a")),58) occurs(action(("unstack","b","n")),59) occurs(action(("stack","b","g")),60) occurs(action(("unstack","j","f")),61) occurs(action(("stack","j","b")),62) occurs(action(("pick-up","f")),63) occurs(action(("stack","f","j")),64) occurs(action(("pick-up","k")),65) occurs(action(("stack","k","f")),66) occurs(action(("pick-up","i")),67) occurs(action(("stack","i","k")),68) occurs(action(("unstack","c","q")),69) occurs(action(("stack","c","i")),70) occurs(action(("pick-up","n")),71) occurs(action(("stack","n","c")),72) occurs(action(("unstack","l","p")),73) occurs(action(("stack","l","n")),74) occurs(action(("pick-up","q")),75) occurs(action(("stack","q","l")),76) occurs(action(("pick-up","p")),77) occurs(action(("stack","p","q")),78) Solving Time: 1.23s Memory: 175MB (+13MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.292s (Solving: 1.83s 1st Model: 1.20s Unsat: 0.62s) CPU Time : 4.280s Choices : 125759 Conflicts : 3996 (Analyzed: 3991) Restarts : 40 (Average: 99.78 Last: 72) Model-Level : 1364.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 3991 (Deleted: 1397) Binary : 281 (Ratio: 7.04%) Ternary : 136 (Ratio: 3.41%) Conflict : 3991 (Average Length: 352.5 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 3991 (Average: 29.29 Max: 1703 Sum: 116878) Executed : 3932 (Average: 28.70 Max: 1703 Sum: 114528 Ratio: 97.99%) Bounded : 59 (Average: 39.83 Max: 80 Sum: 2350 Ratio: 2.01%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 87038 (Eliminated: 0 Frozen: 69253) Constraints : 583741 (Binary: 94.0% Ternary: 3.9% Other: 2.1%) Memory Peak : 175MB Max. Length : 78 steps Sol. Length : 78 steps