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-46.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-46.pddl
Parsing...
Parsing: [0.030s CPU, 0.033s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.013s wall-clock]
Preparing model... [0.020s CPU, 0.029s wall-clock]
Generated 18 rules.
Computing model... [0.100s CPU, 0.095s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.070s CPU, 0.073s wall-clock]
Instantiating: [0.220s CPU, 0.221s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.004s 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.000s 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.010s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.061s 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.040s CPU, 0.036s 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.010s CPU, 0.009s 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.030s CPU, 0.033s wall-clock]
Done! [0.400s CPU, 0.409s wall-clock]
planner.py version 0.0.1

Time:	 0.06s
Memory: 48MB

Iteration 1
Queue:		 [5]
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 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.01s
Memory:		 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 51MB (+1MB)
UNSAT
Iteration Time:	 0.02s

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

Iteration 4
Queue:		 [14]
Grounded Until:	 9
Grounding...	 [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time:	 0.02s
Memory:		 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.06s
Memory:		 54MB (+1MB)
UNSAT
Iteration Time:	 0.09s

Iteration 5
Queue:		 [19]
Grounded Until:	 14
Grounding...	 [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time:	 0.02s
Memory:		 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.68s
Memory:		 57MB (+2MB)
UNSAT
Iteration Time:	 0.71s

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.03s
Memory:		 59MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f10")),2) occurs(action(("board","f10","p6")),3) occurs(action(("up","f10","f13")),4) occurs(action(("board","f13","p2")),5) occurs(action(("down","f13","f3")),6) occurs(action(("board","f3","p0")),7) occurs(action(("board","f3","p7")),7) occurs(action(("down","f3","f2")),8) occurs(action(("board","f2","p5")),9) occurs(action(("up","f2","f17")),10) occurs(action(("board","f17","p1")),11) occurs(action(("down","f17","f15")),12) occurs(action(("depart","f15","p1")),13) occurs(action(("depart","f15","p2")),13) occurs(action(("down","f15","f6")),14) occurs(action(("depart","f6","p0")),15) occurs(action(("depart","f6","p7")),15) occurs(action(("depart","f6","p8")),15) occurs(action(("board","f6","p3")),15) occurs(action(("up","f6","f9")),16) occurs(action(("board","f9","p4")),17) occurs(action(("up","f9","f12")),18) occurs(action(("depart","f12","p3")),19) occurs(action(("board","f12","p9")),19) occurs(action(("down","f12","f7")),20) occurs(action(("depart","f7","p5")),21) occurs(action(("down","f7","f1")),22) occurs(action(("depart","f1","p4")),23) occurs(action(("up","f1","f16")),24) occurs(action(("depart","f16","p9")),25) occurs(action(("up","f16","f19")),26) occurs(action(("depart","f19","p6")),27)
Solving Time:	 0.86s
Memory:		 61MB (+2MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 6
Time         : 1.866s (Solving: 1.60s 1st Model: 0.86s Unsat: 0.74s)
CPU Time     : 1.860s

Choices      : 23829   
Conflicts    : 16311    (Analyzed: 16306)
Restarts     : 188      (Average: 86.73 Last: 84)
Model-Level  : 47.0    
Problems     : 6        (Average Length: 15.50 Splits: 0)
Lemmas       : 16306    (Deleted: 9339)
  Binary     : 140      (Ratio:   0.86%)
  Ternary    : 893      (Ratio:   5.48%)
  Conflict   : 16306    (Average Length:   13.0 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 16306    (Average:  1.37 Max:  32 Sum:  22322)
  Executed   : 16288    (Average:  1.36 Max:  32 Sum:  22229 Ratio:  99.58%)
  Bounded    : 18       (Average:  5.17 Max:  21 Sum:     93 Ratio:   0.42%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 13657    (Eliminated:    0 Frozen: 10366)
Constraints  : 67165    (Binary:  96.7% Ternary:   2.4% Other:   1.0%)

Memory Peak  : 61MB
Max. Length  : 27 steps
Sol. Length  : 27 steps


