/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f(x,x) -> f(i(x),g(g(x)))
          f(x,y) -> x
          f(x,i(x)) -> f(x,x)
          f(i(x),i(g(x))) -> a()
          g(x) -> i(x)
      - Signature:
          {f/2,g/1} / {a/0,i/1}
      - Obligation:
           derivational complexity wrt. signature {a,f,g,i}
  + Applied Processor:
      Bounds {initialAutomaton = perSymbol, enrichment = match}
  + Details:
      The processor is not applicable. The reason is some rule is not right linear.
MAYBE