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-46.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-46.pddl Parsing... Parsing: [0.030s CPU, 0.024s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.020s CPU, 0.023s wall-clock] Generated 18 rules. Computing model... [0.080s CPU, 0.079s wall-clock] 741 relevant atoms 490 auxiliary atoms 1231 final queue length 1592 total queue pushes Completing instantiation... [0.060s CPU, 0.065s wall-clock] Instantiating: [0.180s CPU, 0.185s 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.010s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 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.070s CPU, 0.062s wall-clock] 10 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.036s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 0 of 1 mutex groups necessary. 400 of 400 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 60 Translator goal facts: 10 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 400 Translator axioms: 0 Translator task size: 1311 Translator peak memory: 33880 KB Writing output... [0.030s CPU, 0.030s wall-clock] Done! [0.360s CPU, 0.362s wall-clock] planner.py version 0.0.1 Time: 0.07s Memory: 48MB 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: 48MB (+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 (+1MB) 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: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 52MB (+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: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.19s Memory: 55MB (+2MB) UNSAT Iteration Time: 0.22s 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: 56MB (+1MB) Unblocking actions... Solving... Solving Time: 0.84s Memory: 57MB (+1MB) UNKNOWN Iteration Time: 0.88s 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.02s Memory: 59MB (+2MB) Unblocking actions... Solving... Solving Time: 0.92s Memory: 61MB (+2MB) UNKNOWN Iteration Time: 0.96s 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.02s Memory: 62MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p5")),2) occurs(action(("up","f2","f7")),3) occurs(action(("depart","f7","p5")),4) occurs(action(("up","f7","f17")),5) occurs(action(("board","f17","p1")),6) occurs(action(("down","f17","f15")),7) occurs(action(("depart","f15","p1")),8) occurs(action(("down","f15","f13")),9) occurs(action(("board","f13","p2")),10) occurs(action(("up","f13","f15")),11) occurs(action(("depart","f15","p2")),12) occurs(action(("down","f15","f9")),13) occurs(action(("board","f9","p4")),14) occurs(action(("down","f9","f1")),15) occurs(action(("depart","f1","p4")),16) occurs(action(("up","f1","f10")),17) occurs(action(("board","f10","p6")),18) occurs(action(("up","f10","f19")),19) occurs(action(("depart","f19","p6")),20) occurs(action(("down","f19","f0")),21) occurs(action(("board","f0","p8")),22) occurs(action(("up","f0","f3")),23) occurs(action(("board","f3","p0")),24) occurs(action(("board","f3","p7")),24) occurs(action(("up","f3","f6")),25) occurs(action(("depart","f6","p0")),26) occurs(action(("depart","f6","p7")),26) occurs(action(("depart","f6","p8")),26) occurs(action(("board","f6","p3")),26) occurs(action(("up","f6","f12")),27) occurs(action(("depart","f12","p3")),28) occurs(action(("board","f12","p9")),28) occurs(action(("up","f12","f16")),29) occurs(action(("depart","f16","p9")),30) Solving Time: 0.02s Memory: 62MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 2.278s (Solving: 1.97s 1st Model: 0.02s Unsat: 0.19s) CPU Time : 2.270s Choices : 61494 (Domain: 61494) Conflicts : 18243 (Analyzed: 18240) Restarts : 225 (Average: 81.07 Last: 95) Model-Level : 139.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 18240 (Deleted: 13216) Binary : 139 (Ratio: 0.76%) Ternary : 277 (Ratio: 1.52%) Conflict : 18240 (Average Length: 40.2 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 18240 (Average: 2.89 Max: 49 Sum: 52780) Executed : 18226 (Average: 2.88 Max: 49 Sum: 52621 Ratio: 99.70%) Bounded : 14 (Average: 11.36 Max: 27 Sum: 159 Ratio: 0.30%) Rules : 5156 Atoms : 5156 Bodies : 1 (Original: 0) Tight : Yes Variables : 15027 (Eliminated: 0 Frozen: 11669) Constraints : 74258 (Binary: 96.8% Ternary: 2.2% Other: 1.0%) Memory Peak : 64MB Max. Length : 30 steps Sol. Length : 30 steps