MAYBE

Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.ari".
    (CONDITIONTYPE ORIENTED)
    (VAR x y xs x1 x3)
    (RULES
      le(x,0) -> false
      le(0,s(y)) -> true
      le(s(x),s(y)) -> le(x,y)
      min(cons(x,nil)) -> x
      min(cons(x,xs)) -> x | min(xs) == y, le(x,y) == true
      min(cons(x,xs)) -> y | min(xs) == y, le(x,y) == false
    )

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (CONDITIONTYPE ORIENTED)
    (VAR x y xs x1 x3)
    (RULES
      le(x,0) -> false
      le(0,s(y)) -> true
      le(s(x),s(y)) -> le(x,y)
      min(cons(x,nil)) -> x
      min(cons(x,xs)) -> x | min(xs) == y, le(x,y) == true
      min(cons(x,xs)) -> y | min(xs) == y, le(x,y) == false
    )

(VAR x1 x3)
(CONDITION 
min(nil) == x3, le(x1,x3) == false
)

Optimized the infeasibility problem if possible.

(VAR x1)
(CONDITION 
le(x1,min(nil)) == false
)

This is not ultra-RL and deterministic.


MAYBE