details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.420536994934 seconds
cpu usage	0.44112665
max memory	1.1268096E7

stage attributes

key	value
output-size	13685
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N)))) 2: active(sqr(0())) -> mark(0()) 3: active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X)))) 4: active(dbl(0())) -> mark(0()) 5: active(dbl(s(X))) -> mark(s(s(dbl(X)))) 6: active(add(0(),X)) -> mark(X) 7: active(add(s(X),Y)) -> mark(s(add(X,Y))) 8: active(first(0(),X)) -> mark(nil()) 9: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) 10: active(terms(X)) -> terms(active(X)) 11: active(cons(X1,X2)) -> cons(active(X1),X2) 12: active(recip(X)) -> recip(active(X)) 13: active(sqr(X)) -> sqr(active(X)) 14: active(add(X1,X2)) -> add(active(X1),X2) 15: active(add(X1,X2)) -> add(X1,active(X2)) 16: active(dbl(X)) -> dbl(active(X)) 17: active(first(X1,X2)) -> first(active(X1),X2) 18: active(first(X1,X2)) -> first(X1,active(X2)) 19: terms(mark(X)) -> mark(terms(X)) 20: cons(mark(X1),X2) -> mark(cons(X1,X2)) 21: recip(mark(X)) -> mark(recip(X)) 22: sqr(mark(X)) -> mark(sqr(X)) 23: add(mark(X1),X2) -> mark(add(X1,X2)) 24: add(X1,mark(X2)) -> mark(add(X1,X2)) 25: dbl(mark(X)) -> mark(dbl(X)) 26: first(mark(X1),X2) -> mark(first(X1,X2)) 27: first(X1,mark(X2)) -> mark(first(X1,X2)) 28: proper(terms(X)) -> terms(proper(X)) 29: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 30: proper(recip(X)) -> recip(proper(X)) 31: proper(sqr(X)) -> sqr(proper(X)) 32: proper(s(X)) -> s(proper(X)) 33: proper(0()) -> ok(0()) 34: proper(add(X1,X2)) -> add(proper(X1),proper(X2)) 35: proper(dbl(X)) -> dbl(proper(X)) 36: proper(first(X1,X2)) -> first(proper(X1),proper(X2)) 37: proper(nil()) -> ok(nil()) 38: terms(ok(X)) -> ok(terms(X)) 39: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 40: recip(ok(X)) -> ok(recip(X)) 41: sqr(ok(X)) -> ok(sqr(X)) 42: s(ok(X)) -> ok(s(X)) 43: add(ok(X1),ok(X2)) -> ok(add(X1,X2)) 44: dbl(ok(X)) -> ok(dbl(X)) 45: first(ok(X1),ok(X2)) -> ok(first(X1,X2)) 46: top(mark(X)) -> top(proper(X)) 47: top(ok(X)) -> top(active(X)) Number of strict rules: 47 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #add(ok(X1),ok(X2)) -> #add(X1,X2) #2: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #3: #proper(cons(X1,X2)) -> #proper(X1) #4: #proper(cons(X1,X2)) -> #proper(X2) #5: #proper(dbl(X)) -> #dbl(proper(X)) #6: #proper(dbl(X)) -> #proper(X) #7: #top(mark(X)) -> #top(proper(X)) #8: #top(mark(X)) -> #proper(X) #9: #s(ok(X)) -> #s(X) #10: #sqr(ok(X)) -> #sqr(X) #11: #top(ok(X)) -> #top(active(X)) #12: #top(ok(X)) -> #active(X) #13: #terms(ok(X)) -> #terms(X) #14: #recip(ok(X)) -> #recip(X) #15: #active(sqr(X)) -> #sqr(active(X)) #16: #active(sqr(X)) -> #active(X) #17: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z)) #18: #active(first(s(X),cons(Y,Z))) -> #first(X,Z) #19: #active(cons(X1,X2)) -> #cons(active(X1),X2) #20: #active(cons(X1,X2)) -> #active(X1) #21: #add(X1,mark(X2)) -> #add(X1,X2) #22: #add(mark(X1),X2) -> #add(X1,X2) #23: #first(ok(X1),ok(X2)) -> #first(X1,X2) #24: #active(recip(X)) -> #recip(active(X)) #25: #active(recip(X)) -> #active(X) #26: #proper(sqr(X)) -> #sqr(proper(X)) #27: #proper(sqr(X)) -> #proper(X) #28: #active(add(X1,X2)) -> #add(active(X1),X2) #29: #active(add(X1,X2)) -> #active(X1) #30: #proper(recip(X)) -> #recip(proper(X)) #31: #proper(recip(X)) -> #proper(X) #32: #dbl(mark(X)) -> #dbl(X) #33: #cons(mark(X1),X2) -> #cons(X1,X2) #34: #active(add(s(X),Y)) -> #s(add(X,Y)) #35: #active(add(s(X),Y)) -> #add(X,Y) #36: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #37: #active(terms(X)) -> #terms(active(X)) #38: #active(terms(X)) -> #active(X) #39: #active(dbl(s(X))) -> #s(s(dbl(X))) #40: #active(dbl(s(X))) -> #s(dbl(X)) #41: #active(dbl(s(X))) -> #dbl(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472