details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0464509 seconds
cpu usage	0.042495
user time	0.019462
system time	0.023033
max virtual memory	113188.0
max residence set size	5452.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S XS:S) (RULES a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros ) Problem 1: Dependency Pairs Processor: -> Pairs: A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) MARK(zeros) -> A__ZEROS -> Rules: a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros Problem 1: SCC Processor: -> Pairs: A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) MARK(zeros) -> A__ZEROS -> Rules: a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) ->->-> Rules: a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros Problem 1: Reduction Pair Processor: -> Pairs: A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) -> Rules: a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros -> Usable rules: a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros ->Interpretation type: Linear ->Coefficients: Natural Numbers popout

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

job log

popout

actions

all output return to TRS Standard