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-5.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-5.pddl
Parsing...
Parsing: [0.010s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 24 rules.
Computing model... [0.030s CPU, 0.034s wall-clock]
201 relevant atoms
140 auxiliary atoms
341 final queue length
452 total queue pushes
Completing instantiation... [0.030s CPU, 0.037s wall-clock]
Instantiating: [0.100s CPU, 0.102s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.010s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.007s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.024s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.030s 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.020s CPU, 0.016s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
12 of 15 mutex groups necessary.
98 of 98 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.007s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 64
Translator goal facts: 12
Translator mutex groups: 12
Translator total mutex groups size: 48
Translator operators: 98
Translator axioms: 0
Translator task size: 673
Translator peak memory: 33112 KB
Writing output... [0.020s CPU, 0.015s wall-clock]
Done! [0.210s CPU, 0.213s wall-clock]
planner.py version 0.0.1
Time: 0.04s
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.02s
Memory: 47MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+1MB)
UNSAT
Iteration Time: 0.03s
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: 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.49s
Memory: 50MB (+1MB)
UNKNOWN
Iteration Time: 0.51s
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: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.68s
Memory: 54MB (+3MB)
UNKNOWN
Iteration Time: 0.69s
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: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.64s
Memory: 56MB (+1MB)
UNKNOWN
Iteration Time: 0.66s
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: 57MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("pick","ball10","rooma","left")),1) occurs(action(("pick","ball1","rooma","right")),1) occurs(action(("move","rooma","roomb")),2) occurs(action(("drop","ball10","roomb","left")),3) occurs(action(("drop","ball1","roomb","right")),3) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball2","rooma","right")),5) occurs(action(("pick","ball11","rooma","left")),5) occurs(action(("move","rooma","roomb")),6) occurs(action(("drop","ball2","roomb","right")),7) occurs(action(("drop","ball11","roomb","left")),7) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball7","rooma","right")),9) occurs(action(("pick","ball3","rooma","left")),9) occurs(action(("move","rooma","roomb")),10) occurs(action(("drop","ball7","roomb","right")),11) occurs(action(("drop","ball3","roomb","left")),11) occurs(action(("move","roomb","rooma")),12) occurs(action(("pick","ball6","rooma","right")),13) occurs(action(("pick","ball12","rooma","left")),13) occurs(action(("move","rooma","roomb")),14) occurs(action(("drop","ball6","roomb","right")),15) occurs(action(("drop","ball12","roomb","left")),15) occurs(action(("move","roomb","rooma")),16) occurs(action(("pick","ball8","rooma","right")),17) occurs(action(("pick","ball4","rooma","left")),17) occurs(action(("move","rooma","roomb")),18) occurs(action(("drop","ball8","roomb","right")),19) occurs(action(("drop","ball4","roomb","left")),19) occurs(action(("move","roomb","rooma")),20) occurs(action(("pick","ball9","rooma","left")),21) occurs(action(("pick","ball5","rooma","right")),21) occurs(action(("move","rooma","roomb")),22) occurs(action(("drop","ball9","roomb","left")),23) occurs(action(("drop","ball5","roomb","right")),23) occurs(action(("move","roomb","rooma")),24) occurs(action(("move","rooma","roomb")),25)
Solving Time: 0.00s
Memory: 58MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 1.959s (Solving: 1.80s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 1.950s
Choices : 92725 (Domain: 92725)
Conflicts : 24211 (Analyzed: 24210)
Restarts : 300 (Average: 80.70 Last: 120)
Model-Level : 276.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 24210 (Deleted: 19454)
Binary : 226 (Ratio: 0.93%)
Ternary : 409 (Ratio: 1.69%)
Conflict : 24210 (Average Length: 137.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 24210 (Average: 2.44 Max: 161 Sum: 59154)
Executed : 24192 (Average: 2.44 Max: 161 Sum: 59042 Ratio: 99.81%)
Bounded : 18 (Average: 6.22 Max: 12 Sum: 112 Ratio: 0.19%)
Rules : 2240
Atoms : 2240
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 6655 (Eliminated: 0 Frozen: 3316)
Constraints : 32022 (Binary: 87.2% Ternary: 9.4% Other: 3.4%)
Memory Peak : 58MB
Max. Length : 25 steps
Sol. Length : 25 steps