INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 46 rules.
Computing model... [0.320s CPU, 0.312s wall-clock]
3114 relevant atoms
1522 auxiliary atoms
4636 final queue length
9238 total queue pushes
Completing instantiation... [0.780s CPU, 0.788s wall-clock]
Instantiating: [1.150s CPU, 1.153s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.010s CPU, 0.015s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.010s CPU, 0.007s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.003s 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.001s 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.040s CPU, 0.036s wall-clock]
Translating task: [0.640s CPU, 0.635s wall-clock]
225 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
69 propositions removed
Detecting unreachable propositions: [0.310s CPU, 0.311s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
1 of 19 mutex groups necessary.
2384 of 2384 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.099s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 277
Translator goal facts: 1
Translator mutex groups: 1
Translator total mutex groups size: 10
Translator operators: 2384
Translator axioms: 0
Translator task size: 14119
Translator peak memory: 42584 KB
Writing output... [0.220s CPU, 0.244s wall-clock]
Done! [2.520s CPU, 2.551s wall-clock]
planner.py version 0.0.1

Time:	 0.48s
Memory: 78MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.23s
Memory:		 84MB (+6MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 90MB (+6MB)
UNSAT
Iteration Time:	 0.34s

Iteration 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.09s
Memory:		 90MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 91MB (+1MB)
UNSAT
Iteration Time:	 0.13s

Iteration 3
Queue:		 [9]
Grounded Until:	 7
Grounding...	 [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time:	 0.09s
Memory:		 91MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 93MB (+2MB)
UNSAT
Iteration Time:	 0.14s

Iteration 4
Queue:		 [14]
Grounded Until:	 9
Grounding...	 [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time:	 0.24s
Memory:		 100MB (+7MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("move","node2-4","node1-4")),1) occurs(action(("move","node1-4","node0-4")),2) occurs(action(("move","node0-4","node0-3")),3) occurs(action(("move","node0-3","node0-2")),4) occurs(action(("pickup","node0-2","key3")),5) occurs(action(("move","node0-2","node0-3")),6) occurs(action(("move","node0-3","node1-3")),7) occurs(action(("unlock","node1-3","node2-3","key3","square")),8) occurs(action(("move","node1-3","node2-3")),9) occurs(action(("pickup-and-loose","node2-3","key0","key3")),10) occurs(action(("move","node2-3","node1-3")),11) occurs(action(("move","node1-3","node1-2")),12) occurs(action(("move","node1-2","node1-1")),13) occurs(action(("putdown","node1-1","key0")),14)
Solving Time:	 0.07s
Memory:		 106MB (+6MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 1.569s (Solving: 0.06s 1st Model: 0.06s Unsat: 0.00s)
CPU Time     : 1.500s

Choices      : 319     
Conflicts    : 159      (Analyzed: 158)
Restarts     : 2        (Average: 79.00 Last: 18)
Model-Level  : 23.0    
Problems     : 4        (Average Length: 10.75 Splits: 0)
Lemmas       : 158      (Deleted: 0)
  Binary     : 29       (Ratio:  18.35%)
  Ternary    : 5        (Ratio:   3.16%)
  Conflict   : 158      (Average Length:  342.4 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 158      (Average:  2.81 Max:  27 Sum:    444)
  Executed   : 147      (Average:  1.92 Max:  27 Sum:    304 Ratio:  68.47%)
  Bounded    : 11       (Average: 12.73 Max:  16 Sum:    140 Ratio:  31.53%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 35682    (Eliminated:    0 Frozen: 27357)
Constraints  : 138870   (Binary:  97.2% Ternary:   1.4% Other:   1.4%)

Memory Peak  : 107MB
Max. Length  : 14 steps
Sol. Length  : 14 steps