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


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


YES

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

Proof:
 LPO Processor:
  precedence:
   c ~ a > b
  problem:
   strict:
    a(c(a(x1))) -> c(a(c(x1)))
   weak:
    b(c(c(x1))) -> b(c(a(x1)))
  Bounds Processor:
   bound: 2
   enrichment: match-rt
   automaton:
    final states: {4}
    transitions:
     c1(11) -> 12*
     c1(9) -> 10*
     c1(20) -> 21*
     c1(13) -> 14*
     b1(21) -> 22*
     a1(10) -> 11*
     a1(19) -> 20*
     a0(4) -> 4*
     c0(4) -> 4*
     b0(4) -> 4*
     c2(27) -> 28*
     c2(25) -> 26*
     c2(30) -> 31*
     b2(31) -> 32*
     a2(29) -> 30*
     a2(26) -> 27*
     27 -> 29*
     12 -> 11,4
     14 -> 10*
     28 -> 20*
     4 -> 9*
     11 -> 19*
     22 -> 4*
     10 -> 25,13
     32 -> 22*
   problem:
    strict:
     
    weak:
     b(c(c(x1))) -> b(c(a(x1)))
   Qed