INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/instances/instance-28.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-2004/domains/pipesworld-no-tankage-nontemporal-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/instances/instance-28.pddl
Parsing...
Parsing: [0.040s CPU, 0.041s wall-clock]
Normalizing task... [0.000s CPU, 0.003s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.060s CPU, 0.064s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 91 rules.
Computing model... [0.740s CPU, 0.736s wall-clock]
3447 relevant atoms
5304 auxiliary atoms
8751 final queue length
16824 total queue pushes
Completing instantiation... [1.390s CPU, 1.382s wall-clock]
Instantiating: [2.220s CPU, 2.223s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.140s CPU, 0.135s 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...
464 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.020s CPU, 0.018s wall-clock]
Computing fact groups: [0.190s CPU, 0.188s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.050s CPU, 0.052s wall-clock]
Translating task: [1.340s CPU, 1.339s wall-clock]
6032 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [0.710s CPU, 0.708s wall-clock]
Reordering and filtering variables...
466 of 466 variables necessary.
0 of 2 mutex groups necessary.
2840 of 2840 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.980s CPU, 0.985s wall-clock]
Translator variables: 466
Translator derived variables: 0
Translator facts: 934
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2840
Translator axioms: 0
Translator task size: 26571
Translator peak memory: 52452 KB
Writing output... [0.470s CPU, 0.513s wall-clock]
Done! [6.020s CPU, 6.066s wall-clock]
planner.py version 0.0.1

