INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-3.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/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-3.pddl Parsing... Parsing: [0.010s CPU, 0.010s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.002s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock] Preparing model... [0.010s CPU, 0.006s wall-clock] Generated 24 rules. Computing model... [0.010s CPU, 0.019s wall-clock] 141 relevant atoms 100 auxiliary atoms 241 final queue length 316 total queue pushes Completing instantiation... [0.030s CPU, 0.021s wall-clock] Instantiating: [0.060s CPU, 0.060s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.010s CPU, 0.009s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.003s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.000s wall-clock] Computing fact groups: [0.010s CPU, 0.016s 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.001s wall-clock] Translating task: [0.020s CPU, 0.019s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 3 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.010s wall-clock] Reordering and filtering variables... 11 of 11 variables necessary. 8 of 11 mutex groups necessary. 66 of 66 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock] Translator variables: 11 Translator derived variables: 0 Translator facts: 44 Translator goal facts: 8 Translator mutex groups: 8 Translator total mutex groups size: 32 Translator operators: 66 Translator axioms: 0 Translator task size: 453 Translator peak memory: 33112 KB Writing output... [0.010s CPU, 0.010s wall-clock] Done! [0.130s CPU, 0.134s wall-clock] planner.py version 0.0.1 Time: 0.03s Memory: 46MB 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: 46MB (+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.01s Memory: 47MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 47MB (+0MB) UNSAT Iteration Time: 0.02s 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.01s Memory: 47MB (+0MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 48MB (+1MB) UNSAT Iteration Time: 0.07s 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.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Solving Time: 0.25s Memory: 49MB (+1MB) UNKNOWN Iteration Time: 0.27s 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.01s Memory: 49MB (+0MB) Unblocking actions... Solving... Solving Time: 0.26s Memory: 49MB (+0MB) UNKNOWN Iteration Time: 0.27s 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.01s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.30s Memory: 51MB (+1MB) UNKNOWN Iteration Time: 0.31s 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.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("pick","ball6","rooma","left")),1) occurs(action(("pick","ball1","rooma","right")),2) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball6","roomb","left")),4) occurs(action(("drop","ball1","roomb","right")),5) occurs(action(("move","roomb","rooma")),6) occurs(action(("move","rooma","roomb")),7) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball4","rooma","left")),9) occurs(action(("pick","ball3","rooma","right")),10) occurs(action(("move","rooma","roomb")),11) occurs(action(("drop","ball4","roomb","left")),12) occurs(action(("drop","ball3","roomb","right")),13) occurs(action(("move","roomb","rooma")),14) occurs(action(("pick","ball7","rooma","right")),15) occurs(action(("pick","ball5","rooma","left")),16) occurs(action(("drop","ball7","rooma","right")),17) occurs(action(("pick","ball2","rooma","right")),18) occurs(action(("move","rooma","roomb")),19) occurs(action(("drop","ball2","roomb","right")),20) occurs(action(("drop","ball5","roomb","left")),21) occurs(action(("move","roomb","rooma")),22) occurs(action(("pick","ball8","rooma","right")),23) occurs(action(("pick","ball7","rooma","left")),24) occurs(action(("move","rooma","roomb")),25) occurs(action(("drop","ball8","roomb","right")),26) occurs(action(("drop","ball7","roomb","left")),27) occurs(action(("pick","ball2","roomb","left")),28) occurs(action(("drop","ball2","roomb","left")),29) occurs(action(("move","roomb","rooma")),30) Solving Time: 0.26s Memory: 51MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 1.249s (Solving: 1.13s 1st Model: 0.26s Unsat: 0.05s) CPU Time : 1.250s Choices : 59381 Conflicts : 38347 (Analyzed: 38345) Restarts : 399 (Average: 96.10 Last: 144) Model-Level : 79.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 38345 (Deleted: 27176) Binary : 1733 (Ratio: 4.52%) Ternary : 956 (Ratio: 2.49%) Conflict : 38345 (Average Length: 20.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 38345 (Average: 1.41 Max: 64 Sum: 54124) Executed : 38311 (Average: 1.41 Max: 64 Sum: 53966 Ratio: 99.71%) Bounded : 34 (Average: 4.65 Max: 32 Sum: 158 Ratio: 0.29%) Rules : 1414 Atoms : 1414 Bodies : 1 (Original: 0) Tight : Yes Variables : 4873 (Eliminated: 0 Frozen: 2471) Constraints : 20640 (Binary: 86.1% Ternary: 11.6% Other: 2.2%) Memory Peak : 52MB Max. Length : 30 steps Sol. Length : 30 steps