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-47.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-47.pddl
Parsing...
Parsing: [0.020s CPU, 0.021s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.072s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.070s CPU, 0.065s wall-clock]
Instantiating: [0.170s CPU, 0.173s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.005s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
20 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.009s 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.003s wall-clock]
Translating task: [0.060s CPU, 0.059s wall-clock]
10 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.038s wall-clock]
Reordering and filtering variables...
21 of 21 variables necessary.
0 of 1 mutex groups necessary.
400 of 400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.010s wall-clock]
Translator variables: 21
Translator derived variables: 0
Translator facts: 60
Translator goal facts: 10
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 400
Translator axioms: 0
Translator task size: 1311
Translator peak memory: 33880 KB
Writing output... [0.020s CPU, 0.031s wall-clock]
Done! [0.340s CPU, 0.346s wall-clock]
planner.py version 0.0.1

Time:	 0.07s
Memory: 48MB

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:		 48MB (+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:		 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 50MB (+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:		 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 52MB (+1MB)
UNSAT
Iteration Time:	 0.05s

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:		 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.08s
Memory:		 55MB (+2MB)
UNSAT
Iteration Time:	 0.12s

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:		 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.72s
Memory:		 57MB (+1MB)
UNKNOWN
Iteration Time:	 0.76s

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.02s
Memory:		 58MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p0")),1) occurs(action(("board","f0","p5")),1) occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f5")),2) occurs(action(("board","f5","p3")),3) occurs(action(("up","f5","f18")),4) occurs(action(("depart","f18","p8")),5) occurs(action(("down","f18","f10")),6) occurs(action(("depart","f10","p3")),7) occurs(action(("board","f10","p7")),7) occurs(action(("board","f10","p9")),7) occurs(action(("up","f10","f19")),8) occurs(action(("board","f19","p1")),9) occurs(action(("down","f19","f1")),10) occurs(action(("depart","f1","p0")),11) occurs(action(("depart","f1","p7")),11) occurs(action(("board","f1","p4")),11) occurs(action(("up","f1","f4")),12) occurs(action(("depart","f4","p1")),13) occurs(action(("up","f4","f11")),14) occurs(action(("depart","f11","p4")),15) occurs(action(("up","f11","f16")),16) occurs(action(("board","f16","p2")),17) occurs(action(("down","f16","f3")),18) occurs(action(("depart","f3","p2")),19) occurs(action(("depart","f3","p9")),19) occurs(action(("up","f3","f8")),20) occurs(action(("depart","f8","p5")),21) occurs(action(("up","f8","f17")),22) occurs(action(("board","f17","p6")),23) occurs(action(("down","f17","f7")),24) occurs(action(("depart","f7","p6")),25)
Solving Time:	 0.45s
Memory:		 60MB (+2MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 6
Time         : 1.523s (Solving: 1.26s 1st Model: 0.45s Unsat: 0.09s)
CPU Time     : 1.530s

Choices      : 21007   
Conflicts    : 13706    (Analyzed: 13703)
Restarts     : 164      (Average: 83.55 Last: 72)
Model-Level  : 49.0    
Problems     : 6        (Average Length: 14.50 Splits: 0)
Lemmas       : 13703    (Deleted: 9452)
  Binary     : 184      (Ratio:   1.34%)
  Ternary    : 773      (Ratio:   5.64%)
  Conflict   : 13703    (Average Length:   11.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 13703    (Average:  1.45 Max:  85 Sum:  19887)
  Executed   : 13685    (Average:  1.44 Max:  85 Sum:  19699 Ratio:  99.05%)
  Bounded    : 18       (Average: 10.44 Max:  27 Sum:    188 Ratio:   0.95%)

Rules        : 5156    
Atoms        : 5156    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 12455    (Eliminated:    0 Frozen: 9664)
Constraints  : 61500    (Binary:  96.8% Ternary:   2.2% Other:   1.0%)

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


