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-2.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-2.pddl
Parsing...
Parsing: [0.020s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 46 rules.
Computing model... [0.510s CPU, 0.508s wall-clock]
5240 relevant atoms
2298 auxiliary atoms
7538 final queue length
15595 total queue pushes
Completing instantiation... [1.350s CPU, 1.345s wall-clock]
Instantiating: [1.920s CPU, 1.911s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.010s CPU, 0.019s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.060s CPU, 0.065s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.064s wall-clock]
Translating task: [1.160s CPU, 1.159s wall-clock]
360 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
103 propositions removed
Detecting unreachable propositions: [0.540s CPU, 0.539s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
1 of 20 mutex groups necessary.
4140 of 4140 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.170s CPU, 0.171s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 424
Translator goal facts: 3
Translator mutex groups: 1
Translator total mutex groups size: 11
Translator operators: 4140
Translator axioms: 0
Translator task size: 24548
Translator peak memory: 49496 KB
Writing output... [0.390s CPU, 0.424s wall-clock]
Done! [4.320s CPU, 4.356s wall-clock]
planner.py version 0.0.1

Time:	 0.81s
Memory: 103MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.41s
Memory:		 111MB (+8MB)
Unblocking actions...
Solving...
Solving Time:	 0.04s
Memory:		 121MB (+10MB)
UNSAT
Iteration Time:	 0.63s

Iteration 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.20s
Memory:		 127MB (+6MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 128MB (+1MB)
UNSAT
Iteration Time:	 0.28s

Iteration 3
Queue:		 [9]
Grounded Until:	 7
Grounding...	 [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time:	 0.17s
Memory:		 128MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 131MB (+3MB)
UNSAT
Iteration Time:	 0.26s

Iteration 4
Queue:		 [14]
Grounded Until:	 9
Grounding...	 [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time:	 0.43s
Memory:		 139MB (+8MB)
Unblocking actions...
Solving...
Solving Time:	 0.04s
Memory:		 152MB (+13MB)
UNSAT
Iteration Time:	 0.70s

Iteration 5
Queue:		 [19]
Grounded Until:	 14
Grounding...	 [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time:	 0.52s
Memory:		 171MB (+19MB)
Unblocking actions...
Solving...
Solving Time:	 0.50s
Memory:		 187MB (+16MB)
UNSAT
Iteration Time:	 1.23s

Iteration 6
Queue:		 [27]
Grounded Until:	 19
Grounding...	 [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time:	 0.72s
Memory:		 221MB (+34MB)
Unblocking actions...
Solving...
Solving Time:	 15.69s
Memory:		 247MB (+26MB)
UNKNOWN
Iteration Time:	 16.74s

Iteration 7
Queue:		 [39, 27]
Grounded Until:	 27
Grounding...	 [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time:	 1.10s
Memory:		 299MB (+52MB)
Unblocking actions...
Solving...
Solving Time:	 17.05s
Memory:		 335MB (+36MB)
UNKNOWN
Iteration Time:	 18.64s

Iteration 8
Queue:		 [27, 55, 39]
Grounded Until:	 39
Blocking actions...
Solving...
Answer: 1
occurs(action(("pickup","node5-5","key4")),1) occurs(action(("move","node5-5","node4-5")),2) occurs(action(("move","node4-5","node3-5")),3) occurs(action(("unlock","node3-5","node3-4","key4","triangle")),4) occurs(action(("move","node3-5","node3-4")),5) occurs(action(("unlock","node3-4","node3-3","key4","triangle")),6) occurs(action(("unlock","node3-4","node4-4","key4","triangle")),6) occurs(action(("move","node3-4","node3-3")),7) occurs(action(("unlock","node3-3","node3-2","key4","triangle")),8) occurs(action(("unlock","node3-3","node4-3","key4","triangle")),8) occurs(action(("move","node3-3","node4-3")),9) occurs(action(("pickup-and-loose","node4-3","key8","key4")),10) occurs(action(("move","node4-3","node3-3")),11) occurs(action(("move","node3-3","node3-2")),12) occurs(action(("putdown","node3-2","key8")),13) occurs(action(("pickup","node3-2","key8")),14) occurs(action(("putdown","node3-2","key8")),15) occurs(action(("move","node3-2","node2-2")),16) occurs(action(("move","node2-2","node1-2")),17) occurs(action(("move","node1-2","node0-2")),18) occurs(action(("move","node0-2","node0-1")),19) occurs(action(("move","node0-1","node0-0")),20) occurs(action(("pickup","node0-0","key0")),21) occurs(action(("move","node0-0","node1-0")),22) occurs(action(("move","node1-0","node2-0")),23) occurs(action(("move","node2-0","node2-1")),24) occurs(action(("move","node2-1","node3-1")),25) occurs(action(("move","node3-1","node4-1")),26) occurs(action(("putdown","node4-1","key0")),27)
Solving Time:	 1.45s
Memory:		 335MB (+0MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 8
Time         : 40.841s (Solving: 34.58s 1st Model: 1.41s Unsat: 0.51s)
CPU Time     : 40.760s

Choices      : 827090  
Conflicts    : 20631    (Analyzed: 20629)
Restarts     : 214      (Average: 96.40 Last: 74)
Model-Level  : 250.0   
Problems     : 8        (Average Length: 21.88 Splits: 0)
Lemmas       : 20629    (Deleted: 12854)
  Binary     : 832      (Ratio:   4.03%)
  Ternary    : 565      (Ratio:   2.74%)
  Conflict   : 20629    (Average Length: 1454.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 20629    (Average: 32.38 Max: 8751 Sum: 667897)
  Executed   : 20352    (Average: 32.01 Max: 8751 Sum: 660248 Ratio:  98.85%)
  Bounded    : 277      (Average: 27.61 Max:  41 Sum:   7649 Ratio:   1.15%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 186845   (Eliminated:    0 Frozen: 161809)
Constraints  : 1463595  (Binary:  98.0% Ternary:   1.0% Other:   1.0%)

Memory Peak  : 335MB
Max. Length  : 39 steps
Sol. Length  : 27 steps


