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


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


YES

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

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