MAYBE

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

No "->="-rules.

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

(VAR x)
(CONDITION 
x == g(x)
)

Optimized the infeasibility problem if possible.

(VAR x)
(CONDITION 
x == g(x)
)

This is ultra-RL and deterministic.

This is not operationally terminating and confluent.

This is a constructor-based system.

(RTG_of_NARROWINGTREE
(START
  Gamma[x6 == g(x) : { e }]
)
(NONTERMINALS
  Gamma[x6 == g(x) : { e }]
)
(RULES
  Gamma[x6 == g(x) : { e }] -> { x6 -> g(x) }
)
)

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

This is not ultra-RL and deterministic.


MAYBE