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.010s CPU, 0.020s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 18 rules.
Computing model... [0.060s CPU, 0.067s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.080s CPU, 0.067s wall-clock]
Instantiating: [0.170s CPU, 0.167s 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.010s 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.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.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.000s 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.031s wall-clock]
Done! [0.340s CPU, 0.340s 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.05s

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.03s
Memory:		 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.10s
Memory:		 55MB (+2MB)
UNSAT
Iteration Time:	 0.14s

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.03s
Memory:		 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.82s
Memory:		 57MB (+1MB)
UNKNOWN
Iteration Time:	 0.85s

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

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

Models       : 1+
Calls        : 7
Time         : 2.262s (Solving: 1.95s 1st Model: 0.18s Unsat: 0.11s)
CPU Time     : 2.260s

Choices      : 28929   
Conflicts    : 19722    (Analyzed: 19719)
Restarts     : 232      (Average: 85.00 Last: 67)
Model-Level  : 61.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 19719    (Deleted: 10412)
  Binary     : 253      (Ratio:   1.28%)
  Ternary    : 1219     (Ratio:   6.18%)
  Conflict   : 19719    (Average Length:   14.3 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 19719    (Average:  1.36 Max:  58 Sum:  26863)
  Executed   : 19700    (Average:  1.35 Max:  58 Sum:  26694 Ratio:  99.37%)
  Bounded    : 19       (Average:  8.89 Max:  22 Sum:    169 Ratio:   0.63%)

Rules        : 5156    
Atoms        : 5156    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 15027    (Eliminated:    0 Frozen: 11669)
Constraints  : 74264    (Binary:  96.8% Ternary:   2.2% Other:   1.0%)

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


