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.030s CPU, 0.031s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
Preparing model... [0.020s CPU, 0.025s wall-clock]
Generated 46 rules.
Computing model... [0.520s CPU, 0.512s 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.930s CPU, 1.922s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.010s CPU, 0.020s 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.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.060s CPU, 0.067s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.062s wall-clock]
Translating task: [1.160s CPU, 1.163s 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.542s 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.180s CPU, 0.172s 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: 49240 KB
Writing output... [0.390s CPU, 0.422s wall-clock]
Done! [4.340s CPU, 4.379s wall-clock]
planner.py version 0.0.1

Time:	 52.87s
Memory: 2099MB

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.27s
Memory:		 2099MB (+0MB)
UNSAT
Iteration Time:	 0.27s

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.67s
Memory:		 2134MB (+35MB)
Unblocking actions...
Solving...
Solving Time:	 0.07s
Memory:		 2149MB (+15MB)
UNSAT
Iteration Time:	 1.31s

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.59s
Memory:		 2158MB (+9MB)
Unblocking actions...
Solving...
Solving Time:	 0.07s
Memory:		 2176MB (+18MB)
UNSAT
Iteration Time:	 1.25s

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.62s
Memory:		 2183MB (+7MB)
Unblocking actions...
Solving...
Solving Time:	 0.10s
Memory:		 2209MB (+26MB)
UNSAT
Iteration Time:	 1.26s

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.63s
Memory:		 2220MB (+11MB)
Unblocking actions...
Solving...
Solving Time:	 1.50s
Memory:		 2262MB (+42MB)
UNSAT
Iteration Time:	 2.67s

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.62s
Memory:		 2265MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("move","node5-5","node5-4")),1) occurs(action(("pickup","node5-5","key4")),1) occurs(action(("unlock","node5-4","node5-3","key4","triangle")),2) occurs(action(("move","node5-4","node5-3")),3) occurs(action(("unlock","node5-4","node4-4","key4","triangle")),3) occurs(action(("unlock","node5-3","node4-3","key4","triangle")),4) occurs(action(("unlock","node5-3","node5-2","key4","triangle")),4) occurs(action(("move","node5-3","node5-2")),5) occurs(action(("move","node5-2","node5-1")),6) occurs(action(("move","node5-1","node4-1")),7) occurs(action(("move","node4-1","node3-1")),8) occurs(action(("unlock","node4-1","node4-2","key4","triangle")),8) occurs(action(("unlock","node3-1","node3-2","key4","triangle")),9) occurs(action(("move","node3-1","node2-1")),9) occurs(action(("putdown","node3-1","key4")),9) occurs(action(("move","node2-1","node1-1")),10) occurs(action(("move","node1-1","node0-1")),11) occurs(action(("move","node0-1","node0-0")),12) occurs(action(("pickup","node0-0","key0")),13) occurs(action(("move","node0-0","node1-0")),13) occurs(action(("move","node1-0","node1-1")),14) occurs(action(("move","node1-1","node2-1")),15) occurs(action(("move","node2-1","node2-2")),16) occurs(action(("move","node2-2","node3-2")),17) occurs(action(("move","node3-2","node4-2")),18) occurs(action(("putdown","node4-2","key0")),19) occurs(action(("move","node4-2","node4-3")),19) occurs(action(("pickup","node4-3","key8")),20) occurs(action(("move","node4-3","node4-2")),20) occurs(action(("putdown","node4-2","key8")),21) occurs(action(("pickup","node4-2","key0")),22) occurs(action(("move","node4-2","node4-1")),22) occurs(action(("putdown","node4-1","key0")),23) occurs(action(("move","node4-1","node4-2")),23) occurs(action(("pickup","node4-2","key8")),24) occurs(action(("move","node4-2","node3-2")),24) occurs(action(("putdown","node3-2","key8")),25)
Solving Time:	 1.34s
Memory:		 2323MB (+58MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 6
Time         : 62.168s (Solving: 2.75s 1st Model: 1.27s Unsat: 1.47s)
CPU Time     : 62.140s

Choices      : 120048  
Conflicts    : 5212     (Analyzed: 5210)
Restarts     : 54       (Average: 96.48 Last: 136)
Model-Level  : 361.0   
Problems     : 6        (Average Length: 14.50 Splits: 0)
Lemmas       : 5210     (Deleted: 2511)
  Binary     : 435      (Ratio:   8.35%)
  Ternary    : 259      (Ratio:   4.97%)
  Conflict   : 5210     (Average Length:  556.2 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 5210     (Average: 21.63 Max: 5365 Sum: 112690)
  Executed   : 5136     (Average: 21.37 Max: 5365 Sum: 111336 Ratio:  98.80%)
  Bounded    : 74       (Average: 18.30 Max:  27 Sum:   1354 Ratio:   1.20%)

Rules        : 24997890
Atoms        : 24997890
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 115048   (Eliminated:    0 Frozen: 100928)
Constraints  : 595734   (Binary:  97.5% Ternary:   1.2% Other:   1.3%)

Memory Peak  : 2323MB
Max. Length  : 25 steps
Sol. Length  : 25 steps


