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-11.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-11.pddl Parsing... Parsing: [0.010s CPU, 0.011s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.002s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock] Preparing model... [0.000s CPU, 0.004s wall-clock] Generated 21 rules. Computing model... [0.030s CPU, 0.028s wall-clock] 205 relevant atoms 133 auxiliary atoms 338 final queue length 550 total queue pushes Completing instantiation... [0.040s CPU, 0.038s wall-clock] Instantiating: [0.080s CPU, 0.081s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.020s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.002s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 8 uncovered facts Choosing groups: [0.000s CPU, 0.003s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.030s CPU, 0.032s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.002s wall-clock] Translating task: [0.030s CPU, 0.035s wall-clock] 140 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 14 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.021s wall-clock] Reordering and filtering variables... 15 of 15 variables necessary. 8 of 15 mutex groups necessary. 98 of 98 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.012s wall-clock] Translator variables: 15 Translator derived variables: 0 Translator facts: 72 Translator goal facts: 6 Translator mutex groups: 8 Translator total mutex groups size: 64 Translator operators: 98 Translator axioms: 0 Translator task size: 871 Translator peak memory: 33368 KB Writing output... [0.010s CPU, 0.017s wall-clock] Done! [0.210s CPU, 0.215s wall-clock] planner.py version 0.0.1 Time: 0.04s Memory: 47MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.03s Memory: 48MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.03s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.01s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 49MB (+1MB) UNSAT Iteration Time: 0.01s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.02s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+0MB) UNSAT Iteration Time: 0.03s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.02s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.03s 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.03s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.14s 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.05s Memory: 58MB (+4MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 59MB (+1MB) UNSAT Iteration Time: 0.13s 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.06s Memory: 63MB (+4MB) Unblocking actions... Solving... Solving Time: 0.13s Memory: 64MB (+1MB) UNSAT Iteration Time: 0.21s 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.10s Memory: 71MB (+7MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","c","d")),1) occurs(action(("put-down","c")),2) occurs(action(("unstack","d","b")),3) occurs(action(("put-down","d")),4) occurs(action(("unstack","b","e")),5) occurs(action(("put-down","b")),6) occurs(action(("unstack","e","f")),7) occurs(action(("put-down","e")),8) occurs(action(("pick-up","b")),9) occurs(action(("stack","b","e")),10) occurs(action(("unstack","b","e")),11) occurs(action(("stack","b","e")),12) occurs(action(("unstack","a","g")),13) occurs(action(("put-down","a")),14) occurs(action(("unstack","b","e")),15) occurs(action(("stack","b","e")),16) occurs(action(("unstack","b","e")),17) occurs(action(("put-down","b")),18) occurs(action(("pick-up","g")),19) occurs(action(("stack","g","b")),20) occurs(action(("pick-up","e")),21) occurs(action(("stack","e","d")),22) occurs(action(("unstack","g","b")),23) occurs(action(("put-down","g")),24) occurs(action(("pick-up","a")),25) occurs(action(("stack","a","g")),26) occurs(action(("pick-up","f")),27) occurs(action(("stack","f","b")),28) occurs(action(("pick-up","c")),29) occurs(action(("put-down","c")),30) occurs(action(("unstack","f","b")),31) occurs(action(("stack","f","b")),32) occurs(action(("unstack","e","d")),33) occurs(action(("put-down","e")),34) occurs(action(("pick-up","e")),35) occurs(action(("put-down","e")),36) occurs(action(("pick-up","d")),37) occurs(action(("put-down","d")),38) occurs(action(("pick-up","c")),39) occurs(action(("stack","c","d")),40) occurs(action(("unstack","a","g")),41) occurs(action(("stack","a","e")),42) occurs(action(("pick-up","g")),43) occurs(action(("stack","g","c")),44) occurs(action(("unstack","a","e")),45) occurs(action(("stack","a","g")),46) occurs(action(("unstack","a","g")),47) occurs(action(("put-down","a")),48) occurs(action(("unstack","f","b")),49) occurs(action(("stack","f","g")),50) occurs(action(("pick-up","e")),51) occurs(action(("stack","e","a")),52) occurs(action(("pick-up","b")),53) occurs(action(("stack","b","f")),54) occurs(action(("unstack","e","a")),55) occurs(action(("stack","e","b")),56) occurs(action(("pick-up","a")),57) occurs(action(("put-down","a")),58) occurs(action(("unstack","e","b")),59) occurs(action(("stack","e","b")),60) occurs(action(("pick-up","a")),61) occurs(action(("put-down","a")),62) occurs(action(("pick-up","a")),63) occurs(action(("stack","a","e")),64) occurs(action(("unstack","a","e")),65) occurs(action(("stack","a","e")),66) occurs(action(("unstack","a","e")),67) occurs(action(("stack","a","e")),68) occurs(action(("unstack","a","e")),69) occurs(action(("stack","a","e")),70) occurs(action(("unstack","a","e")),71) occurs(action(("put-down","a")),72) occurs(action(("pick-up","a")),73) occurs(action(("put-down","a")),74) occurs(action(("pick-up","a")),75) occurs(action(("stack","a","e")),76) occurs(action(("unstack","a","e")),77) occurs(action(("stack","a","e")),78) Solving Time: 0.03s Memory: 73MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 0.806s (Solving: 0.33s 1st Model: 0.03s Unsat: 0.30s) CPU Time : 0.810s Choices : 10123 Conflicts : 4658 (Analyzed: 4651) Restarts : 52 (Average: 89.44 Last: 56) Model-Level : 218.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 4651 (Deleted: 0) Binary : 261 (Ratio: 5.61%) Ternary : 165 (Ratio: 3.55%) Conflict : 4651 (Average Length: 142.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 4651 (Average: 2.17 Max: 256 Sum: 10104) Executed : 4613 (Average: 2.08 Max: 256 Sum: 9669 Ratio: 95.69%) Bounded : 38 (Average: 11.45 Max: 36 Sum: 435 Ratio: 4.31%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 18568 (Eliminated: 0 Frozen: 13587) Constraints : 113799 (Binary: 90.4% Ternary: 4.6% Other: 5.0%) Memory Peak : 74MB Max. Length : 78 steps Sol. Length : 78 steps