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-36.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-36.pddl
Parsing...
Parsing: [0.010s CPU, 0.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 18 rules.
Computing model... [0.050s CPU, 0.051s wall-clock]
497 relevant atoms
328 auxiliary atoms
825 final queue length
1050 total queue pushes
Completing instantiation... [0.040s CPU, 0.042s wall-clock]
Instantiating: [0.120s CPU, 0.123s 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...
16 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s 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.002s wall-clock]
Translating task: [0.040s CPU, 0.040s wall-clock]
8 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.024s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
0 of 1 mutex groups necessary.
256 of 256 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.006s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 48
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 256
Translator axioms: 0
Translator task size: 857
Translator peak memory: 33624 KB
Writing output... [0.010s CPU, 0.021s wall-clock]
Done! [0.230s CPU, 0.244s wall-clock]
planner.py version 0.0.1

Time:	 0.05s
Memory: 47MB

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:		 47MB (+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.02s
Memory:		 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 48MB (+0MB)
UNSAT
Iteration Time:	 0.03s

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.02s
Memory:		 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 50MB (+1MB)
UNSAT
Iteration Time:	 0.04s

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:		 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.14s
Memory:		 52MB (+2MB)
UNSAT
Iteration Time:	 0.17s

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.01s
Memory:		 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.36s
Memory:		 53MB (+1MB)
UNKNOWN
Iteration Time:	 0.38s

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.01s
Memory:		 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.43s
Memory:		 55MB (+1MB)
UNKNOWN
Iteration Time:	 0.45s

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

Models       : 1+
Calls        : 7
Time         : 1.372s (Solving: 1.17s 1st Model: 0.23s Unsat: 0.16s)
CPU Time     : 1.370s

Choices      : 44220   
Conflicts    : 25750    (Analyzed: 25747)
Restarts     : 291      (Average: 88.48 Last: 130)
Model-Level  : 61.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 25747    (Deleted: 15448)
  Binary     : 1471     (Ratio:   5.71%)
  Ternary    : 2340     (Ratio:   9.09%)
  Conflict   : 25747    (Average Length:   13.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 25747    (Average:  1.57 Max:  50 Sum:  40525)
  Executed   : 25728    (Average:  1.57 Max:  50 Sum:  40388 Ratio:  99.66%)
  Bounded    : 19       (Average:  7.21 Max:  27 Sum:    137 Ratio:   0.34%)

Rules        : 3110    
Atoms        : 3110    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 9903     (Eliminated:    0 Frozen: 7919)
Constraints  : 39949    (Binary:  95.8% Ternary:   2.8% Other:   1.5%)

Memory Peak  : 57MB
Max. Length  : 30 steps
Sol. Length  : 30 steps


