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.014s wall-clock] Normalizing task... [0.010s 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.011s wall-clock] Preparing model... [0.010s CPU, 0.008s wall-clock] Generated 21 rules. Computing model... [0.120s CPU, 0.124s 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.320s CPU, 0.323s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.010s CPU, 0.017s wall-clock] Checking invariant weight... [0.010s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.010s wall-clock] Collecting mutex groups... [0.010s CPU, 0.002s wall-clock] Choosing groups... 18 uncovered facts Choosing groups: [0.000s CPU, 0.011s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.070s CPU, 0.070s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.007s 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.201s 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.060s 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.070s CPU, 0.097s wall-clock] Done! [0.880s CPU, 0.907s wall-clock] planner.py version 0.0.1 Time: 0.18s Memory: 55MB Iteration 1 Queue: [0] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 55MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.09s Memory: 58MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+2MB) UNSAT Iteration Time: 0.11s Iteration 3 Queue: [10] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.09s Memory: 64MB (+4MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 65MB (+1MB) UNSAT Iteration Time: 0.12s Iteration 4 Queue: [15] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.09s Memory: 69MB (+4MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 71MB (+2MB) UNSAT Iteration Time: 0.13s Iteration 5 Queue: [20] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.11s Memory: 75MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 78MB (+3MB) UNSAT Iteration Time: 0.14s Iteration 6 Queue: [25] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.10s Memory: 81MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 84MB (+3MB) UNSAT Iteration Time: 0.13s Iteration 7 Queue: [30] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.10s Memory: 87MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 89MB (+2MB) UNSAT Iteration Time: 0.14s Iteration 8 Queue: [35] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.10s Memory: 92MB (+3MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 97MB (+5MB) UNSAT Iteration Time: 0.16s Iteration 9 Queue: [40] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.10s Memory: 99MB (+2MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 101MB (+2MB) UNSAT Iteration Time: 0.19s Iteration 10 Queue: [45] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.13s Memory: 107MB (+6MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 110MB (+3MB) UNSAT Iteration Time: 0.24s Iteration 11 Queue: [50] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 0.10s Memory: 113MB (+3MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 115MB (+2MB) UNSAT Iteration Time: 0.22s Iteration 12 Queue: [55] Grounded Until: 50 Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.10s Memory: 118MB (+3MB) Unblocking actions... Solving... Solving Time: 0.30s Memory: 123MB (+5MB) UNSAT Iteration Time: 0.45s Iteration 13 Queue: [60] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])] Grounding Time: 0.10s Memory: 126MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","k","c")),1) occurs(action(("put-down","k")),2) occurs(action(("unstack","c","m")),3) occurs(action(("put-down","c")),4) occurs(action(("unstack","m","i")),5) occurs(action(("stack","m","k")),6) occurs(action(("unstack","i","e")),7) occurs(action(("stack","i","c")),8) occurs(action(("unstack","e","g")),9) occurs(action(("put-down","e")),10) occurs(action(("unstack","g","q")),11) occurs(action(("stack","g","i")),12) occurs(action(("unstack","q","b")),13) occurs(action(("put-down","q")),14) occurs(action(("unstack","b","p")),15) occurs(action(("stack","b","q")),16) occurs(action(("unstack","p","h")),17) occurs(action(("put-down","p")),18) occurs(action(("unstack","n","f")),19) occurs(action(("stack","n","p")),20) occurs(action(("unstack","h","j")),21) occurs(action(("stack","h","b")),22) occurs(action(("unstack","l","d")),23) occurs(action(("put-down","l")),24) occurs(action(("unstack","d","a")),25) occurs(action(("put-down","d")),26) occurs(action(("unstack","m","k")),27) occurs(action(("stack","m","d")),28) occurs(action(("unstack","j","o")),29) occurs(action(("stack","j","f")),30) occurs(action(("pick-up","o")),31) occurs(action(("stack","o","m")),32) occurs(action(("pick-up","e")),33) occurs(action(("stack","e","o")),34) occurs(action(("unstack","h","b")),35) occurs(action(("stack","h","e")),36) occurs(action(("pick-up","a")),37) occurs(action(("stack","a","h")),38) occurs(action(("unstack","g","i")),39) occurs(action(("stack","g","a")),40) occurs(action(("unstack","b","q")),41) occurs(action(("stack","b","g")),42) occurs(action(("unstack","j","f")),43) occurs(action(("stack","j","b")),44) occurs(action(("pick-up","f")),45) occurs(action(("stack","f","j")),46) occurs(action(("pick-up","k")),47) occurs(action(("stack","k","f")),48) occurs(action(("unstack","i","c")),49) occurs(action(("stack","i","k")),50) occurs(action(("pick-up","c")),51) occurs(action(("stack","c","i")),52) occurs(action(("unstack","n","p")),53) occurs(action(("stack","n","c")),54) occurs(action(("pick-up","l")),55) occurs(action(("stack","l","n")),56) occurs(action(("pick-up","q")),57) occurs(action(("stack","q","l")),58) occurs(action(("pick-up","p")),59) occurs(action(("stack","p","q")),60) Solving Time: 0.20s Memory: 128MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 13 Time : 2.579s (Solving: 0.64s 1st Model: 0.18s Unsat: 0.46s) CPU Time : 2.540s Choices : 42121 Conflicts : 1395 (Analyzed: 1386) Restarts : 13 (Average: 106.62 Last: 51) Model-Level : 378.0 Problems : 13 (Average Length: 32.00 Splits: 0) Lemmas : 1386 (Deleted: 0) Binary : 217 (Ratio: 15.66%) Ternary : 39 (Ratio: 2.81%) Conflict : 1386 (Average Length: 186.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1386 (Average: 31.40 Max: 1021 Sum: 43524) Executed : 1288 (Average: 29.52 Max: 1021 Sum: 40921 Ratio: 94.02%) Bounded : 98 (Average: 26.56 Max: 62 Sum: 2603 Ratio: 5.98%) Rules : 16798 Atoms : 16798 Bodies : 1 (Original: 0) Tight : Yes Variables : 63522 (Eliminated: 0 Frozen: 53965) Constraints : 421347 (Binary: 94.0% Ternary: 3.9% Other: 2.2%) Memory Peak : 135MB Max. Length : 60 steps Sol. Length : 60 steps