Time:	 1.10s
Memory: 124MB

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:		 124MB (+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
Expected Memory: 124MB
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.40s
Memory:		 124MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 126MB (+2MB)
UNSAT
Iteration Time:	 0.60s

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
Expected Memory: 128.0MB
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.41s
Memory:		 143MB (+17MB)
Unblocking actions...
Solving...
Solving Time:	 0.13s
Memory:		 154MB (+11MB)
UNSAT
Iteration Time:	 0.75s

Iteration 4
Queue:		 [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 10
Expected Memory: 182.0MB
Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time:	 0.50s
Memory:		 174MB (+20MB)
Unblocking actions...
Solving...
Solving Time:	 0.17s
Memory:		 183MB (+9MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 1.40s
Memory:		 184MB (+1MB)
Solving...
Solving Time:	 9.04s
Memory:		 207MB (+23MB)
UNKNOWN
Iteration Time:	 11.32s

Iteration 5
Queue:		 [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 15
Expected Memory: 236.0MB
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time:	 0.73s
Memory:		 239MB (+32MB)
Unblocking actions...
Solving...
Solving Time:	 10.86s
Memory:		 260MB (+21MB)
UNKNOWN
Iteration Time:	 11.84s

Iteration 6
Queue:		 [(5,25,0,True), (6,30,0,True)]
Grounded Until:	 20
Expected Memory: 313.0MB
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time:	 0.76s
Memory:		 273MB (+13MB)
Unblocking actions...
Solving...
Solving Time:	 12.10s
Memory:		 297MB (+24MB)
UNKNOWN
Iteration Time:	 13.14s

Iteration 7
Queue:		 [(6,30,0,True)]
Grounded Until:	 25
Expected Memory: 350.0MB
Grounding...	 [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time:	 0.95s
Memory:		 329MB (+32MB)
Unblocking actions...
Solving...
Solving Time:	 13.21s
Memory:		 383MB (+54MB)
UNKNOWN
Iteration Time:	 14.46s

Iteration 8
Queue:		 [(3,15,1,True), (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)]
Grounded Until:	 30
Blocking actions...
Solving...
Solving Time:	 12.90s
Memory:		 383MB (+0MB)
UNKNOWN
Iteration Time:	 12.92s

Iteration 9
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)]
Grounded Until:	 30
Unblocking actions...
Solving...
Solving Time:	 12.61s
Memory:		 383MB (+0MB)
UNKNOWN
Iteration Time:	 12.63s

Iteration 10
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)]
Grounded Until:	 30
Unblocking actions...
Solving...
Solving Time:	 1.80s
Memory:		 383MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 383MB (+0MB)
Answer: 2
occurs(action(("pop-unitarypipe","s34","b11","a3","a4","b17","oca1","oca1")),1) occurs(action(("pop-start","s13","b4","a1","a3","b6","oc1b","gasoleo")),1) occurs(action(("pop-unitarypipe","s34","b2","a3","a4","b11","gasoleo","oca1")),2) occurs(action(("pop-end","s13","a1","a3","b15","b6")),2) occurs(action(("pop-start","s13","b17","a1","a3","b4","oca1","oc1b")),3) occurs(action(("pop-unitarypipe","s34","b8","a3","a4","b2","oca1","gasoleo")),3) occurs(action(("pop-end","s13","a1","a3","b6","b4")),4) occurs(action(("pop-start","s13","b2","a1","a3","b17","gasoleo","oca1")),5) occurs(action(("push-start","s12","b6","a1","a2","b0","gasoleo","oc1b")),5) occurs(action(("push-unitarypipe","s34","b5","a3","a4","b8","lco","oca1")),5) occurs(action(("pop-end","s13","a1","a3","b4","b17")),6) occurs(action(("push-end","s12","a1","a2","b10","b0")),6) occurs(action(("pop-start","s13","b16","a1","a3","b2","rat-a","gasoleo")),7) occurs(action(("push-start","s12","b1","a1","a2","b6","oc1b","gasoleo")),7) occurs(action(("pop-end","s13","a1","a3","b17","b2")),8) occurs(action(("push-end","s12","a1","a2","b0","b6")),8) occurs(action(("push-start","s13","b9","a1","a3","b2","rat-a","gasoleo")),9) occurs(action(("push-start","s12","b4","a1","a2","b1","oc1b","oc1b")),9) occurs(action(("push-end","s12","a1","a2","b6","b1")),10) occurs(action(("push-end","s13","a1","a3","b16","b2")),10) occurs(action(("push-start","s13","b15","a1","a3","b9","lco","rat-a")),11) occurs(action(("push-start","s12","b13","a1","a2","b4","oca1","oc1b")),11) occurs(action(("push-end","s12","a1","a2","b1","b4")),12) occurs(action(("push-end","s13","a1","a3","b2","b9")),12) occurs(action(("push-unitarypipe","s34","b2","a3","a4","b5","gasoleo","lco")),13) occurs(action(("push-start","s13","b3","a1","a3","b15","oc1b","lco")),13) occurs(action(("push-start","s12","b12","a1","a2","b13","oca1","oca1")),13) occurs(action(("push-end","s12","a1","a2","b4","b13")),14) occurs(action(("push-end","s13","a1","a3","b9","b15")),14) occurs(action(("push-start","s13","b7","a1","a3","b3","oca1","oc1b")),15) occurs(action(("pop-start","s12","b14","a1","a2","b13","gasoleo","oca1")),15) occurs(action(("push-unitarypipe","s34","b9","a3","a4","b2","rat-a","gasoleo")),15) occurs(action(("push-unitarypipe","s34","b16","a3","a4","b9","rat-a","rat-a")),16) occurs(action(("push-end","s13","a1","a3","b15","b3")),16) occurs(action(("pop-end","s12","a1","a2","b12","b13")),16) occurs(action(("push-start","s13","b12","a1","a3","b7","oca1","oca1")),17) occurs(action(("push-end","s13","a1","a3","b3","b7")),18) occurs(action(("pop-start","s12","b0","a1","a2","b14","oc1b","gasoleo")),18) occurs(action(("pop-unitarypipe","s34","b5","a3","a4","b16","lco","rat-a")),19) occurs(action(("pop-end","s12","a1","a2","b13","b14")),20) occurs(action(("pop-start","s12","b10","a1","a2","b0","gasoleo","oc1b")),21) occurs(action(("pop-end","s12","a1","a2","b14","b0")),22) occurs(action(("push-start","s12","b14","a1","a2","b0","gasoleo","oc1b")),23) occurs(action(("push-start","s13","b13","a1","a3","b12","oca1","oca1")),24) occurs(action(("push-end","s12","a1","a2","b10","b0")),25)
SATISFIABLE

Models       : 1+
Calls        : 11
Time         : 79.671s (Solving: 72.34s 1st Model: 1.88s Unsat: 0.11s)
CPU Time     : 79.652s

Choices      : 279761   (Domain: 241552)
Conflicts    : 58650    (Analyzed: 58649)
Restarts     : 624      (Average: 93.99 Last: 155)
Model-Level  : 298.0   
Problems     : 11       (Average Length: 21.09 Splits: 0)
Lemmas       : 58649    (Deleted: 53152)
  Binary     : 305      (Ratio:   0.52%)
  Ternary    : 242      (Ratio:   0.41%)
  Conflict   : 58649    (Average Length: 1208.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 58649    (Average:  4.13 Max: 469 Sum: 242063)
  Executed   : 58579    (Average:  4.11 Max: 469 Sum: 240966 Ratio:  99.55%)
  Bounded    : 70       (Average: 15.67 Max:  32 Sum:   1097 Ratio:   0.45%)

Rules        : 188973   (Original: 184451)
Atoms        : 103085  
Bodies       : 48370    (Original: 43897)
  Count      : 4797     (Original: 5289)
Equivalences : 34656    (Atom=Atom: 113 Body=Body: 2 Other: 34541)
Tight        : Yes
Variables    : 179647   (Eliminated:    0 Frozen: 83857)
Constraints  : 1364310  (Binary:  94.4% Ternary:   2.1% Other:   3.5%)

Memory Peak  : 383MB
Max. Length  : 30 steps
Sol. Length  : 25 steps
Models       : 2


