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-53.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-53.pddl Parsing... Parsing: [0.030s CPU, 0.030s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.020s CPU, 0.026s wall-clock] Generated 18 rules. Computing model... [0.100s CPU, 0.098s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.090s CPU, 0.085s wall-clock] Instantiating: [0.230s CPU, 0.232s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.000s CPU, 0.005s 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... 22 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.010s CPU, 0.011s 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.010s CPU, 0.005s wall-clock] Translating task: [0.090s CPU, 0.086s wall-clock] 11 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.040s CPU, 0.049s wall-clock] Reordering and filtering variables... 23 of 23 variables necessary. 0 of 1 mutex groups necessary. 484 of 484 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.013s wall-clock] Translator variables: 23 Translator derived variables: 0 Translator facts: 66 Translator goal facts: 11 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 484 Translator axioms: 0 Translator task size: 1574 Translator peak memory: 37324 KB Writing output... [0.040s CPU, 0.040s wall-clock] Done! [0.460s CPU, 0.467s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 52MB 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.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.00s 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.02s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.04s 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.02s Memory: 56MB (+2MB) Unblocking actions... Solving... Solving Time: 0.41s Memory: 56MB (+0MB) UNSAT Iteration Time: 0.44s 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.02s Memory: 59MB (+3MB) Unblocking actions... Solving... Solving Time: 0.49s Memory: 61MB (+2MB) UNKNOWN Iteration Time: 0.52s 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.02s Memory: 62MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f4")),1) occurs(action(("board","f4","p10")),2) occurs(action(("up","f4","f14")),2) occurs(action(("depart","f14","p10")),3) occurs(action(("down","f14","f2")),3) occurs(action(("board","f2","p1")),4) occurs(action(("down","f2","f0")),4) occurs(action(("depart","f0","p1")),5) occurs(action(("up","f0","f21")),5) occurs(action(("board","f21","p0")),6) occurs(action(("down","f21","f12")),6) occurs(action(("board","f21","p2")),6) occurs(action(("depart","f12","p0")),7) occurs(action(("board","f12","p3")),7) occurs(action(("down","f12","f9")),7) occurs(action(("board","f9","p8")),8) occurs(action(("down","f9","f1")),8) occurs(action(("depart","f1","p8")),9) occurs(action(("up","f1","f16")),9) occurs(action(("board","f16","p5")),10) occurs(action(("board","f16","p9")),10) occurs(action(("up","f16","f17")),10) occurs(action(("depart","f17","p9")),11) occurs(action(("up","f17","f18")),11) occurs(action(("board","f18","p7")),12) occurs(action(("down","f18","f10")),12) occurs(action(("depart","f10","p7")),13) occurs(action(("down","f10","f7")),13) occurs(action(("board","f7","p6")),14) occurs(action(("up","f7","f10")),14) occurs(action(("depart","f10","p6")),15) occurs(action(("down","f10","f3")),15) occurs(action(("board","f3","p4")),16) occurs(action(("up","f3","f7")),16) occurs(action(("depart","f7","p4")),17) occurs(action(("up","f7","f8")),17) occurs(action(("depart","f8","p2")),18) occurs(action(("up","f8","f20")),18) occurs(action(("depart","f20","p3")),19) occurs(action(("down","f20","f1")),19) occurs(action(("depart","f1","p5")),20) occurs(action(("up","f1","f18")),20) Solving Time: 0.01s Memory: 63MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 1.125s (Solving: 0.90s 1st Model: 0.01s Unsat: 0.41s) CPU Time : 1.124s Choices : 34977 (Domain: 34956) Conflicts : 15908 (Analyzed: 15906) Restarts : 195 (Average: 81.57 Last: 77) Model-Level : 127.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 15906 (Deleted: 11055) Binary : 2 (Ratio: 0.01%) Ternary : 11 (Ratio: 0.07%) Conflict : 15906 (Average Length: 27.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 15906 (Average: 1.92 Max: 21 Sum: 30486) Executed : 15903 (Average: 1.92 Max: 21 Sum: 30483 Ratio: 99.99%) Bounded : 3 (Average: 1.00 Max: 1 Sum: 3 Ratio: 0.01%) Rules : 5726 Atoms : 5726 Bodies : 1 (Original: 0) Tight : Yes Variables : 11437 (Eliminated: 0 Frozen: 440) Constraints : 48531 (Binary: 97.0% Ternary: 2.1% Other: 1.0%) Memory Peak : 64MB Max. Length : 20 steps Sol. Length : 20 steps