0.00/0.00	MAYBE
0.00/0.00	
0.00/0.00	Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.trs".
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y l x2 x1)
0.00/0.00	    (RULES
0.00/0.00	      le(0,s(x)) -> true
0.00/0.00	      le(x,0) -> false
0.00/0.00	      le(s(x),s(y)) -> le(x,y)
0.00/0.00	      min(cons(x,nil)) -> x
0.00/0.00	      min(cons(x,l)) -> x | le(x,min(l)) == true
0.00/0.00	      min(cons(x,l)) -> min(l) | le(x,min(l)) == false
0.00/0.00	      min(cons(x,l)) -> min(l) | min(l) == x
0.00/0.00	    )
0.00/0.00	    (COMMENT COPS 292)
0.00/0.00	    (COMMENT submitted by: Naoki Nishida)
0.00/0.00	
0.00/0.00	No "->="-rules.
0.00/0.00	
0.00/0.00	Decomposed conditions and removed infeasible rules if possible.
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y l x2 x1)
0.00/0.00	    (RULES
0.00/0.00	      le(0,s(x)) -> true
0.00/0.00	      le(x,0) -> false
0.00/0.00	      le(s(x),s(y)) -> le(x,y)
0.00/0.00	      min(cons(x,nil)) -> x
0.00/0.00	      min(cons(x,l)) -> x | le(x,min(l)) == true
0.00/0.00	      min(cons(x,l)) -> min(l) | le(x,min(l)) == false
0.00/0.00	      min(cons(x,l)) -> min(l) | min(l) == x
0.00/0.00	    )
0.00/0.00	    (COMMENT COPS 292)
0.00/0.00	    (COMMENT submitted by: Naoki Nishida)
0.00/0.00	
0.00/0.00	(VAR x2 x1)
0.00/0.00	(CONDITION 
0.00/0.00	le(x1,min(x2)) == false, min(x2) == x1
0.00/0.00	)
0.00/0.00	
0.00/0.00	Optimized the infeasibility problem if possible.
0.00/0.00	
0.00/0.00	(VAR x2 x1)
0.00/0.00	(CONDITION 
0.00/0.00	le(x1,min(x2)) == false, min(x2) == x1
0.00/0.00	)
0.00/0.00	
0.00/0.00	This is not ultra-RL and deterministic.
0.00/0.00	
0.00/0.00	
0.00/0.00	MAYBE
0.00/0.00	EOF