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-11.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-11.pddl
Parsing...
Parsing: [0.010s CPU, 0.088s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.040s CPU, 0.042s wall-clock]
205 relevant atoms
133 auxiliary atoms
338 final queue length
550 total queue pushes
Completing instantiation... [0.050s CPU, 0.053s wall-clock]
Instantiating: [0.120s CPU, 0.120s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.033s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.003s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
8 uncovered facts
Choosing groups: [0.010s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.050s CPU, 0.048s 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.002s 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.040s CPU, 0.044s wall-clock]
140 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.025s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
8 of 15 mutex groups necessary.
98 of 98 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.012s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 72
Translator goal facts: 6
Translator mutex groups: 8
Translator total mutex groups size: 64
Translator operators: 98
Translator axioms: 0
Translator task size: 871
Translator peak memory: 36556 KB
Writing output... [0.020s CPU, 0.017s wall-clock]
Done! [0.280s CPU, 0.362s wall-clock]
planner.py version 0.0.1

Time:	 0.03s
Memory: 50MB

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:		 51MB (+1MB)
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.01s
Memory:		 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 52MB (+0MB)
UNSAT
Iteration Time:	 0.02s

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.01s
Memory:		 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 53MB (+1MB)
UNSAT
Iteration Time:	 0.02s

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:		 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 54MB (+0MB)
UNSAT
Iteration Time:	 0.02s

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.01s
Memory:		 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 55MB (+0MB)
UNSAT
Iteration Time:	 0.02s

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:		 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 56MB (+0MB)
UNSAT
Iteration Time:	 0.03s

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

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

Choices      : 1908     (Domain: 1908)
Conflicts    : 216      (Analyzed: 212)
Restarts     : 2        (Average: 106.00 Last: 33)
Model-Level  : 78.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 212      (Deleted: 0)
  Binary     : 11       (Ratio:   5.19%)
  Ternary    : 2        (Ratio:   0.94%)
  Conflict   : 212      (Average Length:   63.9 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 212      (Average:  9.22 Max: 120 Sum:   1954)
  Executed   : 204      (Average:  8.78 Max: 120 Sum:   1862 Ratio:  95.29%)
  Bounded    : 8        (Average: 11.50 Max:  26 Sum:     92 Ratio:   4.71%)

Rules        : 2699    
Atoms        : 2699    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 6173     (Eliminated:    0 Frozen: 1891)
Constraints  : 33233    (Binary:  90.5% Ternary:   5.7% Other:   3.8%)

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


