/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:
 b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
 c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
 b(b(c(b(a(),a()),a(),z),f(a())),y) -> z

Proof:
 DP Processor:
  DPs:
   b#(f(b(x,z)),y) -> b#(y,z)
   b#(f(b(x,z)),y) -> b#(z,b(y,z))
   c#(f(f(c(x,a(),z))),a(),y) -> b#(a(),z)
   c#(f(f(c(x,a(),z))),a(),y) -> b#(y,f(b(a(),z)))
  TRS:
   b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
   c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
   b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
  TDG Processor:
   DPs:
    b#(f(b(x,z)),y) -> b#(y,z)
    b#(f(b(x,z)),y) -> b#(z,b(y,z))
    c#(f(f(c(x,a(),z))),a(),y) -> b#(a(),z)
    c#(f(f(c(x,a(),z))),a(),y) -> b#(y,f(b(a(),z)))
   TRS:
    b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
    c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
    b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
   graph:
    c#(f(f(c(x,a(),z))),a(),y) -> b#(a(),z) ->
    b#(f(b(x,z)),y) -> b#(z,b(y,z))
    c#(f(f(c(x,a(),z))),a(),y) -> b#(a(),z) ->
    b#(f(b(x,z)),y) -> b#(y,z)
    c#(f(f(c(x,a(),z))),a(),y) -> b#(y,f(b(a(),z))) ->
    b#(f(b(x,z)),y) -> b#(z,b(y,z))
    c#(f(f(c(x,a(),z))),a(),y) -> b#(y,f(b(a(),z))) ->
    b#(f(b(x,z)),y) -> b#(y,z)
    b#(f(b(x,z)),y) -> b#(y,z) -> b#(f(b(x,z)),y) -> b#(z,b(y,z))
    b#(f(b(x,z)),y) -> b#(y,z) -> b#(f(b(x,z)),y) -> b#(y,z)
    b#(f(b(x,z)),y) -> b#(z,b(y,z)) ->
    b#(f(b(x,z)),y) -> b#(z,b(y,z))
    b#(f(b(x,z)),y) -> b#(z,b(y,z)) -> b#(f(b(x,z)),y) -> b#(y,z)
   SCC Processor:
    #sccs: 1
    #rules: 2
    #arcs: 8/16
    DPs:
     b#(f(b(x,z)),y) -> b#(y,z)
     b#(f(b(x,z)),y) -> b#(z,b(y,z))
    TRS:
     b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
     c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
     b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
    Usable Rule Processor:
     DPs:
      b#(f(b(x,z)),y) -> b#(y,z)
      b#(f(b(x,z)),y) -> b#(z,b(y,z))
     TRS:
      b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
      b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
     Arctic Interpretation Processor:
      dimension: 2
      usable rules:
       b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
       b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
      interpretation:
       [b#](x0, x1) = [0  -&]x0 + [2 2]x1 + [0],
       
                         [1  -&]     [2  1 ]     [2 0]     [0]
       [c](x0, x1, x2) = [0  -&]x0 + [-& 0 ]x1 + [2 1]x2 + [2],
       
             [0 ]
       [a] = [-&],
       
                 [-& 3 ]     [1 ]
       [f](x0) = [-& -&]x0 + [-&],
       
                     [0  -&]     [0 0]  
       [b](x0, x1) = [0  0 ]x0 + [0 0]x1
      orientation:
       b#(f(b(x,z)),y) = [3 3]x + [2 2]y + [3 3]z + [1] >= [0  -&]y + [2 2]z + [0] = b#(y,z)
       
       b#(f(b(x,z)),y) = [3 3]x + [2 2]y + [3 3]z + [1] >= [2 2]y + [2 2]z + [0] = b#(z,b(y,z))
       
                        [3 3]    [0 0]    [3 3]    [1]    [1 ]                       
       b(f(b(x,z)),y) = [3 3]x + [0 0]y + [3 3]z + [1] >= [-&] = f(f(f(b(z,b(y,z)))))
       
                                            [0 0]    [2 0]    [2]         
       b(b(c(b(a(),a()),a(),z),f(a())),y) = [0 0]y + [2 1]z + [2] >= z = z
      problem:
       DPs:
        b#(f(b(x,z)),y) -> b#(z,b(y,z))
       TRS:
        b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
        b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
      Restore Modifier:
       DPs:
        b#(f(b(x,z)),y) -> b#(z,b(y,z))
       TRS:
        b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
        c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
        b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
       Size-Change Termination Processor:
        DPs:
         
        TRS:
         b(f(b(x,z)),y) -> f(f(f(b(z,b(y,z)))))
         c(f(f(c(x,a(),z))),a(),y) -> b(y,f(b(a(),z)))
         b(b(c(b(a(),a()),a(),z),f(a())),y) -> z
        The DP: b#(f(b(x,z)),y) -> b#(z,b(y,z)) has the edges:
          0 >   0
        Qed