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-43.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-43.pddl
Parsing...
Parsing: [0.030s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.019s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.068s wall-clock]
613 relevant atoms
405 auxiliary atoms
1018 final queue length
1307 total queue pushes
Completing instantiation... [0.060s CPU, 0.054s wall-clock]
Instantiating: [0.160s CPU, 0.160s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.005s wall-clock]
Checking invariant weight... [0.010s 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...
18 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.050s CPU, 0.048s wall-clock]
9 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.031s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 1 mutex groups necessary.
324 of 324 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 54
Translator goal facts: 9
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 324
Translator axioms: 0
Translator task size: 1072
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.025s wall-clock]
Done! [0.310s CPU, 0.308s wall-clock]
planner.py version 0.0.1

Time:	 0.06s
Memory: 47MB

Iteration 1
Queue:		 [0]
Grounded Until:	 0
Solving...
Solving Time:	 0.00s
Memory:		 47MB (+0MB)
UNSAT
Iteration Time:	 0.00s

Iteration 2
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.03s
Memory:		 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 49MB (+1MB)
UNSAT
Iteration Time:	 0.04s

Iteration 3
Queue:		 [10]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.03s
Memory:		 51MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 51MB (+0MB)
UNSAT
Iteration Time:	 0.04s

Iteration 4
Queue:		 [15]
Grounded Until:	 10
Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time:	 0.02s
Memory:		 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.13s
Memory:		 53MB (+1MB)
UNSAT
Iteration Time:	 0.16s

Iteration 5
Queue:		 [20]
Grounded Until:	 15
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time:	 0.02s
Memory:		 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.72s
Memory:		 55MB (+1MB)
UNKNOWN
Iteration Time:	 0.75s

Iteration 6
Queue:		 [20]
Grounded Until:	 20
Solving...
Solving Time:	 0.58s
Memory:		 55MB (+0MB)
UNKNOWN
Iteration Time:	 0.58s

Iteration 7
Queue:		 [20]
Grounded Until:	 20
Solving...
Solving Time:	 0.01s
Memory:		 55MB (+0MB)
UNSAT
Iteration Time:	 0.01s

Iteration 8
Queue:		 [25]
Grounded Until:	 20
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time:	 0.02s
Memory:		 57MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p3")),2) occurs(action(("up","f2","f14")),3) occurs(action(("depart","f14","p3")),4) occurs(action(("up","f14","f16")),5) occurs(action(("board","f16","p1")),6) occurs(action(("down","f16","f0")),7) occurs(action(("depart","f0","p1")),8) occurs(action(("board","f0","p7")),8) occurs(action(("up","f0","f13")),9) occurs(action(("board","f13","p0")),10) occurs(action(("board","f13","p6")),10) occurs(action(("down","f13","f7")),11) occurs(action(("board","f7","p4")),12) occurs(action(("down","f7","f1")),13) occurs(action(("board","f1","p8")),14) occurs(action(("up","f1","f3")),15) occurs(action(("depart","f3","p4")),16) occurs(action(("board","f3","p2")),16) occurs(action(("up","f3","f8")),17) occurs(action(("up","f8","f9")),18) occurs(action(("depart","f9","p8")),19) occurs(action(("up","f9","f12")),20) occurs(action(("depart","f12","p0")),21) occurs(action(("depart","f12","p2")),21) occurs(action(("depart","f12","p7")),21) occurs(action(("down","f12","f8")),22) occurs(action(("depart","f8","p6")),23) occurs(action(("board","f8","p5")),23) occurs(action(("down","f8","f5")),24) occurs(action(("depart","f5","p5")),25)
Solving Time:	 0.04s
Memory:		 58MB (+1MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 8
Time         : 1.717s (Solving: 1.49s 1st Model: 0.04s Unsat: 0.15s)
CPU Time     : 1.710s

Choices      : 26917   
Conflicts    : 19141    (Analyzed: 19137)
Restarts     : 227      (Average: 84.30 Last: 111)
Model-Level  : 46.0    
Problems     : 8        (Average Length: 16.38 Splits: 0)
Lemmas       : 19137    (Deleted: 10841)
  Binary     : 282      (Ratio:   1.47%)
  Ternary    : 1085     (Ratio:   5.67%)
  Conflict   : 19137    (Average Length:   13.3 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 19137    (Average:  1.35 Max:  46 Sum:  25880)
  Executed   : 19114    (Average:  1.35 Max:  46 Sum:  25744 Ratio:  99.47%)
  Bounded    : 23       (Average:  5.91 Max:  22 Sum:    136 Ratio:   0.53%)

Rules        : 4209    
Atoms        : 4209    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 10355    (Eliminated:    0 Frozen: 7836)
Constraints  : 50133    (Binary:  96.4% Ternary:   2.5% Other:   1.1%)

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


