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-26.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-26.pddl Parsing... Parsing: [0.020s CPU, 0.019s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock] Preparing model... [0.010s CPU, 0.012s wall-clock] Generated 18 rules. Computing model... [0.040s CPU, 0.041s wall-clock] 301 relevant atoms 198 auxiliary atoms 499 final queue length 620 total queue pushes Completing instantiation... [0.030s CPU, 0.031s wall-clock] Instantiating: [0.100s CPU, 0.102s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.006s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 12 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.010s CPU, 0.002s wall-clock] Translating task: [0.030s CPU, 0.027s wall-clock] 6 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.016s wall-clock] Reordering and filtering variables... 13 of 13 variables necessary. 0 of 1 mutex groups necessary. 144 of 144 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock] Translator variables: 13 Translator derived variables: 0 Translator facts: 36 Translator goal facts: 6 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 144 Translator axioms: 0 Translator task size: 499 Translator peak memory: 33112 KB Writing output... [0.020s CPU, 0.014s wall-clock] Done! [0.200s CPU, 0.196s wall-clock] planner.py version 0.0.1 Time: 0.11s Memory: 51MB 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: 51MB (+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: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.03s 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: 54MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f5")),1) occurs(action(("board","f5","p2")),2) occurs(action(("up","f5","f7")),2) occurs(action(("depart","f7","p2")),3) occurs(action(("down","f7","f2")),3) occurs(action(("up","f2","f10")),4) occurs(action(("board","f2","p5")),4) occurs(action(("board","f10","p3")),5) occurs(action(("down","f10","f9")),5) occurs(action(("board","f9","p1")),6) occurs(action(("board","f9","p4")),6) occurs(action(("down","f9","f1")),6) occurs(action(("depart","f1","p4")),7) occurs(action(("up","f1","f7")),7) occurs(action(("depart","f7","p1")),8) occurs(action(("depart","f7","p5")),8) occurs(action(("board","f7","p0")),8) occurs(action(("down","f7","f0")),8) occurs(action(("depart","f0","p3")),9) occurs(action(("up","f0","f10")),9) occurs(action(("depart","f10","p0")),10) occurs(action(("board","f10","p3")),10) occurs(action(("down","f10","f7")),10) Solving Time: 0.00s Memory: 55MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.172s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.180s Choices : 115 Conflicts : 54 (Analyzed: 53) Restarts : 0 Model-Level : 45.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 53 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 1 (Ratio: 1.89%) Conflict : 53 (Average Length: 9.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 53 (Average: 1.57 Max: 6 Sum: 83) Executed : 52 (Average: 1.55 Max: 6 Sum: 82 Ratio: 98.80%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 1.20%) Rules : 52898 Atoms : 52898 Bodies : 1 (Original: 0) Tight : Yes Variables : 2490 (Eliminated: 0 Frozen: 0) Constraints : 7726 (Binary: 93.9% Ternary: 4.5% Other: 1.7%) Memory Peak : 55MB Max. Length : 10 steps Sol. Length : 10 steps