MAYBE

Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.ari".
    (CONDITIONTYPE ORIENTED)
    (VAR y x x1)
    (RULES
      f(c(x),c(c(y))) -> a(a(x)) | c(f(x,y)) == c(a(b))
      f(c(c(c(x))),y) -> a(y) | c(f(c(x),c(c(y)))) == c(a(a(b)))
      a(x) -> b
      a(x) -> f(x,x)
    )

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (VAR y x x1)
    (RULES
      a(x) -> b
      a(x) -> f(x,x)
    )

(VAR y x1)
(CONDITION 
c(f(c(c(x1)),y)) == c(a(b)), c(f(c(x1),c(c(c(c(y)))))) == c(a(a(b)))
)

Optimized the infeasibility problem if possible.

(VAR y x1)
(CONDITION 
f(c(c(x1)),y) == a(b), f(c(x1),c(c(c(c(y))))) == a(a(b))
)

This is not ultra-RL and deterministic.

The inverted system is ultra-RL and deterministic.


MAYBE