MAYBE

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

No "->="-rules.

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

(VAR x2 x1 x)
(CONDITION 
les(x,x1) == true, les(x1,x2) == true
)

Optimized the infeasibility problem if possible.

(VAR x2 x1 x)
(CONDITION 
les(x,x1) == true, les(x1,x2) == true
)

This is not ultra-RL and deterministic.

The inverted system is ultra-RL and deterministic.


MAYBE