/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 strict:
  a(a(c(x1))) -> a(c(c(x1)))
  a(a(c(x1))) -> b(a(c(x1)))
  a(a(c(x1))) -> a(b(c(x1)))
  c(c(c(x1))) -> b(b(b(x1)))
  c(a(a(x1))) -> c(b(b(x1)))
  c(a(c(x1))) -> c(b(c(x1)))
 weak:
  b(b(a(x1))) -> c(c(a(x1)))

Proof:
 LPO Processor:
  precedence:
   a > b ~ c
  problem:
   strict:
    c(c(c(x1))) -> b(b(b(x1)))
   weak:
    b(b(a(x1))) -> c(c(a(x1)))
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {4}
    transitions:
     b1(11) -> 12*
     b1(9) -> 10*
     b1(10) -> 11*
     a1(13) -> 14*
     c1(15) -> 16*
     c1(14) -> 15*
     c0(4) -> 4*
     b0(4) -> 4*
     a0(4) -> 4*
     12 -> 4*
     16 -> 10,11
     4 -> 13,9
   problem:
    strict:
     
    weak:
     b(b(a(x1))) -> c(c(a(x1)))
   Qed