INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-59.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/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-59.pddl
Parsing...
Parsing: [0.040s CPU, 0.032s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.030s CPU, 0.031s wall-clock]
Generated 18 rules.
Computing model... [0.110s CPU, 0.115s wall-clock]
1033 relevant atoms
684 auxiliary atoms
1717 final queue length
2246 total queue pushes
Completing instantiation... [0.100s CPU, 0.100s wall-clock]
Instantiating: [0.260s CPU, 0.269s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.006s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.011s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.005s wall-clock]
Translating task: [0.100s CPU, 0.100s wall-clock]
12 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.058s wall-clock]
Reordering and filtering variables...
25 of 25 variables necessary.
0 of 1 mutex groups necessary.
576 of 576 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.014s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 72
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 576
Translator axioms: 0
Translator task size: 1861
Translator peak memory: 37580 KB
Writing output... [0.050s CPU, 0.047s wall-clock]
Done! [0.540s CPU, 0.539s wall-clock]
planner.py version 0.0.1

Time:	 0.09s
Memory: 53MB

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

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.03s
Memory:		 57MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.48s
Memory:		 58MB (+1MB)
UNKNOWN
Iteration Time:	 0.51s

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.03s
Memory:		 61MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.54s
Memory:		 63MB (+2MB)
UNKNOWN
Iteration Time:	 0.59s

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.02s
Memory:		 64MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p11")),1) occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p9")),2) occurs(action(("down","f14","f12")),2) occurs(action(("depart","f12","p9")),3) occurs(action(("up","f12","f20")),3) occurs(action(("board","f20","p8")),4) occurs(action(("down","f20","f7")),4) occurs(action(("depart","f7","p8")),5) occurs(action(("board","f7","p5")),5) occurs(action(("up","f7","f16")),5) occurs(action(("board","f16","p10")),6) occurs(action(("board","f16","p6")),6) occurs(action(("down","f16","f6")),6) occurs(action(("depart","f6","p5")),7) occurs(action(("depart","f6","p6")),7) occurs(action(("board","f6","p1")),7) occurs(action(("up","f6","f10")),7) occurs(action(("board","f10","p7")),8) occurs(action(("up","f10","f19")),8) occurs(action(("depart","f19","p1")),9) occurs(action(("depart","f19","p7")),9) occurs(action(("down","f19","f3")),9) occurs(action(("board","f3","p2")),10) occurs(action(("board","f3","p4")),10) occurs(action(("up","f3","f8")),10) occurs(action(("depart","f8","p4")),11) occurs(action(("down","f8","f5")),11) occurs(action(("depart","f5","p10")),12) occurs(action(("board","f5","p3")),12) occurs(action(("down","f5","f0")),12) occurs(action(("depart","f0","p3")),13) occurs(action(("board","f0","p11")),13) occurs(action(("up","f0","f11")),13) occurs(action(("depart","f11","p11")),14) occurs(action(("up","f11","f12")),14) occurs(action(("depart","f12","p2")),15) occurs(action(("up","f12","f17")),15) occurs(action(("board","f17","p0")),16) occurs(action(("up","f17","f23")),16) occurs(action(("depart","f23","p0")),17) occurs(action(("down","f23","f1")),17) occurs(action(("up","f1","f4")),18) occurs(action(("down","f4","f3")),19) occurs(action(("board","f3","p2")),20) occurs(action(("board","f3","p4")),20)
Solving Time:	 0.00s
Memory:		 65MB (+1MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 5
Time         : 1.279s (Solving: 1.02s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 1.276s

Choices      : 34902    (Domain: 34876)
Conflicts    : 16163    (Analyzed: 16162)
Restarts     : 200      (Average: 80.81 Last: 152)
Model-Level  : 225.0   
Problems     : 5        (Average Length: 12.00 Splits: 0)
Lemmas       : 16162    (Deleted: 11311)
  Binary     : 1        (Ratio:   0.01%)
  Ternary    : 11       (Ratio:   0.07%)
  Conflict   : 16162    (Average Length:   26.3 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 16162    (Average:  1.87 Max:  22 Sum:  30211)
  Executed   : 16146    (Average:  1.87 Max:  22 Sum:  30195 Ratio:  99.95%)
  Bounded    : 16       (Average:  1.00 Max:   1 Sum:     16 Ratio:   0.05%)

Rules        : 6774    
Atoms        : 6774    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 13385    (Eliminated:    0 Frozen:  480)
Constraints  : 57513    (Binary:  97.2% Ternary:   1.9% Other:   0.9%)

Memory Peak  : 66MB
Max. Length  : 20 steps
Sol. Length  : 20 steps


