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-27.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-27.pddl Parsing... Parsing: [0.010s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.011s wall-clock] Preparing model... [0.000s CPU, 0.011s wall-clock] Generated 18 rules. Computing model... [0.040s CPU, 0.037s wall-clock] 301 relevant atoms 198 auxiliary atoms 499 final queue length 620 total queue pushes Completing instantiation... [0.030s CPU, 0.029s wall-clock] Instantiating: [0.090s CPU, 0.093s 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.000s CPU, 0.001s wall-clock] Translating task: [0.030s CPU, 0.025s 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.010s CPU, 0.015s 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.010s CPU, 0.013s wall-clock] Done! [0.170s CPU, 0.178s wall-clock] planner.py version 0.0.1 Time: 0.09s Memory: 50MB 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: 50MB (+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.06s Memory: 57MB (+7MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 58MB (+1MB) UNSAT Iteration Time: 0.08s 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.05s Memory: 61MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f1","p3")),1) occurs(action(("board","f1","p4")),1) occurs(action(("board","f0","p5")),1) occurs(action(("up","f0","f1")),1) occurs(action(("board","f1","p3")),2) occurs(action(("board","f1","p3")),3) occurs(action(("depart","f4","p5")),4) occurs(action(("up","f1","f4")),4) occurs(action(("board","f11","p1")),5) occurs(action(("board","f4","p2")),5) occurs(action(("up","f4","f11")),5) occurs(action(("depart","f8","p1")),6) occurs(action(("down","f11","f8")),6) occurs(action(("depart","f7","p2")),7) occurs(action(("down","f8","f7")),7) occurs(action(("depart","f7","p4")),8) occurs(action(("up","f7","f8")),8) occurs(action(("depart","f10","p3")),9) occurs(action(("board","f8","p0")),9) occurs(action(("up","f8","f10")),9) occurs(action(("depart","f5","p0")),10) occurs(action(("down","f10","f5")),10) Solving Time: 0.01s Memory: 62MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.240s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.01s) CPU Time : 0.240s Choices : 408 Conflicts : 153 (Analyzed: 152) Restarts : 1 (Average: 152.00 Last: 46) Model-Level : 65.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 155 (Deleted: 0) Binary : 7 (Ratio: 4.52%) Ternary : 6 (Ratio: 3.87%) Conflict : 152 (Average Length: 14.5 Ratio: 98.06%) Loop : 3 (Average Length: 14.7 Ratio: 1.94%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 152 (Average: 2.55 Max: 56 Sum: 387) Executed : 144 (Average: 2.34 Max: 56 Sum: 355 Ratio: 91.73%) Bounded : 8 (Average: 4.00 Max: 7 Sum: 32 Ratio: 8.27%) Rules : 36564 Atoms : 36564 Bodies : 1 (Original: 0) Tight : Yes Variables : 7930 (Eliminated: 0 Frozen: 7270) Constraints : 17008 (Binary: 87.7% Ternary: 10.8% Other: 1.5%) Memory Peak : 62MB Max. Length : 10 steps Sol. Length : 10 steps