YES

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

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.

(CONDITION 
a == b
)

Optimized the infeasibility problem if possible.

(CONDITION 
a == b
)

This is ultra-RL and deterministic.

This is operationally terminating and confluent.

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

YES