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-52.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-52.pddl Parsing... Parsing: [0.020s CPU, 0.027s wall-clock] Normalizing task... [0.010s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock] Preparing model... [0.030s CPU, 0.025s wall-clock] Generated 18 rules. Computing model... [0.090s CPU, 0.091s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.070s CPU, 0.075s wall-clock] Instantiating: [0.200s CPU, 0.210s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.005s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 22 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.010s CPU, 0.010s 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.004s wall-clock] Translating task: [0.090s CPU, 0.076s 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.043s 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.010s CPU, 0.011s 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: 34136 KB Writing output... [0.040s CPU, 0.039s wall-clock] Done! [0.420s CPU, 0.422s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 49MB 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: 49MB (+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.04s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+1MB) UNSAT Iteration Time: 0.05s 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: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.05s 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: 55MB (+2MB) Unblocking actions... Solving... Solving Time: 0.19s Memory: 57MB (+2MB) UNSAT Iteration Time: 0.23s 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: 58MB (+1MB) Unblocking actions... Solving... Solving Time: 1.00s Memory: 59MB (+1MB) UNKNOWN Iteration Time: 1.03s 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: 0.03s Memory: 61MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p0")),1) occurs(action(("up","f0","f1")),2) occurs(action(("depart","f1","p0")),3) occurs(action(("up","f1","f11")),4) occurs(action(("board","f11","p1")),5) occurs(action(("up","f11","f16")),6) occurs(action(("depart","f16","p1")),7) occurs(action(("board","f16","p10")),7) occurs(action(("down","f16","f14")),8) occurs(action(("board","f14","p8")),9) occurs(action(("board","f14","p9")),9) occurs(action(("up","f14","f20")),10) occurs(action(("board","f20","p5")),11) occurs(action(("down","f20","f2")),12) occurs(action(("depart","f2","p5")),13) occurs(action(("depart","f2","p8")),13) occurs(action(("up","f2","f4")),14) occurs(action(("board","f4","p2")),15) occurs(action(("board","f4","p7")),15) occurs(action(("up","f4","f15")),16) occurs(action(("depart","f15","p7")),17) occurs(action(("board","f15","p6")),17) occurs(action(("up","f15","f17")),18) occurs(action(("depart","f17","p2")),19) occurs(action(("depart","f17","p6")),19) occurs(action(("depart","f17","p9")),19) occurs(action(("board","f17","p4")),19) occurs(action(("down","f17","f13")),20) occurs(action(("depart","f13","p10")),21) occurs(action(("board","f13","p3")),21) occurs(action(("down","f13","f7")),22) occurs(action(("depart","f7","p4")),23) occurs(action(("up","f7","f18")),24) occurs(action(("depart","f18","p3")),25) Solving Time: 0.81s Memory: 63MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 2.297s (Solving: 1.99s 1st Model: 0.80s Unsat: 0.19s) CPU Time : 2.300s Choices : 52057 (Domain: 52057) Conflicts : 16034 (Analyzed: 16031) Restarts : 198 (Average: 80.96 Last: 76) Model-Level : 120.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 16031 (Deleted: 10938) Binary : 132 (Ratio: 0.82%) Ternary : 255 (Ratio: 1.59%) Conflict : 16031 (Average Length: 44.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 16031 (Average: 2.81 Max: 40 Sum: 45060) Executed : 16001 (Average: 2.80 Max: 40 Sum: 44879 Ratio: 99.60%) Bounded : 30 (Average: 6.03 Max: 22 Sum: 181 Ratio: 0.40%) Rules : 6199 Atoms : 6199 Bodies : 1 (Original: 0) Tight : Yes Variables : 14739 (Eliminated: 0 Frozen: 11684) Constraints : 73882 (Binary: 97.1% Ternary: 2.0% Other: 0.9%) Memory Peak : 64MB Max. Length : 25 steps Sol. Length : 25 steps