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.040s CPU, 0.035s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock] Preparing model... [0.030s CPU, 0.028s wall-clock] Generated 46 rules. Computing model... [0.560s CPU, 0.567s wall-clock] 5240 relevant atoms 2298 auxiliary atoms 7538 final queue length 15595 total queue pushes Completing instantiation... [1.510s CPU, 1.509s wall-clock] Instantiating: [2.140s CPU, 2.147s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.020s CPU, 0.021s wall-clock] Checking invariant weight... [0.010s CPU, 0.004s wall-clock] Instantiating groups... [0.010s CPU, 0.010s wall-clock] Collecting mutex groups... [0.010s 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.006s wall-clock] Computing fact groups: [0.080s CPU, 0.073s 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.000s CPU, 0.003s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.080s CPU, 0.072s wall-clock] Translating task: [1.310s CPU, 1.308s 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.600s CPU, 0.595s 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.190s CPU, 0.193s 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: 52428 KB Writing output... [0.420s CPU, 0.459s wall-clock] Done! [4.840s CPU, 4.876s wall-clock] planner.py version 0.0.1 Time: 0.91s Memory: 110MB 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: 110MB (+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.28s Memory: 110MB (+0MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 114MB (+4MB) UNSAT Iteration Time: 0.47s 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.31s Memory: 124MB (+10MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 136MB (+12MB) UNSAT Iteration Time: 0.52s 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.30s Memory: 142MB (+6MB) Unblocking actions... Solving... Solving Time: 0.16s Memory: 154MB (+12MB) UNSAT Iteration Time: 0.63s 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.39s Memory: 172MB (+18MB) Unblocking actions... Solving... Solving Time: 1.81s Memory: 195MB (+23MB) UNSAT Iteration Time: 2.38s 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.30s Memory: 208MB (+13MB) Unblocking actions... Solving... Answer: 1 occurs(action(("move","node5-5","node4-5")),1) occurs(action(("pickup","node5-5","key4")),1) occurs(action(("move","node4-5","node3-5")),2) occurs(action(("move","node3-5","node2-5")),3) occurs(action(("move","node2-5","node2-4")),4) occurs(action(("move","node2-4","node2-3")),5) occurs(action(("move","node2-3","node2-2")),6) occurs(action(("putdown","node2-3","key4")),6) occurs(action(("unlock","node2-3","node3-3","key4","triangle")),6) occurs(action(("move","node2-2","node2-1")),7) occurs(action(("move","node2-1","node2-0")),8) occurs(action(("move","node2-0","node1-0")),9) occurs(action(("move","node1-0","node0-0")),10) occurs(action(("pickup","node0-0","key0")),11) occurs(action(("move","node0-0","node1-0")),11) occurs(action(("move","node1-0","node2-0")),12) occurs(action(("move","node2-0","node3-0")),13) occurs(action(("move","node3-0","node4-0")),14) occurs(action(("move","node4-0","node4-1")),15) occurs(action(("putdown","node4-1","key0")),16) occurs(action(("move","node4-1","node3-1")),16) occurs(action(("move","node3-1","node2-1")),17) occurs(action(("move","node2-1","node2-2")),18) occurs(action(("move","node2-2","node2-3")),19) occurs(action(("move","node2-3","node3-3")),20) occurs(action(("pickup","node2-3","key4")),20) occurs(action(("unlock","node3-3","node3-2","key4","triangle")),21) occurs(action(("putdown","node3-3","key4")),21) occurs(action(("unlock","node3-3","node3-4","key4","triangle")),21) occurs(action(("unlock","node3-3","node4-3","key4","triangle")),21) occurs(action(("move","node3-3","node4-3")),22) occurs(action(("pickup","node4-3","key8")),23) occurs(action(("move","node4-3","node3-3")),23) occurs(action(("move","node3-3","node3-2")),24) occurs(action(("putdown","node3-2","key8")),25) Solving Time: 0.06s Memory: 230MB (+22MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 5.514s (Solving: 1.96s 1st Model: 0.03s Unsat: 1.93s) CPU Time : 5.480s Choices : 15284 (Domain: 15278) Conflicts : 3183 (Analyzed: 3181) Restarts : 34 (Average: 93.56 Last: 61) Model-Level : 239.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 3181 (Deleted: 1049) Binary : 181 (Ratio: 5.69%) Ternary : 75 (Ratio: 2.36%) Conflict : 3181 (Average Length: 2400.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 3181 (Average: 3.83 Max: 302 Sum: 12189) Executed : 3161 (Average: 3.71 Max: 302 Sum: 11795 Ratio: 96.77%) Bounded : 20 (Average: 19.70 Max: 22 Sum: 394 Ratio: 3.23%) Rules : 74663 Atoms : 74663 Bodies : 1 (Original: 0) Tight : Yes Variables : 115048 (Eliminated: 0 Frozen: 9415) Constraints : 595523 (Binary: 97.5% Ternary: 1.2% Other: 1.3%) Memory Peak : 230MB Max. Length : 25 steps Sol. Length : 25 steps