/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) -> x1
 a(b(x1)) -> c(b(c(b(x1))))
 b(x1) -> a(a(x1))
 c(c(x1)) -> x1

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