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-49.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-49.pddl
Parsing...
Parsing: [0.020s CPU, 0.028s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.081s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.070s CPU, 0.066s wall-clock]
Instantiating: [0.190s CPU, 0.191s 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.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.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.062s 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.036s 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.030s CPU, 0.031s wall-clock]
Done! [0.360s CPU, 0.372s wall-clock]
planner.py version 0.0.1

Time:	 0.56s
Memory: 82MB

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:		 82MB (+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.28s
Memory:		 115MB (+33MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 117MB (+2MB)
UNSAT
Iteration Time:	 0.34s

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.21s
Memory:		 131MB (+14MB)
Unblocking actions...
Solving...
Solving Time:	 1.70s
Memory:		 134MB (+3MB)
UNKNOWN
Iteration Time:	 1.95s

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.21s
Memory:		 146MB (+12MB)
Unblocking actions...
Solving...
Solving Time:	 2.28s
Memory:		 150MB (+4MB)
UNKNOWN
Iteration Time:	 2.54s

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.22s
Memory:		 162MB (+12MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f2","p7")),1) occurs(action(("up","f0","f2")),1) occurs(action(("up","f2","f15")),2) occurs(action(("down","f15","f10")),3) occurs(action(("board","f11","p4")),4) occurs(action(("board","f11","p5")),4) occurs(action(("board","f10","p9")),4) occurs(action(("up","f10","f11")),4) occurs(action(("board","f11","p4")),5) occurs(action(("board","f11","p5")),5) occurs(action(("board","f8","p8")),5) occurs(action(("down","f11","f8")),5) occurs(action(("depart","f14","p5")),6) occurs(action(("depart","f8","p9")),6) occurs(action(("up","f8","f14")),6) occurs(action(("board","f8","p8")),6) occurs(action(("down","f14","f3")),7) occurs(action(("depart","f3","p8")),8) occurs(action(("board","f10","p9")),8) occurs(action(("up","f3","f10")),8) occurs(action(("board","f10","p9")),9) occurs(action(("up","f10","f13")),9) occurs(action(("board","f13","p0")),10) occurs(action(("board","f4","p6")),10) occurs(action(("down","f13","f4")),10) occurs(action(("board","f4","p6")),11) occurs(action(("board","f4","p6")),12) occurs(action(("depart","f7","p7")),13) occurs(action(("board","f4","p6")),13) occurs(action(("up","f4","f7")),13) occurs(action(("up","f7","f12")),14) occurs(action(("board","f5","p3")),15) occurs(action(("down","f12","f5")),15) occurs(action(("depart","f12","p4")),16) occurs(action(("board","f5","p3")),16) occurs(action(("up","f5","f12")),16) occurs(action(("down","f12","f6")),17) occurs(action(("depart","f6","p6")),18) occurs(action(("board","f6","p1")),18) occurs(action(("up","f6","f19")),18) occurs(action(("board","f19","p2")),18) occurs(action(("depart","f19","p1")),19) occurs(action(("depart","f8","p2")),19) occurs(action(("depart","f8","p3")),19) occurs(action(("depart","f8","p9")),19) occurs(action(("board","f8","p8")),19) occurs(action(("down","f19","f8")),19) occurs(action(("depart","f15","p0")),20) occurs(action(("up","f8","f15")),20)
Solving Time:	 0.15s
Memory:		 167MB (+5MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 5
Time         : 5.817s (Solving: 4.09s 1st Model: 0.13s Unsat: 0.02s)
CPU Time     : 5.810s

Choices      : 22440   
Conflicts    : 16775    (Analyzed: 16774)
Restarts     : 206      (Average: 81.43 Last: 67)
Model-Level  : 80.0    
Problems     : 5        (Average Length: 12.00 Splits: 0)
Lemmas       : 16830    (Deleted: 11654)
  Binary     : 165      (Ratio:   0.98%)
  Ternary    : 99       (Ratio:   0.59%)
  Conflict   : 16774    (Average Length:   85.2 Ratio:  99.67%) 
  Loop       : 56       (Average Length:   28.3 Ratio:   0.33%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 16774    (Average:  1.29 Max:  53 Sum:  21569)
  Executed   : 16721    (Average:  1.24 Max:  53 Sum:  20774 Ratio:  96.31%)
  Bounded    : 53       (Average: 15.00 Max:  17 Sum:    795 Ratio:   3.69%)

Rules        : 293256  
Atoms        : 293256  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 42514    (Eliminated:    0 Frozen: 40321)
Constraints  : 92172    (Binary:  88.9% Ternary:  10.2% Other:   0.9%)

Memory Peak  : 167MB
Max. Length  : 20 steps
Sol. Length  : 20 steps


