MAYBE

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

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (CONDITIONTYPE ORIENTED)
    (VAR x)
    (RULES
      g(x) -> g(x) | g(x) == f(a,b)
      g(x) -> f(x,x)
    )

(VAR x)
(CONDITION 
g(x) == f(a,b)
)

Optimized the infeasibility problem if possible.

(VAR x)
(CONDITION 
g(x) == f(a,b)
)

This is not ultra-RL and deterministic.

The inverted system is ultra-RL and deterministic.


MAYBE