TRS Stand 20472 pair #381716659

details

property	value
status	complete
benchmark	ExSec11_1_Luc02a_Z.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n016.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	0.813215017319 seconds
cpu usage	1.674387356
max memory	2.76471808E8

stage attributes

key	value
output-size	10663
starexec-result	YES

output

/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:
 terms(N) -> cons(recip(sqr(N)),n__terms(s(N)))
 sqr(0()) -> 0()
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 dbl(0()) -> 0()
 dbl(s(X)) -> s(s(dbl(X)))
 add(0(),X) -> X
 add(s(X),Y) -> s(add(X,Y))
 first(0(),X) -> nil()
 first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
 half(0()) -> 0()
 half(s(0())) -> 0()
 half(s(s(X))) -> s(half(X))
 half(dbl(X)) -> X
 terms(X) -> n__terms(X)
 first(X1,X2) -> n__first(X1,X2)
 activate(n__terms(X)) -> terms(X)
 activate(n__first(X1,X2)) -> first(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   terms#(N) -> sqr#(N)
   sqr#(s(X)) -> dbl#(X)
   sqr#(s(X)) -> sqr#(X)
   sqr#(s(X)) -> add#(sqr(X),dbl(X))
   dbl#(s(X)) -> dbl#(X)
   add#(s(X),Y) -> add#(X,Y)
   first#(s(X),cons(Y,Z)) -> activate#(Z)
   half#(s(s(X))) -> half#(X)
   activate#(n__terms(X)) -> terms#(X)
   activate#(n__first(X1,X2)) -> first#(X1,X2)
  TRS:
   terms(N) -> cons(recip(sqr(N)),n__terms(s(N)))
   sqr(0()) -> 0()
   sqr(s(X)) -> s(add(sqr(X),dbl(X)))
   dbl(0()) -> 0()
   dbl(s(X)) -> s(s(dbl(X)))
   add(0(),X) -> X
   add(s(X),Y) -> s(add(X,Y))
   first(0(),X) -> nil()
   first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
   half(0()) -> 0()
   half(s(0())) -> 0()
   half(s(s(X))) -> s(half(X))
   half(dbl(X)) -> X
   terms(X) -> n__terms(X)
   first(X1,X2) -> n__first(X1,X2)
   activate(n__terms(X)) -> terms(X)
   activate(n__first(X1,X2)) -> first(X1,X2)
   activate(X) -> X
  TDG Processor:
   DPs:
    terms#(N) -> sqr#(N)
    sqr#(s(X)) -> dbl#(X)
    sqr#(s(X)) -> sqr#(X)
    sqr#(s(X)) -> add#(sqr(X),dbl(X))
    dbl#(s(X)) -> dbl#(X)
    add#(s(X),Y) -> add#(X,Y)
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    half#(s(s(X))) -> half#(X)
    activate#(n__terms(X)) -> terms#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2)
   TRS:
    terms(N) -> cons(recip(sqr(N)),n__terms(s(N)))
    sqr(0()) -> 0()
    sqr(s(X)) -> s(add(sqr(X),dbl(X)))
    dbl(0()) -> 0()
    dbl(s(X)) -> s(s(dbl(X)))
    add(0(),X) -> X
    add(s(X),Y) -> s(add(X,Y))
    first(0(),X) -> nil()
    first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
    half(0()) -> 0()
    half(s(0())) -> 0()
    half(s(s(X))) -> s(half(X))
    half(dbl(X)) -> X
    terms(X) -> n__terms(X)
    first(X1,X2) -> n__first(X1,X2)
    activate(n__terms(X)) -> terms(X)
    activate(n__first(X1,X2)) -> first(X1,X2)
    activate(X) -> X
   graph:
    half#(s(s(X))) -> half#(X) ->
    half#(s(s(X))) -> half#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2) ->
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    activate#(n__terms(X)) -> terms#(X) ->
    terms#(N) -> sqr#(N)
    first#(s(X),cons(Y,Z)) -> activate#(Z) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Stand 20472