INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-2.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-2.pddl Parsing... Parsing: [0.020s CPU, 0.024s wall-clock] Normalizing task... [0.010s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.020s wall-clock] Preparing model... [0.020s CPU, 0.021s wall-clock] Generated 46 rules. Computing model... [0.500s CPU, 0.502s wall-clock] 5240 relevant atoms 2298 auxiliary atoms 7538 final queue length 15595 total queue pushes Completing instantiation... [1.360s CPU, 1.355s wall-clock] Instantiating: [1.920s CPU, 1.912s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.010s CPU, 0.017s wall-clock] Checking invariant weight... [0.010s CPU, 0.004s wall-clock] Instantiating groups... [0.000s CPU, 0.009s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 1 uncovered facts Choosing groups: [0.010s CPU, 0.009s wall-clock] Building translation key... [0.010s CPU, 0.005s wall-clock] Computing fact groups: [0.060s CPU, 0.065s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.003s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.060s CPU, 0.062s wall-clock] Translating task: [1.130s CPU, 1.135s wall-clock] 360 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 103 propositions removed Detecting unreachable propositions: [0.530s CPU, 0.524s wall-clock] Reordering and filtering variables... 20 of 20 variables necessary. 1 of 20 mutex groups necessary. 4140 of 4140 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.170s CPU, 0.168s wall-clock] Translator variables: 20 Translator derived variables: 0 Translator facts: 424 Translator goal facts: 3 Translator mutex groups: 1 Translator total mutex groups size: 11 Translator operators: 4140 Translator axioms: 0 Translator task size: 24548 Translator peak memory: 49240 KB Writing output... [0.480s CPU, 51.025s wall-clock] Done! [4.370s CPU, 54.914s wall-clock] planner.py version 0.0.1 Time: 0.81s Memory: 103MB 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: 103MB (+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.42s Memory: 104MB (+1MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 113MB (+9MB) UNSAT Iteration Time: 0.64s 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.44s Memory: 126MB (+13MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 138MB (+12MB) UNSAT Iteration Time: 0.69s 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.44s Memory: 145MB (+7MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 157MB (+12MB) UNSAT Iteration Time: 0.72s 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.53s Memory: 177MB (+20MB) Unblocking actions... Solving... Solving Time: 1.67s Memory: 192MB (+15MB) UNSAT Iteration Time: 2.41s 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.45s Memory: 217MB (+25MB) Unblocking actions... Solving... Answer: 1 occurs(action(("pickup","node5-5","key4")),1) occurs(action(("move","node5-5","node4-5")),2) occurs(action(("move","node4-5","node3-5")),3) occurs(action(("unlock","node3-5","node3-4","key4","triangle")),4) occurs(action(("move","node3-5","node3-4")),5) occurs(action(("unlock","node3-4","node3-3","key4","triangle")),6) occurs(action(("unlock","node3-4","node4-4","key4","triangle")),6) occurs(action(("move","node3-4","node3-3")),7) occurs(action(("unlock","node3-3","node3-2","key4","triangle")),8) occurs(action(("unlock","node3-3","node4-3","key4","triangle")),8) occurs(action(("move","node3-3","node4-3")),9) occurs(action(("pickup-and-loose","node4-3","key8","key4")),10) occurs(action(("move","node4-3","node3-3")),11) occurs(action(("move","node3-3","node3-2")),12) occurs(action(("putdown","node3-2","key8")),13) occurs(action(("move","node3-2","node2-2")),14) occurs(action(("move","node2-2","node1-2")),15) occurs(action(("move","node1-2","node1-1")),16) occurs(action(("move","node1-1","node1-0")),17) occurs(action(("move","node1-0","node0-0")),18) occurs(action(("pickup","node0-0","key0")),19) occurs(action(("move","node0-0","node0-1")),20) occurs(action(("move","node0-1","node1-1")),21) occurs(action(("move","node1-1","node2-1")),22) occurs(action(("move","node2-1","node3-1")),23) occurs(action(("move","node3-1","node4-1")),24) occurs(action(("putdown","node4-1","key0")),25) Solving Time: 0.51s Memory: 238MB (+21MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 6.553s (Solving: 2.18s 1st Model: 0.47s Unsat: 1.70s) CPU Time : 6.450s Choices : 9234 (Domain: 9234) Conflicts : 2062 (Analyzed: 2060) Restarts : 21 (Average: 98.10 Last: 25) Model-Level : 539.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 2060 (Deleted: 0) Binary : 86 (Ratio: 4.17%) Ternary : 46 (Ratio: 2.23%) Conflict : 2060 (Average Length: 2326.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2060 (Average: 3.89 Max: 209 Sum: 8013) Executed : 2042 (Average: 3.72 Max: 209 Sum: 7663 Ratio: 95.63%) Bounded : 18 (Average: 19.44 Max: 22 Sum: 350 Ratio: 4.37%) Rules : 82403 Atoms : 82403 Bodies : 1 (Original: 0) Tight : Yes Variables : 116751 (Eliminated: 0 Frozen: 103849) Constraints : 772877 (Binary: 98.0% Ternary: 1.0% Other: 1.1%) Memory Peak : 239MB Max. Length : 25 steps Sol. Length : 25 steps