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-34.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-34.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.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 21 rules. Computing model... [0.150s CPU, 0.149s wall-clock] 898 relevant atoms 592 auxiliary atoms 1490 final queue length 2548 total queue pushes Completing instantiation... [0.180s CPU, 0.175s wall-clock] Instantiating: [0.360s CPU, 0.355s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.021s 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.003s wall-clock] Choosing groups... 17 uncovered facts Choosing groups: [0.010s CPU, 0.012s wall-clock] Building translation key... [0.000s CPU, 0.004s wall-clock] Computing fact groups: [0.070s CPU, 0.075s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.004s 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.020s CPU, 0.009s wall-clock] Translating task: [0.210s CPU, 0.202s wall-clock] 752 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 32 propositions removed Detecting unreachable propositions: [0.110s CPU, 0.112s wall-clock] Reordering and filtering variables... 33 of 33 variables necessary. 17 of 33 mutex groups necessary. 512 of 512 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.060s CPU, 0.062s wall-clock] Translator variables: 33 Translator derived variables: 0 Translator facts: 306 Translator goal facts: 15 Translator mutex groups: 17 Translator total mutex groups size: 289 Translator operators: 512 Translator axioms: 0 Translator task size: 4435 Translator peak memory: 35672 KB Writing output... [0.080s CPU, 0.087s wall-clock] Done! [0.920s CPU, 0.933s wall-clock] planner.py version 0.0.1 Time: 0.18s Memory: 54MB 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: 58MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 60MB (+2MB) UNSAT Iteration Time: 0.11s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.03s Memory: 60MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 61MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.04s Memory: 63MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 63MB (+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.08s Memory: 65MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 67MB (+2MB) UNSAT Iteration Time: 0.11s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.09s Memory: 70MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 72MB (+2MB) UNSAT Iteration Time: 0.11s 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: 81MB (+9MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 85MB (+4MB) UNSAT Iteration Time: 0.20s 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.20s Memory: 96MB (+11MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 99MB (+3MB) UNSAT Iteration Time: 0.30s 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.31s Memory: 117MB (+18MB) Unblocking actions... Solving... Solving Time: 1.83s Memory: 141MB (+24MB) UNSAT Iteration Time: 2.24s 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.49s Memory: 167MB (+26MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","e","f")),1) occurs(action(("put-down","e")),2) occurs(action(("unstack","f","h")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","h","b")),5) occurs(action(("put-down","h")),6) occurs(action(("unstack","l","o")),7) occurs(action(("stack","l","e")),8) occurs(action(("unstack","b","c")),9) occurs(action(("put-down","b")),10) occurs(action(("unstack","c","m")),11) occurs(action(("put-down","c")),12) occurs(action(("unstack","m","d")),13) occurs(action(("stack","m","l")),14) occurs(action(("unstack","d","a")),15) occurs(action(("put-down","d")),16) occurs(action(("unstack","a","p")),17) occurs(action(("stack","a","b")),18) occurs(action(("unstack","p","n")),19) occurs(action(("stack","p","o")),20) occurs(action(("unstack","a","b")),21) occurs(action(("stack","a","p")),22) occurs(action(("unstack","n","g")),23) occurs(action(("stack","n","a")),24) occurs(action(("unstack","g","i")),25) occurs(action(("stack","g","b")),26) occurs(action(("unstack","m","l")),27) occurs(action(("stack","m","n")),28) occurs(action(("unstack","i","k")),29) occurs(action(("stack","i","h")),30) occurs(action(("unstack","k","j")),31) occurs(action(("stack","k","i")),32) occurs(action(("unstack","l","e")),33) occurs(action(("stack","l","m")),34) occurs(action(("pick-up","c")),35) occurs(action(("stack","c","l")),36) occurs(action(("pick-up","e")),37) occurs(action(("stack","e","c")),38) occurs(action(("unstack","g","b")),39) occurs(action(("stack","g","e")),40) occurs(action(("pick-up","j")),41) occurs(action(("stack","j","g")),42) occurs(action(("unstack","k","i")),43) occurs(action(("stack","k","j")),44) occurs(action(("unstack","i","h")),45) occurs(action(("stack","i","k")),46) occurs(action(("pick-up","f")),47) occurs(action(("stack","f","d")),48) occurs(action(("unstack","i","k")),49) occurs(action(("stack","i","f")),50) occurs(action(("unstack","i","f")),51) occurs(action(("stack","i","h")),52) occurs(action(("pick-up","b")),53) occurs(action(("stack","b","k")),54) occurs(action(("unstack","f","d")),55) occurs(action(("stack","f","b")),56) occurs(action(("unstack","f","b")),57) occurs(action(("stack","f","b")),58) occurs(action(("unstack","f","b")),59) occurs(action(("stack","f","d")),60) occurs(action(("unstack","i","h")),61) occurs(action(("stack","i","h")),62) occurs(action(("unstack","f","d")),63) occurs(action(("stack","f","b")),64) occurs(action(("unstack","i","h")),65) occurs(action(("put-down","i")),66) occurs(action(("pick-up","h")),67) occurs(action(("stack","h","f")),68) occurs(action(("pick-up","d")),69) occurs(action(("stack","d","h")),70) occurs(action(("pick-up","i")),71) occurs(action(("put-down","i")),72) occurs(action(("unstack","d","h")),73) occurs(action(("stack","d","h")),74) occurs(action(("pick-up","i")),75) occurs(action(("put-down","i")),76) occurs(action(("pick-up","i")),77) occurs(action(("stack","i","d")),78) Solving Time: 0.86s Memory: 176MB (+9MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.852s (Solving: 2.68s 1st Model: 0.83s Unsat: 1.84s) CPU Time : 4.840s Choices : 14345 Conflicts : 6004 (Analyzed: 6000) Restarts : 61 (Average: 98.36 Last: 71) Model-Level : 130.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 6000 (Deleted: 3000) Binary : 468 (Ratio: 7.80%) Ternary : 245 (Ratio: 4.08%) Conflict : 6000 (Average Length: 1222.2 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6000 (Average: 2.75 Max: 170 Sum: 16509) Executed : 5930 (Average: 2.33 Max: 170 Sum: 13954 Ratio: 84.52%) Bounded : 70 (Average: 36.50 Max: 71 Sum: 2555 Ratio: 15.48%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 77631 (Eliminated: 0 Frozen: 60897) Constraints : 496656 (Binary: 93.8% Ternary: 3.9% Other: 2.3%) Memory Peak : 178MB Max. Length : 78 steps Sol. Length : 78 steps