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-18.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-18.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.005s wall-clock]
Generated 21 rules.
Computing model... [0.050s CPU, 0.047s wall-clock]
317 relevant atoms
207 auxiliary atoms
524 final queue length
868 total queue pushes
Completing instantiation... [0.060s CPU, 0.062s wall-clock]
Instantiating: [0.130s CPU, 0.129s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.024s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.003s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
10 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.001s 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.003s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.003s wall-clock]
Translating task: [0.050s CPU, 0.055s wall-clock]
234 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
18 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.032s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
10 of 19 mutex groups necessary.
162 of 162 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.019s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 110
Translator goal facts: 8
Translator mutex groups: 10
Translator total mutex groups size: 100
Translator operators: 162
Translator axioms: 0
Translator task size: 1425
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.026s wall-clock]
Done! [0.320s CPU, 0.325s wall-clock]
planner.py version 0.0.1

Time:	 0.16s
Memory: 53MB

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:		 53MB (+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.10s
Memory:		 64MB (+11MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 64MB (+0MB)
UNSAT
Iteration Time:	 0.11s

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.08s
Memory:		 69MB (+5MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 70MB (+1MB)
UNSAT
Iteration Time:	 0.10s

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.09s
Memory:		 74MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 75MB (+1MB)
UNSAT
Iteration Time:	 0.11s

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.12s
Memory:		 82MB (+7MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 84MB (+2MB)
UNSAT
Iteration Time:	 0.15s

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.09s
Memory:		 88MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 90MB (+2MB)
UNSAT
Iteration Time:	 0.12s

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

Models       : 1+
Calls        : 7
Time         : 0.892s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.01s)
CPU Time     : 0.880s

Choices      : 638     
Conflicts    : 194      (Analyzed: 190)
Restarts     : 1        (Average: 190.00 Last: 51)
Model-Level  : 45.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 190      (Deleted: 0)
  Binary     : 47       (Ratio:  24.74%)
  Ternary    : 4        (Ratio:   2.11%)
  Conflict   : 190      (Average Length:   76.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 190      (Average:  5.27 Max:  43 Sum:   1002)
  Executed   : 164      (Average:  3.29 Max:  43 Sum:    625 Ratio:  62.38%)
  Bounded    : 26       (Average: 14.50 Max:  32 Sum:    377 Ratio:  37.62%)

Rules        : 48267   
Atoms        : 48267   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 18108    (Eliminated:    0 Frozen: 15985)
Constraints  : 46260    (Binary:  91.6% Ternary:   5.3% Other:   3.1%)

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


