YES

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

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (RULES
      a -> b
      f(g(a)) -> f(a)
    )

(CONDITION 
F(a) == F(g(a))
)

Optimized the infeasibility problem if possible.

(CONDITION 
a == g(a)
)

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.

The inverted system is ultra-RL and deterministic.

(RTG_of_NARROWINGTREE
(START
  Gamma[g(a) == a : { e, 1, 1.1 }]
)
(NONTERMINALS
  Gamma[g(a) == a : { e, 1, 1.1 }]
)
(RULES
  Gamma[g(a) == a : { e, 1, 1.1 }] -> EmptySet
)
)

YES