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-53.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-53.pddl Parsing... Parsing: [0.020s CPU, 0.029s wall-clock] Normalizing task... [0.010s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock] Preparing model... [0.030s CPU, 0.027s wall-clock] Generated 18 rules. Computing model... [0.100s CPU, 0.097s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.080s CPU, 0.081s wall-clock] Instantiating: [0.220s CPU, 0.225s 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... 22 uncovered facts Choosing groups: [0.010s 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.000s CPU, 0.004s wall-clock] Translating task: [0.070s CPU, 0.074s 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.050s 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.010s 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.037s wall-clock] Done! [0.420s CPU, 0.438s wall-clock] planner.py version 0.0.1 Time: 1.06s Memory: 106MB 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.01s Memory: 106MB (+0MB) UNSAT Iteration Time: 0.01s 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: 108MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 109MB (+1MB) UNSAT Iteration Time: 0.05s 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: 110MB (+1MB) Unblocking actions... Solving... Solving Time: 0.22s Memory: 111MB (+1MB) UNSAT Iteration Time: 0.27s 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: 113MB (+2MB) Unblocking actions... Solving... Solving Time: 0.45s Memory: 115MB (+2MB) UNKNOWN Iteration Time: 0.49s 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.03s Memory: 116MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f7")),1) occurs(action(("board","f7","p6")),2) occurs(action(("up","f7","f18")),2) occurs(action(("board","f18","p7")),3) occurs(action(("down","f18","f9")),3) occurs(action(("up","f9","f12")),4) occurs(action(("board","f9","p8")),4) occurs(action(("board","f12","p3")),5) occurs(action(("up","f12","f20")),5) occurs(action(("depart","f20","p3")),6) occurs(action(("down","f20","f2")),6) occurs(action(("board","f2","p1")),7) occurs(action(("up","f2","f3")),7) occurs(action(("board","f3","p4")),8) occurs(action(("up","f3","f21")),8) occurs(action(("board","f21","p0")),9) occurs(action(("board","f21","p2")),9) occurs(action(("down","f21","f10")),9) occurs(action(("depart","f10","p7")),10) occurs(action(("down","f10","f8")),10) occurs(action(("depart","f8","p2")),11) occurs(action(("down","f8","f4")),11) occurs(action(("up","f4","f12")),12) occurs(action(("board","f4","p10")),12) occurs(action(("depart","f12","p0")),13) occurs(action(("board","f12","p3")),13) occurs(action(("up","f12","f16")),13) occurs(action(("board","f16","p5")),14) occurs(action(("down","f16","f1")),14) occurs(action(("board","f16","p9")),14) occurs(action(("depart","f1","p5")),15) occurs(action(("depart","f1","p8")),15) occurs(action(("up","f1","f7")),15) occurs(action(("depart","f7","p4")),16) occurs(action(("up","f7","f14")),16) occurs(action(("depart","f14","p10")),17) occurs(action(("down","f14","f0")),17) occurs(action(("depart","f0","p1")),18) occurs(action(("up","f0","f17")),18) occurs(action(("depart","f17","p9")),19) occurs(action(("down","f17","f10")),19) occurs(action(("depart","f10","p6")),20) occurs(action(("up","f10","f20")),20) Solving Time: 0.01s Memory: 118MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 1.927s (Solving: 0.68s 1st Model: 0.01s Unsat: 0.22s) CPU Time : 1.930s Choices : 23067 Conflicts : 14372 (Analyzed: 14370) Restarts : 163 (Average: 88.16 Last: 112) Model-Level : 79.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 14370 (Deleted: 9138) Binary : 151 (Ratio: 1.05%) Ternary : 600 (Ratio: 4.18%) Conflict : 14370 (Average Length: 14.2 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 14370 (Average: 1.46 Max: 22 Sum: 20987) Executed : 14364 (Average: 1.46 Max: 22 Sum: 20981 Ratio: 99.97%) Bounded : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 0.03%) Rules : 637313 Atoms : 637313 Bodies : 1 (Original: 0) Tight : Yes Variables : 11437 (Eliminated: 0 Frozen: 858) Constraints : 48531 (Binary: 97.0% Ternary: 2.1% Other: 1.0%) Memory Peak : 118MB Max. Length : 20 steps Sol. Length : 20 steps