details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.175728 seconds
cpu usage	0.159497
user time	0.097635
system time	0.061862
max virtual memory	113188.0
max residence set size	6048.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S Y:S) (RULES +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: +#(X:S,s(Y:S)) -> +#(X:S,Y:S) F(0,s(0),X:S) -> +#(X:S,X:S) F(0,s(0),X:S) -> F(X:S,+(X:S,X:S),X:S) -> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S Problem 1: SCC Processor: -> Pairs: +#(X:S,s(Y:S)) -> +#(X:S,Y:S) F(0,s(0),X:S) -> +#(X:S,X:S) F(0,s(0),X:S) -> F(X:S,+(X:S,X:S),X:S) -> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: +#(X:S,s(Y:S)) -> +#(X:S,Y:S) ->->-> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->->Cycle: ->->-> Pairs: F(0,s(0),X:S) -> F(X:S,+(X:S,X:S),X:S) ->->-> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: +#(X:S,s(Y:S)) -> +#(X:S,Y:S) -> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Projection: pi(+#) = 2 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: +(X:S,0) -> X:S +(X:S,s(Y:S)) -> s(+(X:S,Y:S)) f(0,s(0),X:S) -> f(X:S,+(X:S,X:S),X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: Reduction Pair Processor: -> Pairs: F(0,s(0),X:S) -> F(X:S,+(X:S,X:S),X:S) -> Rules: popout

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

job log

popout

actions

all output return to TRS Innermost