details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	183.908 seconds
cpu usage	176.035
user time	164.087
system time	11.9484
max virtual memory	846064.0
max residence set size	123868.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S N:S X:S X1:S X2:S Y:S Z:S) (RULES a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(a__add(mark(X:S),mark(Y:S))) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__dbl(0) -> 0 a__dbl(s(X:S)) -> s(s(a__dbl(mark(X:S)))) a__dbl(X:S) -> dbl(X:S) a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__sqr(0) -> 0 a__sqr(s(X:S)) -> s(a__add(a__sqr(mark(X:S)),a__dbl(mark(X:S)))) a__sqr(X:S) -> sqr(X:S) a__terms(N:S) -> cons(recip(a__sqr(mark(N:S))),terms(s(N:S))) a__terms(X:S) -> terms(X:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),mark(X2:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(dbl(X:S)) -> a__dbl(mark(X:S)) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(nil) -> nil mark(recip(X:S)) -> recip(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(sqr(X:S)) -> a__sqr(mark(X:S)) mark(terms(X:S)) -> a__terms(mark(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__ADD(s(X:S),Y:S) -> A__ADD(mark(X:S),mark(Y:S)) A__ADD(s(X:S),Y:S) -> MARK(X:S) A__ADD(s(X:S),Y:S) -> MARK(Y:S) A__DBL(s(X:S)) -> A__DBL(mark(X:S)) A__DBL(s(X:S)) -> MARK(X:S) A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) A__SQR(s(X:S)) -> A__ADD(a__sqr(mark(X:S)),a__dbl(mark(X:S))) A__SQR(s(X:S)) -> A__DBL(mark(X:S)) A__SQR(s(X:S)) -> A__SQR(mark(X:S)) A__SQR(s(X:S)) -> MARK(X:S) A__TERMS(N:S) -> A__SQR(mark(N:S)) A__TERMS(N:S) -> MARK(N:S) MARK(add(X1:S,X2:S)) -> A__ADD(mark(X1:S),mark(X2:S)) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(add(X1:S,X2:S)) -> MARK(X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(dbl(X:S)) -> A__DBL(mark(X:S)) MARK(dbl(X:S)) -> MARK(X:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(recip(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) MARK(sqr(X:S)) -> A__SQR(mark(X:S)) MARK(sqr(X:S)) -> MARK(X:S) MARK(terms(X:S)) -> A__TERMS(mark(X:S)) MARK(terms(X:S)) -> MARK(X:S) -> Rules: a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(a__add(mark(X:S),mark(Y:S))) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__dbl(0) -> 0 a__dbl(s(X:S)) -> s(s(a__dbl(mark(X:S)))) a__dbl(X:S) -> dbl(X:S) a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__sqr(0) -> 0 a__sqr(s(X:S)) -> s(a__add(a__sqr(mark(X:S)),a__dbl(mark(X:S)))) a__sqr(X:S) -> sqr(X:S) a__terms(N:S) -> cons(recip(a__sqr(mark(N:S))),terms(s(N:S))) a__terms(X:S) -> terms(X:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),mark(X2:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(dbl(X:S)) -> a__dbl(mark(X:S)) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(nil) -> nil mark(recip(X:S)) -> recip(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(sqr(X:S)) -> a__sqr(mark(X:S)) mark(terms(X:S)) -> a__terms(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__ADD(s(X:S),Y:S) -> A__ADD(mark(X:S),mark(Y:S)) A__ADD(s(X:S),Y:S) -> MARK(X:S) A__ADD(s(X:S),Y:S) -> MARK(Y:S) A__DBL(s(X:S)) -> A__DBL(mark(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost