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-54.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-54.pddl
Parsing...
Parsing: [0.030s CPU, 0.026s 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.009s wall-clock]
Preparing model... [0.020s CPU, 0.024s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.086s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.075s wall-clock]
Instantiating: [0.200s CPU, 0.204s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.004s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
22 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.010s CPU, 0.004s wall-clock]
Translating task: [0.080s CPU, 0.075s wall-clock]
11 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.044s wall-clock]
Reordering and filtering variables...
23 of 23 variables necessary.
0 of 1 mutex groups necessary.
484 of 484 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 66
Translator goal facts: 11
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 484
Translator axioms: 0
Translator task size: 1574
Translator peak memory: 34136 KB
Writing output... [0.040s CPU, 0.038s wall-clock]
Done! [0.410s CPU, 0.415s wall-clock]
planner.py version 0.0.1

Time:	 1.06s
Memory: 106MB

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.01s
Memory:		 106MB (+0MB)
UNSAT
Iteration Time:	 0.01s

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:		 108MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 109MB (+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:		 110MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.29s
Memory:		 111MB (+1MB)
UNSAT
Iteration Time:	 0.33s

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:		 113MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.41s
Memory:		 115MB (+2MB)
UNKNOWN
Iteration Time:	 0.46s

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

Models       : 1+
Calls        : 5
Time         : 2.018s (Solving: 0.76s 1st Model: 0.06s Unsat: 0.29s)
CPU Time     : 2.020s

Choices      : 26401   
Conflicts    : 15877    (Analyzed: 15875)
Restarts     : 194      (Average: 81.83 Last: 78)
Model-Level  : 108.0   
Problems     : 5        (Average Length: 12.00 Splits: 0)
Lemmas       : 15875    (Deleted: 8535)
  Binary     : 168      (Ratio:   1.06%)
  Ternary    : 632      (Ratio:   3.98%)
  Conflict   : 15875    (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    : 15875    (Average:  1.49 Max:  33 Sum:  23679)
  Executed   : 15869    (Average:  1.49 Max:  33 Sum:  23673 Ratio:  99.97%)
  Bounded    : 6        (Average:  1.00 Max:   1 Sum:      6 Ratio:   0.03%)

Rules        : 637309  
Atoms        : 637309  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 11437    (Eliminated:    0 Frozen:  858)
Constraints  : 48531    (Binary:  97.0% Ternary:   2.1% Other:   1.0%)

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


