details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0477829 seconds
cpu usage	0.038642
user time	0.018528
system time	0.020114
max virtual memory	113188.0
max residence set size	5400.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S) (RULES a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(0)) -> 0 a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) A__F(s(0)) -> A__P(s(0)) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> A__P(mark(X:S)) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(0)) -> 0 a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) A__F(s(0)) -> A__P(s(0)) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> A__P(mark(X:S)) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(0)) -> 0 a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) ->->-> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(0)) -> 0 a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ->->Cycle: ->->-> Pairs: MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(0)) -> 0 a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost