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


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


YES

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

Proof:
 DP Processor:
  DPs:
   a#(c(x1)) -> b#(c(x1))
   b#(c(x1)) -> b#(x1)
   b#(c(x1)) -> a#(b(x1))
  TRS:
   a(b(x1)) -> x1
   a(c(x1)) -> c(c(b(c(x1))))
   b(c(x1)) -> a(b(x1))
  TDG Processor:
   DPs:
    a#(c(x1)) -> b#(c(x1))
    b#(c(x1)) -> b#(x1)
    b#(c(x1)) -> a#(b(x1))
   TRS:
    a(b(x1)) -> x1
    a(c(x1)) -> c(c(b(c(x1))))
    b(c(x1)) -> a(b(x1))
   graph:
    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> a#(b(x1))
    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1)
    b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> b#(c(x1))
    a#(c(x1)) -> b#(c(x1)) -> b#(c(x1)) -> a#(b(x1))
    a#(c(x1)) -> b#(c(x1)) -> b#(c(x1)) -> b#(x1)
   Arctic Interpretation Processor:
    dimension: 1
    usable rules:
     a(b(x1)) -> x1
     a(c(x1)) -> c(c(b(c(x1))))
     b(c(x1)) -> a(b(x1))
    interpretation:
     [b#](x0) = x0 + 5,
     
     [a](x0) = 1x0 + 0,
     
     [a#](x0) = x0 + 0,
     
     [b](x0) = -1x0 + 0,
     
     [c](x0) = 1x0 + 5
    orientation:
     a#(c(x1)) = 1x1 + 5 >= 1x1 + 5 = b#(c(x1))
     
     b#(c(x1)) = 1x1 + 5 >= x1 + 5 = b#(x1)
     
     b#(c(x1)) = 1x1 + 5 >= -1x1 + 0 = a#(b(x1))
     
     a(b(x1)) = x1 + 1 >= x1 = x1
     
     a(c(x1)) = 2x1 + 6 >= 2x1 + 6 = c(c(b(c(x1))))
     
     b(c(x1)) = x1 + 4 >= x1 + 1 = a(b(x1))
    problem:
     DPs:
      a#(c(x1)) -> b#(c(x1))
      b#(c(x1)) -> b#(x1)
     TRS:
      a(b(x1)) -> x1
      a(c(x1)) -> c(c(b(c(x1))))
      b(c(x1)) -> a(b(x1))
    Restore Modifier:
     DPs:
      a#(c(x1)) -> b#(c(x1))
      b#(c(x1)) -> b#(x1)
     TRS:
      a(b(x1)) -> x1
      a(c(x1)) -> c(c(b(c(x1))))
      b(c(x1)) -> a(b(x1))
     EDG Processor:
      DPs:
       a#(c(x1)) -> b#(c(x1))
       b#(c(x1)) -> b#(x1)
      TRS:
       a(b(x1)) -> x1
       a(c(x1)) -> c(c(b(c(x1))))
       b(c(x1)) -> a(b(x1))
      graph:
       b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1)
       a#(c(x1)) -> b#(c(x1)) -> b#(c(x1)) -> b#(x1)
      SCC Processor:
       #sccs: 1
       #rules: 1
       #arcs: 2/4
       DPs:
        b#(c(x1)) -> b#(x1)
       TRS:
        a(b(x1)) -> x1
        a(c(x1)) -> c(c(b(c(x1))))
        b(c(x1)) -> a(b(x1))
       Usable Rule Processor:
        DPs:
         b#(c(x1)) -> b#(x1)
        TRS:
         
        Arctic Interpretation Processor:
         dimension: 1
         usable rules:
          
         interpretation:
          [b#](x0) = x0,
          
          [c](x0) = 15x0 + 15
         orientation:
          b#(c(x1)) = 15x1 + 15 >= x1 = b#(x1)
         problem:
          DPs:
           
          TRS:
           
         Qed