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-51.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-51.pddl Parsing... Parsing: [0.030s CPU, 0.034s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock] Preparing model... [0.030s CPU, 0.030s wall-clock] Generated 18 rules. Computing model... [0.100s CPU, 0.101s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.080s CPU, 0.080s wall-clock] Instantiating: [0.230s CPU, 0.234s 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.080s CPU, 0.075s 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.045s 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.000s 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.036s wall-clock] Done! [0.440s CPU, 0.452s 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.03s Memory: 49MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.04s 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 (+2MB) Unblocking actions... Solving... Solving Time: 0.30s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.34s 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.02s Memory: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.40s Memory: 56MB (+2MB) UNKNOWN Iteration Time: 0.43s 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.02s Memory: 57MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f8")),1) occurs(action(("board","f8","p5")),2) occurs(action(("down","f8","f2")),2) occurs(action(("up","f2","f7")),3) occurs(action(("board","f2","p9")),3) occurs(action(("depart","f7","p5")),4) occurs(action(("board","f7","p7")),4) occurs(action(("down","f7","f4")),4) occurs(action(("depart","f4","p7")),5) occurs(action(("down","f4","f0")),5) occurs(action(("depart","f0","p9")),6) occurs(action(("up","f0","f2")),6) occurs(action(("board","f2","p9")),7) occurs(action(("down","f2","f0")),7) occurs(action(("depart","f0","p9")),8) occurs(action(("board","f0","p3")),8) occurs(action(("up","f0","f16")),8) occurs(action(("board","f16","p6")),9) occurs(action(("up","f16","f21")),9) occurs(action(("board","f21","p10")),10) occurs(action(("down","f21","f3")),10) occurs(action(("depart","f3","p6")),11) occurs(action(("up","f3","f6")),11) occurs(action(("board","f3","p4")),11) occurs(action(("depart","f6","p3")),12) occurs(action(("up","f6","f20")),12) occurs(action(("down","f20","f1")),13) occurs(action(("board","f20","p8")),13) occurs(action(("depart","f1","p4")),14) occurs(action(("board","f1","p2")),14) occurs(action(("up","f1","f17")),14) occurs(action(("board","f17","p0")),15) occurs(action(("board","f17","p1")),15) occurs(action(("down","f17","f13")),15) occurs(action(("depart","f13","p1")),16) occurs(action(("down","f13","f10")),16) occurs(action(("depart","f10","p0")),17) occurs(action(("depart","f10","p8")),17) occurs(action(("up","f10","f15")),17) occurs(action(("depart","f15","p2")),18) occurs(action(("up","f15","f17")),18) occurs(action(("board","f17","p1")),19) occurs(action(("down","f17","f8")),19) occurs(action(("depart","f8","p10")),20) occurs(action(("board","f8","p5")),20) occurs(action(("down","f8","f0")),20) Solving Time: 0.25s Memory: 58MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 1.177s (Solving: 0.95s 1st Model: 0.24s Unsat: 0.30s) CPU Time : 1.180s Choices : 34452 Conflicts : 20500 (Analyzed: 20498) Restarts : 238 (Average: 86.13 Last: 94) Model-Level : 94.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 20498 (Deleted: 14681) Binary : 105 (Ratio: 0.51%) Ternary : 500 (Ratio: 2.44%) Conflict : 20498 (Average Length: 13.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 20498 (Average: 1.49 Max: 51 Sum: 30446) Executed : 20490 (Average: 1.48 Max: 51 Sum: 30438 Ratio: 99.97%) Bounded : 8 (Average: 1.00 Max: 1 Sum: 8 Ratio: 0.03%) Rules : 5726 Atoms : 5726 Bodies : 1 (Original: 0) Tight : Yes Variables : 11439 (Eliminated: 0 Frozen: 440) Constraints : 48548 (Binary: 96.9% Ternary: 2.1% Other: 1.0%) Memory Peak : 59MB Max. Length : 20 steps Sol. Length : 20 steps