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-30.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-30.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.009s wall-clock]
Generated 18 rules.
Computing model... [0.040s CPU, 0.033s wall-clock]
301 relevant atoms
198 auxiliary atoms
499 final queue length
620 total queue pushes
Completing instantiation... [0.020s CPU, 0.026s wall-clock]
Instantiating: [0.080s CPU, 0.083s 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.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
12 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.008s 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.001s wall-clock]
Translating task: [0.030s CPU, 0.026s wall-clock]
6 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.016s wall-clock]
Reordering and filtering variables...
13 of 13 variables necessary.
0 of 1 mutex groups necessary.
144 of 144 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 36
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 144
Translator axioms: 0
Translator task size: 499
Translator peak memory: 36300 KB
Writing output... [0.010s CPU, 0.014s wall-clock]
Done! [0.160s CPU, 0.168s wall-clock]
planner.py version 0.0.1

Time:	 0.02s
Memory: 50MB

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

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.01s
Memory:		 52MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p1")),2) occurs(action(("board","f2","p5")),2) occurs(action(("down","f2","f1")),2) occurs(action(("depart","f1","p5")),3) occurs(action(("up","f1","f11")),3) occurs(action(("board","f11","p3")),4) occurs(action(("down","f11","f9")),4) occurs(action(("depart","f9","p3")),5) occurs(action(("board","f9","p4")),5) occurs(action(("down","f9","f8")),5) occurs(action(("depart","f8","p4")),6) occurs(action(("down","f8","f3")),6) occurs(action(("board","f3","p0")),7) occurs(action(("up","f3","f6")),7) occurs(action(("depart","f6","p0")),8) occurs(action(("board","f6","p2")),8) occurs(action(("up","f6","f10")),8) occurs(action(("depart","f10","p2")),9) occurs(action(("down","f10","f0")),9) occurs(action(("depart","f0","p1")),10) occurs(action(("up","f0","f3")),10)
Solving Time:	 0.00s
Memory:		 52MB (+0MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 0.054s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.048s

Choices      : 162      (Domain: 151)
Conflicts    : 74       (Analyzed: 73)
Restarts     : 0       
Model-Level  : 42.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 73       (Deleted: 0)
  Binary     : 0        (Ratio:   0.00%)
  Ternary    : 1        (Ratio:   1.37%)
  Conflict   : 73       (Average Length:    9.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 73       (Average:  1.82 Max:   5 Sum:    133)
  Executed   : 72       (Average:  1.81 Max:   5 Sum:    132 Ratio:  99.25%)
  Bounded    : 1        (Average:  1.00 Max:   1 Sum:      1 Ratio:   0.75%)

Rules        : 1806    
Atoms        : 1806    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 1915     (Eliminated:    0 Frozen:  120)
Constraints  : 7146     (Binary:  94.6% Ternary:   3.4% Other:   1.9%)

Memory Peak  : 52MB
Max. Length  : 10 steps
Sol. Length  : 10 steps


