MAYBE

Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.ari".
    (CONDITIONTYPE ORIENTED)
    (VAR n m l x1 x3)
    (RULES
      lte(0,n) -> true
      lte(s(m),0) -> false
      lte(s(m),s(n)) -> lte(m,n)
      insert(nil,m) -> cons(m,nil)
      insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) == true
      insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) == false
      ordered(nil) -> true
      ordered(cons(m,nil)) -> true
      ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) == true
      ordered(cons(m,cons(n,l))) -> false | lte(m,n) == false
    )

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (CONDITIONTYPE ORIENTED)
    (VAR n m l x1 x3)
    (RULES
      lte(0,n) -> true
      lte(s(m),0) -> false
      lte(s(m),s(n)) -> lte(m,n)
      insert(nil,m) -> cons(m,nil)
      insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) == true
      insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) == false
      ordered(nil) -> true
      ordered(cons(m,nil)) -> true
      ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) == true
      ordered(cons(m,cons(n,l))) -> false | lte(m,n) == false
    )

(VAR x1 x3)
(CONDITION 
lte(x3,x1) == true, lte(x3,x1) == false
)

Optimized the infeasibility problem if possible.

(VAR x1 x3)
(CONDITION 
lte(x3,x1) == true, lte(x3,x1) == false
)

This is not ultra-RL and deterministic.

The inverted system is ultra-RL and deterministic.


MAYBE