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-45.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-45.pddl Parsing... Parsing: [0.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.020s CPU, 0.019s wall-clock] Generated 18 rules. Computing model... [0.060s CPU, 0.065s wall-clock] 613 relevant atoms 405 auxiliary atoms 1018 final queue length 1307 total queue pushes Completing instantiation... [0.060s CPU, 0.054s wall-clock] Instantiating: [0.160s CPU, 0.155s 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.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 18 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.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.003s wall-clock] Translating task: [0.050s CPU, 0.051s wall-clock] 9 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.029s wall-clock] Reordering and filtering variables... 19 of 19 variables necessary. 0 of 1 mutex groups necessary. 324 of 324 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock] Translator variables: 19 Translator derived variables: 0 Translator facts: 54 Translator goal facts: 9 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 324 Translator axioms: 0 Translator task size: 1072 Translator peak memory: 33624 KB Writing output... [0.020s CPU, 0.025s wall-clock] Done! [0.300s CPU, 0.302s wall-clock] planner.py version 0.0.1 Time: 0.39s Memory: 71MB 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: 71MB (+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.14s Memory: 91MB (+20MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 93MB (+2MB) UNSAT Iteration Time: 0.21s 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.16s Memory: 103MB (+10MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p2")),1) occurs(action(("up","f0","f10")),1) occurs(action(("board","f0","p7")),1) occurs(action(("depart","f10","p2")),2) occurs(action(("down","f10","f9")),2) occurs(action(("board","f9","p0")),3) occurs(action(("down","f9","f2")),3) occurs(action(("board","f2","p5")),3) occurs(action(("board","f2","p8")),3) occurs(action(("board","f2","p5")),4) occurs(action(("board","f2","p6")),4) occurs(action(("up","f2","f13")),4) occurs(action(("depart","f13","p8")),5) occurs(action(("down","f13","f1")),5) occurs(action(("depart","f1","p5")),6) occurs(action(("up","f1","f17")),6) occurs(action(("depart","f15","p7")),7) occurs(action(("board","f17","p3")),7) occurs(action(("down","f17","f15")),7) occurs(action(("depart","f15","p0")),8) occurs(action(("depart","f15","p3")),8) occurs(action(("board","f12","p1")),8) occurs(action(("down","f15","f12")),8) occurs(action(("board","f12","p1")),9) occurs(action(("board","f3","p4")),9) occurs(action(("down","f12","f3")),9) occurs(action(("depart","f2","p1")),10) occurs(action(("depart","f2","p4")),10) occurs(action(("depart","f3","p6")),10) occurs(action(("down","f3","f2")),10) occurs(action(("board","f2","p8")),10) Solving Time: 0.17s Memory: 105MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.967s (Solving: 0.20s 1st Model: 0.16s Unsat: 0.03s) CPU Time : 0.960s Choices : 1981 Conflicts : 1301 (Analyzed: 1300) Restarts : 17 (Average: 76.47 Last: 15) Model-Level : 39.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 1329 (Deleted: 0) Binary : 43 (Ratio: 3.24%) Ternary : 23 (Ratio: 1.73%) Conflict : 1300 (Average Length: 52.0 Ratio: 97.82%) Loop : 29 (Average Length: 23.6 Ratio: 2.18%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1300 (Average: 1.40 Max: 18 Sum: 1819) Executed : 1295 (Average: 1.38 Max: 18 Sum: 1796 Ratio: 98.74%) Bounded : 5 (Average: 4.60 Max: 7 Sum: 23 Ratio: 1.26%) Rules : 190923 Atoms : 190923 Bodies : 1 (Original: 0) Tight : Yes Variables : 17303 (Eliminated: 0 Frozen: 16303) Constraints : 37455 (Binary: 88.7% Ternary: 10.3% Other: 1.0%) Memory Peak : 105MB Max. Length : 10 steps Sol. Length : 10 steps