/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

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

Proof:
 String Reversal Processor:
  a(x1) -> b(b(x1))
  b(b(a(x1))) -> a(c(c(c(b(b(x1))))))
  b(b(x1)) -> c(c(c(x1)))
  b(b(c(c(c(x1))))) -> a(x1)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [c](x0) = x0,
    
    [b](x0) = 2x0 + 1,
    
    [a](x0) = 4x0 + 3
   orientation:
    a(x1) = 4x1 + 3 >= 4x1 + 3 = b(b(x1))
    
    b(b(a(x1))) = 16x1 + 15 >= 16x1 + 15 = a(c(c(c(b(b(x1))))))
    
    b(b(x1)) = 4x1 + 3 >= x1 = c(c(c(x1)))
    
    b(b(c(c(c(x1))))) = 4x1 + 3 >= 4x1 + 3 = a(x1)
   problem:
    a(x1) -> b(b(x1))
    b(b(a(x1))) -> a(c(c(c(b(b(x1))))))
    b(b(c(c(c(x1))))) -> a(x1)
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [c](x0) = x0 + 1,
     
     [b](x0) = 2x0,
     
     [a](x0) = 4x0 + 4
    orientation:
     a(x1) = 4x1 + 4 >= 4x1 = b(b(x1))
     
     b(b(a(x1))) = 16x1 + 16 >= 16x1 + 16 = a(c(c(c(b(b(x1))))))
     
     b(b(c(c(c(x1))))) = 4x1 + 12 >= 4x1 + 4 = a(x1)
    problem:
     b(b(a(x1))) -> a(c(c(c(b(b(x1))))))
    String Reversal Processor:
     a(b(b(x1))) -> b(b(c(c(c(a(x1))))))
     KBO Processor:
      weight function:
       w0 = 1
       w(b) = w(a) = 1
       w(c) = 0
      precedence:
       c > a > b
      problem:
       
      Qed