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-17.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-17.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s 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.009s wall-clock]
Preparing model... [0.000s CPU, 0.004s wall-clock]
Generated 21 rules.
Computing model... [0.040s CPU, 0.039s wall-clock]
317 relevant atoms
207 auxiliary atoms
524 final queue length
867 total queue pushes
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
Instantiating: [0.110s CPU, 0.107s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.022s 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.001s wall-clock]
Choosing groups...
10 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.040s CPU, 0.038s 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.000s 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.060s CPU, 0.057s 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.031s 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.018s 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.025s wall-clock]
Done! [0.290s CPU, 0.297s wall-clock]
planner.py version 0.0.1

Time:	 0.15s
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.11s
Memory:		 65MB (+12MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 68MB (+3MB)
UNSAT
Iteration Time:	 0.14s

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.10s
Memory:		 73MB (+5MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 75MB (+2MB)
UNSAT
Iteration Time:	 0.13s

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.14s
Memory:		 84MB (+9MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 87MB (+3MB)
UNSAT
Iteration Time:	 0.18s

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.10s
Memory:		 92MB (+5MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 95MB (+3MB)
UNSAT
Iteration Time:	 0.16s

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.10s
Memory:		 99MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.04s
Memory:		 103MB (+4MB)
UNSAT
Iteration Time:	 0.18s

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

Models       : 1+
Calls        : 7
Time         : 1.184s (Solving: 0.15s 1st Model: 0.09s Unsat: 0.06s)
CPU Time     : 1.190s

Choices      : 1776    
Conflicts    : 683      (Analyzed: 678)
Restarts     : 7        (Average: 96.86 Last: 43)
Model-Level  : 42.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 756      (Deleted: 0)
  Binary     : 107      (Ratio:  14.15%)
  Ternary    : 36       (Ratio:   4.76%)
  Conflict   : 678      (Average Length:   47.2 Ratio:  89.68%) 
  Loop       : 78       (Average Length:   18.3 Ratio:  10.32%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 678      (Average:  3.15 Max:  74 Sum:   2137)
  Executed   : 650      (Average:  2.60 Max:  74 Sum:   1766 Ratio:  82.64%)
  Bounded    : 28       (Average: 13.25 Max:  28 Sum:    371 Ratio:  17.36%)

Rules        : 46908   
Atoms        : 46908   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 44586    (Eliminated:    0 Frozen: 33600)
Constraints  : 124026   (Binary:  84.8% Ternary:  12.2% Other:   3.0%)

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


