INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-23.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/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-23.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s 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.010s wall-clock]
Preparing model... [0.010s CPU, 0.005s wall-clock]
Generated 21 rules.
Computing model... [0.060s CPU, 0.059s wall-clock]
453 relevant atoms
297 auxiliary atoms
750 final queue length
1260 total queue pushes
Completing instantiation... [0.090s CPU, 0.081s wall-clock]
Instantiating: [0.170s CPU, 0.159s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.018s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.000s CPU, 0.005s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.040s CPU, 0.041s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.010s CPU, 0.004s wall-clock]
Translating task: [0.090s CPU, 0.084s wall-clock]
352 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
22 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.048s wall-clock]
Reordering and filtering variables...
23 of 23 variables necessary.
12 of 23 mutex groups necessary.
242 of 242 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.028s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 156
Translator goal facts: 10
Translator mutex groups: 12
Translator total mutex groups size: 144
Translator operators: 242
Translator axioms: 0
Translator task size: 2115
Translator peak memory: 34136 KB
Writing output... [0.030s CPU, 0.037s wall-clock]
Done! [0.420s CPU, 0.421s wall-clock]
planner.py version 0.0.1

Time:	 0.26s
Memory: 60MB

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:		 60MB (+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.22s
Memory:		 88MB (+28MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 90MB (+2MB)
UNSAT
Iteration Time:	 0.28s

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.20s
Memory:		 102MB (+12MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 104MB (+2MB)
UNSAT
Iteration Time:	 0.26s

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:		 121MB (+17MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 124MB (+3MB)
UNSAT
Iteration Time:	 0.37s

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.20s
Memory:		 134MB (+10MB)
Unblocking actions...
Solving...
Solving Time:	 0.05s
Memory:		 139MB (+5MB)
UNSAT
Iteration Time:	 0.31s

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.21s
Memory:		 149MB (+10MB)
Unblocking actions...
Solving...
Solving Time:	 0.19s
Memory:		 155MB (+6MB)
UNSAT
Iteration Time:	 0.46s

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.23s
Memory:		 161MB (+6MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","f","e")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","e","k")),3) occurs(action(("put-down","e")),4) occurs(action(("unstack","j","i")),5) occurs(action(("put-down","j")),6) occurs(action(("unstack","d","c")),7) occurs(action(("put-down","d")),8) occurs(action(("pick-up","i")),9) occurs(action(("stack","i","e")),10) occurs(action(("unstack","g","b")),11) occurs(action(("stack","g","i")),12) occurs(action(("pick-up","f")),13) occurs(action(("stack","f","g")),14) occurs(action(("unstack","c","h")),15) occurs(action(("stack","c","f")),16) occurs(action(("unstack","b","a")),17) occurs(action(("put-down","b")),18) occurs(action(("pick-up","a")),19) occurs(action(("stack","a","c")),20) occurs(action(("pick-up","h")),21) occurs(action(("stack","h","a")),22) occurs(action(("pick-up","k")),23) occurs(action(("stack","k","h")),24) occurs(action(("pick-up","j")),25) occurs(action(("stack","j","k")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","j")),28) occurs(action(("pick-up","b")),29) occurs(action(("stack","b","d")),30)
Solving Time:	 0.51s
Memory:		 168MB (+7MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 7
Time         : 2.739s (Solving: 0.70s 1st Model: 0.48s Unsat: 0.22s)
CPU Time     : 2.730s

Choices      : 6239    
Conflicts    : 1978     (Analyzed: 1973)
Restarts     : 24       (Average: 82.21 Last: 33)
Model-Level  : 47.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 2050     (Deleted: 0)
  Binary     : 197      (Ratio:   9.61%)
  Ternary    : 87       (Ratio:   4.24%)
  Conflict   : 1973     (Average Length:  126.8 Ratio:  96.24%) 
  Loop       : 77       (Average Length:   20.0 Ratio:   3.76%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 1973     (Average:  3.57 Max: 191 Sum:   7034)
  Executed   : 1925     (Average:  3.15 Max: 191 Sum:   6215 Ratio:  88.36%)
  Bounded    : 48       (Average: 17.06 Max:  30 Sum:    819 Ratio:  11.64%)

Rules        : 97833   
Atoms        : 97833   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 55324    (Eliminated:    0 Frozen: 50325)
Constraints  : 172801   (Binary:  85.1% Ternary:  11.3% Other:   3.6%)

Memory Peak  : 168MB
Max. Length  : 30 steps
Sol. Length  : 30 steps


