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-35.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-35.pddl Parsing... Parsing: [0.010s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock] Preparing model... [0.010s CPU, 0.009s wall-clock] Generated 21 rules. Computing model... [0.130s CPU, 0.137s wall-clock] 1005 relevant atoms 663 auxiliary atoms 1668 final queue length 2863 total queue pushes Completing instantiation... [0.180s CPU, 0.177s wall-clock] Instantiating: [0.340s CPU, 0.341s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.023s 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.000s CPU, 0.002s wall-clock] Choosing groups... 18 uncovered facts Choosing groups: [0.010s CPU, 0.011s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.080s CPU, 0.073s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.007s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.006s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.009s wall-clock] Translating task: [0.200s CPU, 0.200s 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.112s 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.086s wall-clock] Done! [0.910s CPU, 0.919s wall-clock] planner.py version 0.0.1 Time: 1.09s Memory: 112MB Iteration 1 Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Solving... Solving Time: 0.01s Memory: 112MB (+0MB) UNSAT Iteration Time: 0.01s Iteration 2 Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 1.18s Memory: 239MB (+127MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 241MB (+2MB) UNSAT Iteration Time: 1.56s Iteration 3 Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 1.44s Memory: 320MB (+79MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 326MB (+6MB) UNSAT Iteration Time: 1.84s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 1.10s Memory: 375MB (+49MB) Unblocking actions... Solving... Solving Time: 0.08s Memory: 378MB (+3MB) UNSAT Iteration Time: 1.53s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 1.17s Memory: 430MB (+52MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 434MB (+4MB) UNSAT Iteration Time: 1.64s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 1.85s Memory: 537MB (+103MB) Unblocking actions... Solving... Solving Time: 0.18s Memory: 551MB (+14MB) UNSAT Iteration Time: 2.40s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 1.12s Memory: 595MB (+44MB) Unblocking actions... Solving... Solving Time: 0.24s Memory: 610MB (+15MB) UNSAT Iteration Time: 1.73s Iteration 8 Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 1.14s Memory: 650MB (+40MB) Unblocking actions... Solving... Solving Time: 0.52s Memory: 667MB (+17MB) UNSAT Iteration Time: 2.05s Iteration 9 Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 1.19s Memory: 703MB (+36MB) Unblocking actions... Solving... Solving Time: 2.49s Memory: 723MB (+20MB) UNSAT Iteration Time: 4.08s Iteration 10 Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 1.24s Memory: 765MB (+42MB) Unblocking actions... Solving... Solving Time: 1.79s Memory: 788MB (+23MB) UNSAT Iteration Time: 3.43s Iteration 11 Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 2.76s Memory: 924MB (+136MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","l","f")),1) occurs(action(("put-down","l")),2) occurs(action(("unstack","f","e")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","e","k")),5) occurs(action(("put-down","e")),6) occurs(action(("unstack","q","a")),7) occurs(action(("put-down","q")),8) occurs(action(("unstack","a","j")),9) occurs(action(("put-down","a")),10) occurs(action(("pick-up","e")),11) occurs(action(("put-down","e")),12) occurs(action(("unstack","j","i")),13) occurs(action(("put-down","j")),14) occurs(action(("unstack","g","d")),15) occurs(action(("stack","g","p")),16) occurs(action(("unstack","d","c")),17) occurs(action(("put-down","d")),18) occurs(action(("pick-up","f")),19) occurs(action(("stack","f","d")),20) occurs(action(("pick-up","k")),21) occurs(action(("stack","k","f")),22) occurs(action(("unstack","i","b")),23) occurs(action(("stack","i","k")),24) occurs(action(("unstack","b","m")),25) occurs(action(("stack","b","i")),26) occurs(action(("unstack","g","p")),27) occurs(action(("stack","g","b")),28) occurs(action(("pick-up","a")),29) occurs(action(("stack","a","g")),30) occurs(action(("pick-up","p")),31) occurs(action(("stack","p","a")),32) occurs(action(("pick-up","m")),33) occurs(action(("stack","m","p")),34) occurs(action(("pick-up","e")),35) occurs(action(("stack","e","m")),36) occurs(action(("unstack","c","o")),37) occurs(action(("stack","c","e")),38) occurs(action(("unstack","h","n")),39) occurs(action(("stack","h","c")),40) occurs(action(("pick-up","j")),41) occurs(action(("stack","j","h")),42) occurs(action(("pick-up","o")),43) occurs(action(("stack","o","j")),44) occurs(action(("pick-up","l")),45) occurs(action(("stack","l","o")),46) occurs(action(("pick-up","n")),47) occurs(action(("stack","n","l")),48) occurs(action(("pick-up","q")),49) occurs(action(("stack","q","n")),50) Solving Time: 3.35s Memory: 949MB (+25MB) SAT SATISFIABLE Models : 1+ Calls : 11 Time : 27.911s (Solving: 7.82s 1st Model: 3.19s Unsat: 4.62s) CPU Time : 27.890s Choices : 17972 Conflicts : 7645 (Analyzed: 7636) Restarts : 91 (Average: 83.91 Last: 60) Model-Level : 64.0 Problems : 11 (Average Length: 27.00 Splits: 0) Lemmas : 7903 (Deleted: 3568) Binary : 782 (Ratio: 9.89%) Ternary : 279 (Ratio: 3.53%) Conflict : 7636 (Average Length: 377.3 Ratio: 96.62%) Loop : 267 (Average Length: 32.8 Ratio: 3.38%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 7636 (Average: 2.66 Max: 134 Sum: 20307) Executed : 7506 (Average: 2.31 Max: 134 Sum: 17639 Ratio: 86.86%) Bounded : 130 (Average: 20.52 Max: 48 Sum: 2668 Ratio: 13.14%) Rules : 502168 Atoms : 502168 Bodies : 1 (Original: 0) Tight : Yes Variables : 208160 (Eliminated: 0 Frozen: 201068) Constraints : 666396 (Binary: 85.8% Ternary: 11.0% Other: 3.2%) Memory Peak : 1011MB Max. Length : 50 steps Sol. Length : 50 steps