/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:
 admit(x,nil()) -> nil()
 admit(x,.(u,.(v,.(w(),z)))) -> cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
 cond(true(),y) -> y

Proof:
 DP Processor:
  DPs:
   admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z)
   admit#(x,.(u,.(v,.(w(),z)))) -> cond#(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
  TRS:
   admit(x,nil()) -> nil()
   admit(x,.(u,.(v,.(w(),z)))) -> cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
   cond(true(),y) -> y
  TDG Processor:
   DPs:
    admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z)
    admit#(x,.(u,.(v,.(w(),z)))) -> cond#(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
   TRS:
    admit(x,nil()) -> nil()
    admit(x,.(u,.(v,.(w(),z)))) -> cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
    cond(true(),y) -> y
   graph:
    admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z) ->
    admit#(x,.(u,.(v,.(w(),z)))) -> cond#(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
    admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z) ->
    admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     admit#(x,.(u,.(v,.(w(),z)))) -> admit#(carry(x,u,v),z)
    TRS:
     admit(x,nil()) -> nil()
     admit(x,.(u,.(v,.(w(),z)))) -> cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
     cond(true(),y) -> y
    Subterm Criterion Processor:
     simple projection:
      pi(admit#) = 1
     problem:
      DPs:
       
      TRS:
       admit(x,nil()) -> nil()
       admit(x,.(u,.(v,.(w(),z)))) ->
       cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
       cond(true(),y) -> y
     Qed