MAYBE

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

No "->="-rules.

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

(VAR z y x)
(CONDITION 
f(x,y) == g(z,z)
)

Optimized the infeasibility problem if possible.

(VAR z y x)
(CONDITION 
f(x,y) == g(z,z)
)

This is not ultra-RL and deterministic.


MAYBE