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-50.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-50.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.076s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.060s CPU, 0.066s wall-clock]
Instantiating: [0.180s CPU, 0.182s 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.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.060s 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.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.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.020s CPU, 0.031s wall-clock]
Done! [0.350s CPU, 0.358s 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.02s
Memory:		 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.12s
Memory:		 54MB (+1MB)
UNSAT
Iteration Time:	 0.15s

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 (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.49s
Memory:		 56MB (+0MB)
UNKNOWN
Iteration Time:	 0.52s

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 (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.56s
Memory:		 60MB (+2MB)
UNKNOWN
Iteration Time:	 0.59s

Iteration 7
Queue:		 [(6,30,0,True)]
Grounded Until:	 25
Grounding...	 [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time:	 0.02s
Memory:		 60MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.62s
Memory:		 61MB (+1MB)
UNKNOWN
Iteration Time:	 0.65s

Iteration 8
Queue:		 [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until:	 30
Blocking actions...
Solving...
Solving Time:	 0.45s
Memory:		 61MB (+0MB)
UNKNOWN
Iteration Time:	 0.45s

Iteration 9
Queue:		 [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until:	 30
Unblocking actions...
Solving...
Solving Time:	 0.65s
Memory:		 61MB (+0MB)
UNKNOWN
Iteration Time:	 0.65s

Iteration 10
Queue:		 [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until:	 30
Unblocking actions...
Solving...
Solving Time:	 0.61s
Memory:		 61MB (+0MB)
UNKNOWN
Iteration Time:	 0.61s

Iteration 11
Queue:		 [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until:	 30
Grounding...	 [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time:	 0.02s
Memory:		 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.70s
Memory:		 65MB (+2MB)
UNKNOWN
Iteration Time:	 0.73s

Iteration 12
Queue:		 [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until:	 35
Grounding...	 [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time:	 0.02s
Memory:		 66MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f15")),2) occurs(action(("board","f15","p0")),3) occurs(action(("down","f15","f10")),4) occurs(action(("board","f10","p5")),5) occurs(action(("down","f10","f9")),6) occurs(action(("board","f9","p4")),7) occurs(action(("depart","f9","p5")),8) occurs(action(("up","f9","f18")),9) occurs(action(("board","f18","p7")),10) occurs(action(("down","f18","f13")),11) occurs(action(("depart","f13","p8")),12) occurs(action(("depart","f13","p7")),13) occurs(action(("down","f13","f2")),14) occurs(action(("board","f2","p2")),15) occurs(action(("board","f2","p6")),16) occurs(action(("board","f2","p1")),17) occurs(action(("up","f2","f7")),18) occurs(action(("board","f7","p3")),19) occurs(action(("down","f7","f5")),20) occurs(action(("depart","f5","p3")),21) occurs(action(("down","f5","f4")),22) occurs(action(("depart","f4","p4")),23) occurs(action(("up","f4","f7")),24) occurs(action(("down","f7","f0")),25) occurs(action(("depart","f0","p1")),26) occurs(action(("up","f0","f18")),27) occurs(action(("depart","f18","p2")),28) occurs(action(("down","f18","f11")),29) occurs(action(("depart","f11","p0")),30) occurs(action(("down","f11","f3")),31) occurs(action(("board","f3","p9")),32) occurs(action(("up","f3","f9")),33) occurs(action(("depart","f9","p9")),34) occurs(action(("down","f9","f3")),35) occurs(action(("board","f3","p9")),36) occurs(action(("up","f3","f9")),37) occurs(action(("down","f9","f3")),38) occurs(action(("up","f3","f19")),39) occurs(action(("depart","f19","p6")),40)
Solving Time:	 0.14s
Memory:		 67MB (+1MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 12
Time         : 4.693s (Solving: 4.32s 1st Model: 0.13s Unsat: 0.13s)
CPU Time     : 4.690s

Choices      : 111963  
Conflicts    : 64918    (Analyzed: 64915)
Restarts     : 746      (Average: 87.02 Last: 94)
Model-Level  : 86.0    
Problems     : 12       (Average Length: 24.50 Splits: 0)
Lemmas       : 64915    (Deleted: 44613)
  Binary     : 2461     (Ratio:   3.79%)
  Ternary    : 3916     (Ratio:   6.03%)
  Conflict   : 64915    (Average Length:   15.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 64915    (Average:  1.55 Max: 109 Sum: 100308)
  Executed   : 64902    (Average:  1.54 Max: 109 Sum: 100141 Ratio:  99.83%)
  Bounded    : 13       (Average: 12.85 Max:  37 Sum:    167 Ratio:   0.17%)

Rules        : 4766    
Atoms        : 4766    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 19709    (Eliminated:    0 Frozen: 16420)
Constraints  : 82778    (Binary:  96.6% Ternary:   2.3% Other:   1.1%)

Memory Peak  : 68MB
Max. Length  : 40 steps
Sol. Length  : 40 steps


