MAYBE

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

No "->="-rules.

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

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

Optimized the infeasibility problem if possible.

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

This is not ultra-RL and deterministic.


MAYBE