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-54.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-54.pddl Parsing... Parsing: [0.020s CPU, 0.020s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock] Preparing model... [0.020s CPU, 0.021s wall-clock] Generated 18 rules. Computing model... [0.080s CPU, 0.080s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.080s CPU, 0.077s wall-clock] Instantiating: [0.190s CPU, 0.194s 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.000s CPU, 0.004s wall-clock] Translating task: [0.080s CPU, 0.077s 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.044s 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.030s CPU, 0.037s wall-clock] Done! [0.380s CPU, 0.399s 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.23s Memory: 57MB (+2MB) UNSAT Iteration Time: 0.27s 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: 0.89s Memory: 59MB (+1MB) UNKNOWN Iteration Time: 0.93s 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: 60MB (+1MB) Unblocking actions... Solving... Solving Time: 1.11s Memory: 62MB (+2MB) UNKNOWN Iteration Time: 1.15s 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: 0.03s Memory: 63MB (+1MB) Unblocking actions... Solving... Solving Time: 1.12s Memory: 64MB (+1MB) UNKNOWN Iteration Time: 1.17s Iteration 8 Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Blocking actions... Solving... Solving Time: 0.17s Memory: 65MB (+1MB) UNSAT Iteration Time: 0.17s Iteration 9 Queue: [(5,25,1,True), (6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 1.02s Memory: 65MB (+0MB) UNKNOWN Iteration Time: 1.02s Iteration 10 Queue: [(6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 1.09s Memory: 65MB (+0MB) UNKNOWN Iteration Time: 1.09s Iteration 11 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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.03s Memory: 67MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p10")),2) occurs(action(("board","f14","p9")),2) occurs(action(("down","f14","f4")),3) occurs(action(("depart","f4","p9")),4) occurs(action(("up","f4","f15")),5) occurs(action(("board","f15","p4")),6) occurs(action(("up","f15","f17")),7) occurs(action(("board","f17","p3")),8) occurs(action(("up","f17","f18")),9) occurs(action(("depart","f18","p4")),10) occurs(action(("board","f18","p7")),10) occurs(action(("down","f18","f11")),11) occurs(action(("depart","f11","p10")),12) occurs(action(("depart","f11","p7")),12) occurs(action(("down","f11","f1")),13) occurs(action(("board","f1","p2")),14) occurs(action(("up","f1","f4")),15) occurs(action(("up","f4","f8")),16) occurs(action(("board","f8","p8")),17) occurs(action(("down","f8","f6")),18) occurs(action(("up","f6","f8")),19) occurs(action(("up","f8","f9")),20) occurs(action(("depart","f9","p8")),21) occurs(action(("board","f9","p5")),21) occurs(action(("down","f9","f6")),22) occurs(action(("board","f6","p1")),23) occurs(action(("board","f6","p6")),23) occurs(action(("up","f6","f10")),24) occurs(action(("depart","f10","p6")),25) occurs(action(("up","f10","f13")),26) occurs(action(("board","f13","p0")),27) occurs(action(("up","f13","f19")),28) occurs(action(("depart","f19","p0")),29) occurs(action(("up","f19","f21")),30) occurs(action(("depart","f21","p1")),31) occurs(action(("down","f21","f8")),32) occurs(action(("depart","f8","p2")),33) occurs(action(("depart","f8","p5")),33) occurs(action(("up","f8","f12")),34) occurs(action(("depart","f12","p3")),35) Solving Time: 0.55s Memory: 69MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 11 Time : 6.589s (Solving: 6.17s 1st Model: 0.55s Unsat: 0.40s) CPU Time : 6.600s Choices : 76252 Conflicts : 52679 (Analyzed: 52675) Restarts : 601 (Average: 87.65 Last: 108) Model-Level : 63.0 Problems : 11 (Average Length: 22.91 Splits: 0) Lemmas : 52675 (Deleted: 39157) Binary : 295 (Ratio: 0.56%) Ternary : 1986 (Ratio: 3.77%) Conflict : 52675 (Average Length: 17.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 52675 (Average: 1.32 Max: 57 Sum: 69705) Executed : 52649 (Average: 1.32 Max: 57 Sum: 69562 Ratio: 99.79%) Bounded : 26 (Average: 5.50 Max: 22 Sum: 143 Ratio: 0.21%) Rules : 6199 Atoms : 6199 Bodies : 1 (Original: 0) Tight : Yes Variables : 20839 (Eliminated: 0 Frozen: 16534) Constraints : 104789 (Binary: 97.1% Ternary: 2.1% Other: 0.9%) Memory Peak : 70MB Max. Length : 35 steps Sol. Length : 35 steps