/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:
 +(x,0()) -> x
 +(0(),x) -> x
 +(s(x),s(y)) -> s(s(+(x,y)))
 *(x,0()) -> 0()
 *(0(),x) -> 0()
 *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
 sum(nil()) -> 0()
 sum(cons(x,l)) -> +(x,sum(l))
 prod(nil()) -> s(0())
 prod(cons(x,l)) -> *(x,prod(l))

Proof:
 DP Processor:
  DPs:
   +#(s(x),s(y)) -> +#(x,y)
   *#(s(x),s(y)) -> +#(x,y)
   *#(s(x),s(y)) -> *#(x,y)
   *#(s(x),s(y)) -> +#(*(x,y),+(x,y))
   sum#(cons(x,l)) -> sum#(l)
   sum#(cons(x,l)) -> +#(x,sum(l))
   prod#(cons(x,l)) -> prod#(l)
   prod#(cons(x,l)) -> *#(x,prod(l))
  TRS:
   +(x,0()) -> x
   +(0(),x) -> x
   +(s(x),s(y)) -> s(s(+(x,y)))
   *(x,0()) -> 0()
   *(0(),x) -> 0()
   *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
   sum(nil()) -> 0()
   sum(cons(x,l)) -> +(x,sum(l))
   prod(nil()) -> s(0())
   prod(cons(x,l)) -> *(x,prod(l))
  TDG Processor:
   DPs:
    +#(s(x),s(y)) -> +#(x,y)
    *#(s(x),s(y)) -> +#(x,y)
    *#(s(x),s(y)) -> *#(x,y)
    *#(s(x),s(y)) -> +#(*(x,y),+(x,y))
    sum#(cons(x,l)) -> sum#(l)
    sum#(cons(x,l)) -> +#(x,sum(l))
    prod#(cons(x,l)) -> prod#(l)
    prod#(cons(x,l)) -> *#(x,prod(l))
   TRS:
    +(x,0()) -> x
    +(0(),x) -> x
    +(s(x),s(y)) -> s(s(+(x,y)))
    *(x,0()) -> 0()
    *(0(),x) -> 0()
    *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
    sum(nil()) -> 0()
    sum(cons(x,l)) -> +(x,sum(l))
    prod(nil()) -> s(0())
    prod(cons(x,l)) -> *(x,prod(l))
   graph:
    prod#(cons(x,l)) -> prod#(l) -> prod#(cons(x,l)) -> *#(x,prod(l))
    prod#(cons(x,l)) -> prod#(l) -> prod#(cons(x,l)) -> prod#(l)
    prod#(cons(x,l)) -> *#(x,prod(l)) ->
    *#(s(x),s(y)) -> +#(*(x,y),+(x,y))
    prod#(cons(x,l)) -> *#(x,prod(l)) -> *#(s(x),s(y)) -> *#(x,y)
    prod#(cons(x,l)) -> *#(x,prod(l)) -> *#(s(x),s(y)) -> +#(x,y)
    sum#(cons(x,l)) -> sum#(l) -> sum#(cons(x,l)) -> +#(x,sum(l))
    sum#(cons(x,l)) -> sum#(l) -> sum#(cons(x,l)) -> sum#(l)
    sum#(cons(x,l)) -> +#(x,sum(l)) -> +#(s(x),s(y)) -> +#(x,y)
    *#(s(x),s(y)) -> *#(x,y) -> *#(s(x),s(y)) -> +#(*(x,y),+(x,y))
    *#(s(x),s(y)) -> *#(x,y) -> *#(s(x),s(y)) -> *#(x,y)
    *#(s(x),s(y)) -> *#(x,y) -> *#(s(x),s(y)) -> +#(x,y)
    *#(s(x),s(y)) -> +#(*(x,y),+(x,y)) -> +#(s(x),s(y)) -> +#(x,y)
    *#(s(x),s(y)) -> +#(x,y) -> +#(s(x),s(y)) -> +#(x,y)
    +#(s(x),s(y)) -> +#(x,y) -> +#(s(x),s(y)) -> +#(x,y)
   SCC Processor:
    #sccs: 4
    #rules: 4
    #arcs: 14/64
    DPs:
     sum#(cons(x,l)) -> sum#(l)
    TRS:
     +(x,0()) -> x
     +(0(),x) -> x
     +(s(x),s(y)) -> s(s(+(x,y)))
     *(x,0()) -> 0()
     *(0(),x) -> 0()
     *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
     sum(nil()) -> 0()
     sum(cons(x,l)) -> +(x,sum(l))
     prod(nil()) -> s(0())
     prod(cons(x,l)) -> *(x,prod(l))
    Subterm Criterion Processor:
     simple projection:
      pi(sum#) = 0
     problem:
      DPs:
       
      TRS:
       +(x,0()) -> x
       +(0(),x) -> x
       +(s(x),s(y)) -> s(s(+(x,y)))
       *(x,0()) -> 0()
       *(0(),x) -> 0()
       *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
       sum(nil()) -> 0()
       sum(cons(x,l)) -> +(x,sum(l))
       prod(nil()) -> s(0())
       prod(cons(x,l)) -> *(x,prod(l))
     Qed
    
    DPs:
     prod#(cons(x,l)) -> prod#(l)
    TRS:
     +(x,0()) -> x
     +(0(),x) -> x
     +(s(x),s(y)) -> s(s(+(x,y)))
     *(x,0()) -> 0()
     *(0(),x) -> 0()
     *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
     sum(nil()) -> 0()
     sum(cons(x,l)) -> +(x,sum(l))
     prod(nil()) -> s(0())
     prod(cons(x,l)) -> *(x,prod(l))
    Subterm Criterion Processor:
     simple projection:
      pi(prod#) = 0
     problem:
      DPs:
       
      TRS:
       +(x,0()) -> x
       +(0(),x) -> x
       +(s(x),s(y)) -> s(s(+(x,y)))
       *(x,0()) -> 0()
       *(0(),x) -> 0()
       *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
       sum(nil()) -> 0()
       sum(cons(x,l)) -> +(x,sum(l))
       prod(nil()) -> s(0())
       prod(cons(x,l)) -> *(x,prod(l))
     Qed
    
    DPs:
     *#(s(x),s(y)) -> *#(x,y)
    TRS:
     +(x,0()) -> x
     +(0(),x) -> x
     +(s(x),s(y)) -> s(s(+(x,y)))
     *(x,0()) -> 0()
     *(0(),x) -> 0()
     *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
     sum(nil()) -> 0()
     sum(cons(x,l)) -> +(x,sum(l))
     prod(nil()) -> s(0())
     prod(cons(x,l)) -> *(x,prod(l))
    Subterm Criterion Processor:
     simple projection:
      pi(*#) = 0
     problem:
      DPs:
       
      TRS:
       +(x,0()) -> x
       +(0(),x) -> x
       +(s(x),s(y)) -> s(s(+(x,y)))
       *(x,0()) -> 0()
       *(0(),x) -> 0()
       *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
       sum(nil()) -> 0()
       sum(cons(x,l)) -> +(x,sum(l))
       prod(nil()) -> s(0())
       prod(cons(x,l)) -> *(x,prod(l))
     Qed
    
    DPs:
     +#(s(x),s(y)) -> +#(x,y)
    TRS:
     +(x,0()) -> x
     +(0(),x) -> x
     +(s(x),s(y)) -> s(s(+(x,y)))
     *(x,0()) -> 0()
     *(0(),x) -> 0()
     *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
     sum(nil()) -> 0()
     sum(cons(x,l)) -> +(x,sum(l))
     prod(nil()) -> s(0())
     prod(cons(x,l)) -> *(x,prod(l))
    Subterm Criterion Processor:
     simple projection:
      pi(+#) = 0
     problem:
      DPs:
       
      TRS:
       +(x,0()) -> x
       +(0(),x) -> x
       +(s(x),s(y)) -> s(s(+(x,y)))
       *(x,0()) -> 0()
       *(0(),x) -> 0()
       *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
       sum(nil()) -> 0()
       sum(cons(x,l)) -> +(x,sum(l))
       prod(nil()) -> s(0())
       prod(cons(x,l)) -> *(x,prod(l))
     Qed