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-28.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-28.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.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.006s wall-clock]
Generated 21 rules.
Computing model... [0.080s CPU, 0.080s wall-clock]
613 relevant atoms
403 auxiliary atoms
1016 final queue length
1720 total queue pushes
Completing instantiation... [0.100s CPU, 0.107s wall-clock]
Instantiating: [0.200s CPU, 0.206s 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.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
14 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.050s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.120s wall-clock]
494 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
26 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.066s wall-clock]
Reordering and filtering variables...
27 of 27 variables necessary.
14 of 27 mutex groups necessary.
338 of 338 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.038s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 210
Translator goal facts: 12
Translator mutex groups: 14
Translator total mutex groups size: 196
Translator operators: 338
Translator axioms: 0
Translator task size: 2941
Translator peak memory: 34648 KB
Writing output... [0.050s CPU, 0.050s wall-clock]
Done! [0.550s CPU, 0.558s wall-clock]
planner.py version 0.0.1

Time:	 0.13s
Memory: 51MB

Iteration 1
Queue:		 [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until:	 0
Solving...
Solving Time:	 0.00s
Memory:		 51MB (+0MB)
UNSAT
Iteration Time:	 0.00s

Iteration 2
Queue:		 [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.06s
Memory:		 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 54MB (+1MB)
UNSAT
Iteration Time:	 0.07s

Iteration 3
Queue:		 [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.05s
Memory:		 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 57MB (+1MB)
UNSAT
Iteration Time:	 0.07s

Iteration 4
Queue:		 [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until:	 10
Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time:	 0.06s
Memory:		 60MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 61MB (+1MB)
UNSAT
Iteration Time:	 0.08s

Iteration 5
Queue:		 [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
Grounded Until:	 15
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time:	 0.05s
Memory:		 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 65MB (+2MB)
UNSAT
Iteration Time:	 0.07s

Iteration 6
Queue:		 [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100]
Grounded Until:	 20
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time:	 0.06s
Memory:		 67MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 68MB (+1MB)
UNSAT
Iteration Time:	 0.08s

Iteration 7
Queue:		 [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105]
Grounded Until:	 25
Grounding...	 [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time:	 0.06s
Memory:		 70MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 71MB (+1MB)
UNSAT
Iteration Time:	 0.09s

Iteration 8
Queue:		 [35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110]
Grounded Until:	 30
Grounding...	 [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time:	 0.07s
Memory:		 75MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 77MB (+2MB)
UNSAT
Iteration Time:	 0.12s

Iteration 9
Queue:		 [40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115]
Grounded Until:	 35
Grounding...	 [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time:	 0.06s
Memory:		 79MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.04s
Memory:		 80MB (+1MB)
UNSAT
Iteration Time:	 0.12s

Iteration 10
Queue:		 [45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120]
Grounded Until:	 40
Grounding...	 [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time:	 0.06s
Memory:		 82MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.25s
Memory:		 83MB (+1MB)
UNSAT
Iteration Time:	 0.34s

Iteration 11
Queue:		 [50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125]
Grounded Until:	 45
Grounding...	 [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time:	 0.05s
Memory:		 87MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","j","e")),1) occurs(action(("put-down","j")),2) occurs(action(("unstack","e","d")),3) occurs(action(("put-down","e")),4) occurs(action(("unstack","d","c")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","c","a")),7) occurs(action(("stack","c","e")),8) occurs(action(("unstack","a","l")),9) occurs(action(("stack","a","d")),10) occurs(action(("unstack","l","h")),11) occurs(action(("put-down","l")),12) occurs(action(("unstack","h","g")),13) occurs(action(("stack","h","l")),14) occurs(action(("unstack","g","m")),15) occurs(action(("stack","g","a")),16) occurs(action(("unstack","m","i")),17) occurs(action(("put-down","m")),18) occurs(action(("unstack","b","k")),19) occurs(action(("put-down","b")),20) occurs(action(("unstack","i","f")),21) occurs(action(("stack","i","b")),22) occurs(action(("unstack","h","l")),23) occurs(action(("stack","h","i")),24) occurs(action(("unstack","g","a")),25) occurs(action(("stack","g","h")),26) occurs(action(("pick-up","k")),27) occurs(action(("stack","k","g")),28) occurs(action(("pick-up","f")),29) occurs(action(("stack","f","k")),30) occurs(action(("pick-up","j")),31) occurs(action(("stack","j","f")),32) occurs(action(("unstack","c","e")),33) occurs(action(("stack","c","j")),34) occurs(action(("pick-up","m")),35) occurs(action(("stack","m","c")),36) occurs(action(("pick-up","l")),37) occurs(action(("stack","l","m")),38) occurs(action(("pick-up","e")),39) occurs(action(("stack","e","l")),40) occurs(action(("unstack","a","d")),41) occurs(action(("stack","a","e")),42) occurs(action(("pick-up","d")),43) occurs(action(("put-down","d")),44) occurs(action(("pick-up","d")),45) occurs(action(("put-down","d")),46) occurs(action(("unstack","a","e")),47) occurs(action(("stack","a","e")),48) occurs(action(("pick-up","d")),49) occurs(action(("stack","d","a")),50)
Solving Time:	 0.04s
Memory:		 89MB (+2MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 11
Time         : 1.287s (Solving: 0.34s 1st Model: 0.03s Unsat: 0.31s)
CPU Time     : 1.280s

Choices      : 3567    
Conflicts    : 1267     (Analyzed: 1260)
Restarts     : 15       (Average: 84.00 Last: 46)
Model-Level  : 70.0    
Problems     : 11       (Average Length: 27.00 Splits: 0)
Lemmas       : 1260     (Deleted: 0)
  Binary     : 112      (Ratio:   8.89%)
  Ternary    : 44       (Ratio:   3.49%)
  Conflict   : 1260     (Average Length:  425.3 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 1260     (Average:  4.56 Max: 195 Sum:   5746)
  Executed   : 1169     (Average:  2.81 Max: 195 Sum:   3538 Ratio:  61.57%)
  Bounded    : 91       (Average: 24.26 Max:  49 Sum:   2208 Ratio:  38.43%)

Rules        : 9885    
Atoms        : 9885    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 32822    (Eliminated:    0 Frozen: 26691)
Constraints  : 200778   (Binary:  93.1% Ternary:   4.1% Other:   2.9%)

Memory Peak  : 92MB
Max. Length  : 50 steps
Sol. Length  : 50 steps


