MAYBE

Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.ari".
    (CONDITIONTYPE ORIENTED)
    (VAR x x1)
    (RULES
      odd(0) -> false
      odd(s(x)) -> true | eq(even(x),true) == eq(T,T)
      odd(s(x)) -> false | eq(even(x),false) == eq(T,T)
      even(0) -> true
      even(s(x)) -> true | eq(odd(x),true) == eq(T,T)
      even(s(x)) -> false | eq(odd(x),false) == eq(T,T)
      eq(x,x) -> eq(T,T)
    )

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (CONDITIONTYPE ORIENTED)
    (VAR x x1)
    (RULES
      odd(0) -> false
      odd(s(x)) -> true | eq(even(x),true) == eq(T,T)
      odd(s(x)) -> false | eq(even(x),false) == eq(T,T)
      even(0) -> true
      even(s(x)) -> true | eq(odd(x),true) == eq(T,T)
      even(s(x)) -> false | eq(odd(x),false) == eq(T,T)
      eq(x,x) -> eq(T,T)
    )

(VAR x1)
(CONDITION 
eq(even(x1),true) == eq(T,T), eq(even(x1),false) == eq(T,T)
)

Optimized the infeasibility problem if possible.

(VAR x1)
(CONDITION 
eq(even(x1),true) == eq(T,T), eq(even(x1),false) == eq(T,T)
)

This is not ultra-RL and deterministic.


MAYBE