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-57.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-57.pddl
Parsing...
Parsing: [0.040s CPU, 0.041s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
Preparing model... [0.030s CPU, 0.037s wall-clock]
Generated 18 rules.
Computing model... [0.120s CPU, 0.120s wall-clock]
1033 relevant atoms
684 auxiliary atoms
1717 final queue length
2246 total queue pushes
Completing instantiation... [0.090s CPU, 0.091s wall-clock]
Instantiating: [0.270s CPU, 0.274s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.005s 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.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.010s 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.010s CPU, 0.004s wall-clock]
Translating task: [0.100s CPU, 0.090s 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.050s CPU, 0.051s 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.013s 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: 34392 KB
Writing output... [0.050s CPU, 0.045s wall-clock]
Done! [0.530s CPU, 0.531s wall-clock]
planner.py version 0.0.1

Time:	 1.51s
Memory: 136MB

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.01s
Memory:		 136MB (+0MB)
UNSAT
Iteration Time:	 0.01s

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.06s
Memory:		 142MB (+6MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 143MB (+1MB)
UNSAT
Iteration Time:	 0.09s

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.06s
Memory:		 146MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.45s
Memory:		 148MB (+2MB)
UNSAT
Iteration Time:	 0.54s

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.06s
Memory:		 152MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.49s
Memory:		 154MB (+2MB)
UNKNOWN
Iteration Time:	 0.58s

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

Models       : 1+
Calls        : 5
Time         : 2.968s (Solving: 1.06s 1st Model: 0.13s Unsat: 0.45s)
CPU Time     : 2.970s

Choices      : 24236   
Conflicts    : 17108    (Analyzed: 17106)
Restarts     : 211      (Average: 81.07 Last: 95)
Model-Level  : 78.0    
Problems     : 5        (Average Length: 12.00 Splits: 0)
Lemmas       : 17106    (Deleted: 10155)
  Binary     : 161      (Ratio:   0.94%)
  Ternary    : 518      (Ratio:   3.03%)
  Conflict   : 17106    (Average Length:   17.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 17106    (Average:  1.25 Max:  22 Sum:  21433)
  Executed   : 17100    (Average:  1.25 Max:  22 Sum:  21427 Ratio:  99.97%)
  Bounded    : 6        (Average:  1.00 Max:   1 Sum:      6 Ratio:   0.03%)

Rules        : 909322  
Atoms        : 909322  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 19763    (Eliminated:    0 Frozen:    0)
Constraints  : 60096    (Binary:  96.6% Ternary:   2.5% Other:   0.8%)

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


