MAYBE

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

No "->="-rules.

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

(VAR y x)
(CONDITION 
f(k(b),x) == g(h(a),y)
)

Optimized the infeasibility problem if possible.

(VAR y x)
(CONDITION 
f(k(b),x) == g(h(a),y)
)

This is not ultra-RL and deterministic.


MAYBE