Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715229
details
property
value
status
complete
benchmark
Ex2_Luc02a_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n003.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.595258951187 seconds
cpu usage
1.045001346
max memory
1.85688064E8
stage attributes
key
value
output-size
4221
starexec-result
YES
output
/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: terms(N) -> cons(recip(sqr(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)) -> cons(Y) 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) TRS: terms(N) -> cons(recip(sqr(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)) -> cons(Y) 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) TRS: terms(N) -> cons(recip(sqr(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)) -> cons(Y) graph: add#(s(X),Y) -> add#(X,Y) -> add#(s(X),Y) -> add#(X,Y) dbl#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> dbl#(X) sqr#(s(X)) -> add#(sqr(X),dbl(X)) -> add#(s(X),Y) -> add#(X,Y) sqr#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> dbl#(X) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> add#(sqr(X),dbl(X)) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> sqr#(X) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> dbl#(X) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> add#(sqr(X),dbl(X)) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> sqr#(X) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> dbl#(X) SCC Processor: #sccs: 3 #rules: 3 #arcs: 10/36 DPs: sqr#(s(X)) -> sqr#(X) TRS: terms(N) -> cons(recip(sqr(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)) -> cons(Y) Subterm Criterion Processor: simple projection: pi(sqr#) = 0 problem: DPs: TRS: terms(N) -> cons(recip(sqr(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)) -> cons(Y) Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472