YES

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

No "->="-rules.

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

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

Optimized the infeasibility problem if possible.

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

This is ultra-RL and deterministic.

This is operationally terminating and confluent.

(RTG_of_NARROWINGTREE
(START
  Gamma[x == a : { e } & x == c : { e }]
)
(NONTERMINALS
  Gamma[x == a : { e } & x == c : { e }]
)
(RULES
  Gamma[x == a : { e } & x == c : { e }] -> EmptySet
)
)

YES