MAYBE

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

No "->="-rules.

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

(VAR x)
(CONDITION 
f(a,c) == f(x,x)
)

Optimized the infeasibility problem if possible.

(VAR x)
(CONDITION 
f(a,c) == f(x,x)
)

This is ultra-RL and deterministic.

This is not operationally terminating and confluent.

Failed to prove infeasibility of the linearized conditions by means of narrowing trees.

This is not ultra-RL and deterministic.


MAYBE