INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-56.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/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-56.pddl Parsing... Parsing: [0.020s CPU, 0.033s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.020s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock] Preparing model... [0.030s CPU, 0.030s wall-clock] Generated 18 rules. Computing model... [0.110s CPU, 0.101s wall-clock] 1033 relevant atoms 684 auxiliary atoms 1717 final queue length 2246 total queue pushes Completing instantiation... [0.080s CPU, 0.091s wall-clock] Instantiating: [0.240s CPU, 0.242s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.004s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 24 uncovered facts Choosing groups: [0.000s CPU, 0.000s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.020s CPU, 0.009s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.005s wall-clock] Translating task: [0.090s CPU, 0.090s wall-clock] 12 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.050s CPU, 0.052s wall-clock] Reordering and filtering variables... 25 of 25 variables necessary. 0 of 1 mutex groups necessary. 576 of 576 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock] Translator variables: 25 Translator derived variables: 0 Translator facts: 72 Translator goal facts: 12 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 576 Translator axioms: 0 Translator task size: 1861 Translator peak memory: 34392 KB Writing output... [0.040s CPU, 0.044s wall-clock] Done! [0.480s CPU, 0.490s wall-clock] planner.py version 0.0.1 Time: 1.50s Memory: 136MB 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: 136MB (+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: 0.03s Memory: 138MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 139MB (+1MB) UNSAT Iteration Time: 0.06s 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: 0.03s Memory: 141MB (+2MB) Unblocking actions... Solving... Solving Time: 0.24s Memory: 142MB (+1MB) UNSAT Iteration Time: 0.30s 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: 0.03s Memory: 144MB (+2MB) Unblocking actions... Solving... Solving Time: 0.49s Memory: 147MB (+3MB) UNKNOWN Iteration Time: 0.54s 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: 0.03s Memory: 147MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f17")),1) occurs(action(("board","f17","p2")),2) occurs(action(("down","f17","f7")),2) occurs(action(("depart","f7","p2")),3) occurs(action(("board","f7","p0")),3) occurs(action(("up","f7","f22")),3) occurs(action(("depart","f22","p0")),4) occurs(action(("down","f22","f9")),4) occurs(action(("board","f9","p1")),5) occurs(action(("board","f9","p4")),5) occurs(action(("up","f9","f13")),5) occurs(action(("depart","f13","p4")),6) occurs(action(("down","f13","f4")),6) occurs(action(("board","f4","p9")),7) occurs(action(("up","f4","f17")),7) occurs(action(("board","f17","p2")),8) occurs(action(("down","f17","f11")),8) occurs(action(("board","f11","p10")),9) occurs(action(("board","f11","p7")),9) occurs(action(("board","f11","p10")),10) occurs(action(("board","f11","p7")),10) occurs(action(("down","f11","f2")),10) occurs(action(("board","f2","p5")),11) occurs(action(("board","f2","p6")),11) occurs(action(("up","f2","f15")),11) occurs(action(("board","f15","p11")),12) occurs(action(("down","f15","f10")),12) occurs(action(("up","f10","f21")),13) occurs(action(("board","f10","p3")),13) occurs(action(("depart","f21","p11")),14) occurs(action(("up","f21","f22")),14) occurs(action(("depart","f22","p7")),15) occurs(action(("down","f22","f19")),15) occurs(action(("depart","f19","p1")),16) occurs(action(("depart","f19","p5")),16) occurs(action(("depart","f19","p6")),16) occurs(action(("down","f19","f12")),16) occurs(action(("depart","f12","p3")),17) occurs(action(("board","f12","p8")),17) occurs(action(("up","f12","f18")),17) occurs(action(("depart","f18","p8")),18) occurs(action(("down","f18","f16")),18) occurs(action(("depart","f16","p9")),19) occurs(action(("down","f16","f8")),19) occurs(action(("depart","f8","p10")),20) occurs(action(("down","f8","f6")),20) Solving Time: 0.31s Memory: 150MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 2.771s (Solving: 1.04s 1st Model: 0.31s Unsat: 0.24s) CPU Time : 2.770s Choices : 32324 Conflicts : 19163 (Analyzed: 19161) Restarts : 215 (Average: 89.12 Last: 83) Model-Level : 73.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 19161 (Deleted: 13172) Binary : 154 (Ratio: 0.80%) Ternary : 679 (Ratio: 3.54%) Conflict : 19161 (Average Length: 15.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 19161 (Average: 1.51 Max: 31 Sum: 28870) Executed : 19153 (Average: 1.51 Max: 31 Sum: 28862 Ratio: 99.97%) Bounded : 8 (Average: 1.00 Max: 1 Sum: 8 Ratio: 0.03%) Rules : 909325 Atoms : 909325 Bodies : 1 (Original: 0) Tight : Yes Variables : 13383 (Eliminated: 0 Frozen: 936) Constraints : 57496 (Binary: 97.2% Ternary: 1.9% Other: 0.9%) Memory Peak : 150MB Max. Length : 20 steps Sol. Length : 20 steps