YES

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

No "->="-rules.

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

(VAR y x)
(CONDITION 
F(x,x,x) == F(a,b,y)
)

Optimized the infeasibility problem if possible.

(VAR y x)
(CONDITION 
x == a, x == b, x == y
)

This is not ultra-RL and deterministic.

The inverted system is ultra-RL and deterministic.

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

YES