/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:
 from(X) -> cons(X,n__from(s(X)))
 2ndspos(0(),Z) -> rnil()
 2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
 2ndsneg(0(),Z) -> rnil()
 2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
 pi(X) -> 2ndspos(X,from(0()))
 plus(0(),Y) -> Y
 plus(s(X),Y) -> s(plus(X,Y))
 times(0(),Y) -> 0()
 times(s(X),Y) -> plus(Y,times(X,Y))
 square(X) -> times(X,X)
 from(X) -> n__from(X)
 cons(X1,X2) -> n__cons(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__cons(X1,X2)) -> cons(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   from#(X) -> cons#(X,n__from(s(X)))
   2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
   2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z))
   2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
   2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
   2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z))
   2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
   pi#(X) -> from#(0())
   pi#(X) -> 2ndspos#(X,from(0()))
   plus#(s(X),Y) -> plus#(X,Y)
   times#(s(X),Y) -> times#(X,Y)
   times#(s(X),Y) -> plus#(Y,times(X,Y))
   square#(X) -> times#(X,X)
   activate#(n__from(X)) -> from#(X)
   activate#(n__cons(X1,X2)) -> cons#(X1,X2)
  TRS:
   from(X) -> cons(X,n__from(s(X)))
   2ndspos(0(),Z) -> rnil()
   2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
   2ndsneg(0(),Z) -> rnil()
   2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
   pi(X) -> 2ndspos(X,from(0()))
   plus(0(),Y) -> Y
   plus(s(X),Y) -> s(plus(X,Y))
   times(0(),Y) -> 0()
   times(s(X),Y) -> plus(Y,times(X,Y))
   square(X) -> times(X,X)
   from(X) -> n__from(X)
   cons(X1,X2) -> n__cons(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(n__cons(X1,X2)) -> cons(X1,X2)
   activate(X) -> X
  TDG Processor:
   DPs:
    from#(X) -> cons#(X,n__from(s(X)))
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z))
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z))
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
    pi#(X) -> from#(0())
    pi#(X) -> 2ndspos#(X,from(0()))
    plus#(s(X),Y) -> plus#(X,Y)
    times#(s(X),Y) -> times#(X,Y)
    times#(s(X),Y) -> plus#(Y,times(X,Y))
    square#(X) -> times#(X,X)
    activate#(n__from(X)) -> from#(X)
    activate#(n__cons(X1,X2)) -> cons#(X1,X2)
   TRS:
    from(X) -> cons(X,n__from(s(X)))
    2ndspos(0(),Z) -> rnil()
    2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
    2ndsneg(0(),Z) -> rnil()
    2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
    pi(X) -> 2ndspos(X,from(0()))
    plus(0(),Y) -> Y
    plus(s(X),Y) -> s(plus(X,Y))
    times(0(),Y) -> 0()
    times(s(X),Y) -> plus(Y,times(X,Y))
    square(X) -> times(X,X)
    from(X) -> n__from(X)
    cons(X1,X2) -> n__cons(X1,X2)
    activate(n__from(X)) -> from(X)
    activate(n__cons(X1,X2)) -> cons(X1,X2)
    activate(X) -> X
   graph:
    square#(X) -> times#(X,X) -> times#(s(X),Y) -> plus#(Y,times(X,Y))
    square#(X) -> times#(X,X) -> times#(s(X),Y) -> times#(X,Y)
    times#(s(X),Y) -> times#(X,Y) ->
    times#(s(X),Y) -> plus#(Y,times(X,Y))
    times#(s(X),Y) -> times#(X,Y) ->
    times#(s(X),Y) -> times#(X,Y)
    times#(s(X),Y) -> plus#(Y,times(X,Y)) -> plus#(s(X),Y) -> plus#(X,Y)
    plus#(s(X),Y) -> plus#(X,Y) -> plus#(s(X),Y) -> plus#(X,Y)
    pi#(X) -> 2ndspos#(X,from(0())) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
    pi#(X) -> 2ndspos#(X,from(0())) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z))
    pi#(X) -> 2ndspos#(X,from(0())) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
    pi#(X) -> from#(0()) ->
    from#(X) -> cons#(X,n__from(s(X)))
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y) ->
    activate#(n__cons(X1,X2)) -> cons#(X1,X2)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y) ->
    activate#(n__from(X)) -> from#(X)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z) ->
    activate#(n__cons(X1,X2)) -> cons#(X1,X2)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z) ->
    activate#(n__from(X)) -> from#(X)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z)) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z)) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z))
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z)) ->
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
    activate#(n__from(X)) -> from#(X) ->
    from#(X) -> cons#(X,n__from(s(X)))
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z)) ->
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z)) ->
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z))
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z)) ->
    2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y) ->
    activate#(n__cons(X1,X2)) -> cons#(X1,X2)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Y) ->
    activate#(n__from(X)) -> from#(X)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z) ->
    activate#(n__cons(X1,X2)) -> cons#(X1,X2)
    2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> activate#(Z) -> activate#(n__from(X)) -> from#(X)
   SCC Processor:
    #sccs: 3
    #rules: 4
    #arcs: 25/225
    DPs:
     2ndspos#(s(N),cons(X,n__cons(Y,Z))) -> 2ndsneg#(N,activate(Z))
     2ndsneg#(s(N),cons(X,n__cons(Y,Z))) -> 2ndspos#(N,activate(Z))
    TRS:
     from(X) -> cons(X,n__from(s(X)))
     2ndspos(0(),Z) -> rnil()
     2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
     2ndsneg(0(),Z) -> rnil()
     2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
     pi(X) -> 2ndspos(X,from(0()))
     plus(0(),Y) -> Y
     plus(s(X),Y) -> s(plus(X,Y))
     times(0(),Y) -> 0()
     times(s(X),Y) -> plus(Y,times(X,Y))
     square(X) -> times(X,X)
     from(X) -> n__from(X)
     cons(X1,X2) -> n__cons(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__cons(X1,X2)) -> cons(X1,X2)
     activate(X) -> X
    Subterm Criterion Processor:
     simple projection:
      pi(2ndspos#) = 0
      pi(2ndsneg#) = 0
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(s(X)))
       2ndspos(0(),Z) -> rnil()
       2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
       2ndsneg(0(),Z) -> rnil()
       2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
       pi(X) -> 2ndspos(X,from(0()))
       plus(0(),Y) -> Y
       plus(s(X),Y) -> s(plus(X,Y))
       times(0(),Y) -> 0()
       times(s(X),Y) -> plus(Y,times(X,Y))
       square(X) -> times(X,X)
       from(X) -> n__from(X)
       cons(X1,X2) -> n__cons(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__cons(X1,X2)) -> cons(X1,X2)
       activate(X) -> X
     Qed
    
    DPs:
     times#(s(X),Y) -> times#(X,Y)
    TRS:
     from(X) -> cons(X,n__from(s(X)))
     2ndspos(0(),Z) -> rnil()
     2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
     2ndsneg(0(),Z) -> rnil()
     2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
     pi(X) -> 2ndspos(X,from(0()))
     plus(0(),Y) -> Y
     plus(s(X),Y) -> s(plus(X,Y))
     times(0(),Y) -> 0()
     times(s(X),Y) -> plus(Y,times(X,Y))
     square(X) -> times(X,X)
     from(X) -> n__from(X)
     cons(X1,X2) -> n__cons(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__cons(X1,X2)) -> cons(X1,X2)
     activate(X) -> X
    Subterm Criterion Processor:
     simple projection:
      pi(times#) = 0
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(s(X)))
       2ndspos(0(),Z) -> rnil()
       2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
       2ndsneg(0(),Z) -> rnil()
       2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
       pi(X) -> 2ndspos(X,from(0()))
       plus(0(),Y) -> Y
       plus(s(X),Y) -> s(plus(X,Y))
       times(0(),Y) -> 0()
       times(s(X),Y) -> plus(Y,times(X,Y))
       square(X) -> times(X,X)
       from(X) -> n__from(X)
       cons(X1,X2) -> n__cons(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__cons(X1,X2)) -> cons(X1,X2)
       activate(X) -> X
     Qed
    
    DPs:
     plus#(s(X),Y) -> plus#(X,Y)
    TRS:
     from(X) -> cons(X,n__from(s(X)))
     2ndspos(0(),Z) -> rnil()
     2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
     2ndsneg(0(),Z) -> rnil()
     2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
     pi(X) -> 2ndspos(X,from(0()))
     plus(0(),Y) -> Y
     plus(s(X),Y) -> s(plus(X,Y))
     times(0(),Y) -> 0()
     times(s(X),Y) -> plus(Y,times(X,Y))
     square(X) -> times(X,X)
     from(X) -> n__from(X)
     cons(X1,X2) -> n__cons(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__cons(X1,X2)) -> cons(X1,X2)
     activate(X) -> X
    Subterm Criterion Processor:
     simple projection:
      pi(plus#) = 0
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(s(X)))
       2ndspos(0(),Z) -> rnil()
       2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
       2ndsneg(0(),Z) -> rnil()
       2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
       pi(X) -> 2ndspos(X,from(0()))
       plus(0(),Y) -> Y
       plus(s(X),Y) -> s(plus(X,Y))
       times(0(),Y) -> 0()
       times(s(X),Y) -> plus(Y,times(X,Y))
       square(X) -> times(X,X)
       from(X) -> n__from(X)
       cons(X1,X2) -> n__cons(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__cons(X1,X2)) -> cons(X1,X2)
       activate(X) -> X
     Qed