details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.561756 seconds
cpu usage	0.092645
user time	0.068091
system time	0.024554
max virtual memory	113188.0
max residence set size	6768.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) 2: a__sqr(0()) -> 0() 3: a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) 4: a__dbl(0()) -> 0() 5: a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) 6: a__add(0(),X) -> mark(X) 7: a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) 8: a__first(0(),X) -> nil() 9: a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) 10: a__half(0()) -> 0() 11: a__half(s(0())) -> 0() 12: a__half(s(s(X))) -> s(a__half(mark(X))) 13: a__half(dbl(X)) -> mark(X) 14: mark(terms(X)) -> a__terms(mark(X)) 15: mark(sqr(X)) -> a__sqr(mark(X)) 16: mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) 17: mark(dbl(X)) -> a__dbl(mark(X)) 18: mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) 19: mark(half(X)) -> a__half(mark(X)) 20: mark(cons(X1,X2)) -> cons(mark(X1),X2) 21: mark(recip(X)) -> recip(mark(X)) 22: mark(s(X)) -> s(mark(X)) 23: mark(0()) -> 0() 24: mark(nil()) -> nil() 25: a__terms(X) -> terms(X) 26: a__sqr(X) -> sqr(X) 27: a__add(X1,X2) -> add(X1,X2) 28: a__dbl(X) -> dbl(X) 29: a__first(X1,X2) -> first(X1,X2) 30: a__half(X) -> half(X) Number of strict rules: 30 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__add(0(),X) -> #mark(X) #2: #a__half(dbl(X)) -> #mark(X) #3: #a__first(s(X),cons(Y,Z)) -> #mark(Y) #4: #a__half(s(s(X))) -> #a__half(mark(X)) #5: #a__half(s(s(X))) -> #mark(X) #6: #mark(terms(X)) -> #a__terms(mark(X)) #7: #mark(terms(X)) -> #mark(X) #8: #mark(cons(X1,X2)) -> #mark(X1) #9: #a__add(s(X),Y) -> #a__add(mark(X),mark(Y)) #10: #a__add(s(X),Y) -> #mark(X) #11: #a__add(s(X),Y) -> #mark(Y) #12: #a__dbl(s(X)) -> #a__dbl(mark(X)) #13: #a__dbl(s(X)) -> #mark(X) #14: #mark(s(X)) -> #mark(X) #15: #mark(dbl(X)) -> #a__dbl(mark(X)) #16: #mark(dbl(X)) -> #mark(X) #17: #mark(half(X)) -> #a__half(mark(X)) #18: #mark(half(X)) -> #mark(X) #19: #mark(recip(X)) -> #mark(X) #20: #mark(add(X1,X2)) -> #a__add(mark(X1),mark(X2)) #21: #mark(add(X1,X2)) -> #mark(X1) #22: #mark(add(X1,X2)) -> #mark(X2) #23: #a__sqr(s(X)) -> #a__add(a__sqr(mark(X)),a__dbl(mark(X))) #24: #a__sqr(s(X)) -> #a__sqr(mark(X)) #25: #a__sqr(s(X)) -> #mark(X) #26: #a__sqr(s(X)) -> #a__dbl(mark(X)) #27: #a__sqr(s(X)) -> #mark(X) #28: #a__terms(N) -> #a__sqr(mark(N)) #29: #a__terms(N) -> #mark(N) #30: #mark(sqr(X)) -> #a__sqr(mark(X)) #31: #mark(sqr(X)) -> #mark(X) #32: #mark(first(X1,X2)) -> #a__first(mark(X1),mark(X2)) #33: #mark(first(X1,X2)) -> #mark(X1) #34: #mark(first(X1,X2)) -> #mark(X2) Number of SCCs: 1, DPs: 34 SCC { #1..34 } POLO(Sum)... POLO(max)... succeeded. s w: x1 #a__first w: max(x1 + 20205, x2 + 20203) recip w: x1 + 1 dbl w: x1 a__half w: x1 #a__add w: max(x1 + 19335, x2 + 19335) a__add w: max(x1, x2) a__dbl w: x1 #a__half w: x1 + 19335 a__sqr w: x1 half w: x1 #a__terms w: x1 + 19336 #mark w: x1 + 19335 0 w: 0 nil w: 0 #a__dbl w: x1 + 19335 mark w: x1 first w: max(x1 + 870, x2 + 869) a__first w: max(x1 + 870, x2 + 869) cons w: max(x1 + 1) add w: max(x1, x2) sqr w: x1 a__terms w: x1 + 29535 #a__sqr w: x1 + 19335 terms w: x1 + 29535 USABLE RULES: { 1..30 } Removed DPs: #3 #6..8 #19 #28 #29 #33 #34 popout

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

job log

popout

actions

all output return to TRS Standard