details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.200654 seconds
cpu usage	0.165734
user time	0.103914
system time	0.06182
max virtual memory	113188.0
max residence set size	5596.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR X Y) (STRATEGY CONTEXTSENSITIVE (diff 1 2) (if 1) (leq 1 2) (p 1) (0) (false) (s 1) (true) ) (RULES diff(X,Y) -> if(leq(X,Y),0,s(diff(p(X),Y))) if(false,X,Y) -> Y if(true,X,Y) -> X leq(0,Y) -> true leq(s(X),0) -> false leq(s(X),s(Y)) -> leq(X,Y) p(0) -> 0 p(s(X)) -> X ) Problem 1: Innermost Equivalent Processor: -> Rules: diff(X,Y) -> if(leq(X,Y),0,s(diff(p(X),Y))) if(false,X,Y) -> Y if(true,X,Y) -> X leq(0,Y) -> true leq(s(X),0) -> false leq(s(X),s(Y)) -> leq(X,Y) p(0) -> 0 p(s(X)) -> X -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: DIFF(X,Y) -> IF(leq(X,Y),0,s(diff(p(X),Y))) DIFF(X,Y) -> LEQ(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X LEQ(s(X),s(Y)) -> LEQ(X,Y) -> Rules: diff(X,Y) -> if(leq(X,Y),0,s(diff(p(X),Y))) if(false,X,Y) -> Y if(true,X,Y) -> X leq(0,Y) -> true leq(s(X),0) -> false leq(s(X),s(Y)) -> leq(X,Y) p(0) -> 0 p(s(X)) -> X -> Unhiding Rules: s(diff(p(X),Y)) -> DIFF(p(X),Y) s(diff(p(X),Y)) -> P(X) Problem 1: SCC Processor: -> Pairs: DIFF(X,Y) -> IF(leq(X,Y),0,s(diff(p(X),Y))) DIFF(X,Y) -> LEQ(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X LEQ(s(X),s(Y)) -> LEQ(X,Y) -> Rules: diff(X,Y) -> if(leq(X,Y),0,s(diff(p(X),Y))) if(false,X,Y) -> Y if(true,X,Y) -> X leq(0,Y) -> true leq(s(X),0) -> false leq(s(X),s(Y)) -> leq(X,Y) p(0) -> 0 p(s(X)) -> X -> Unhiding rules: s(diff(p(X),Y)) -> DIFF(p(X),Y) s(diff(p(X),Y)) -> P(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LEQ(s(X),s(Y)) -> LEQ(X,Y) ->->-> Rules: diff(X,Y) -> if(leq(X,Y),0,s(diff(p(X),Y))) if(false,X,Y) -> Y if(true,X,Y) -> X leq(0,Y) -> true leq(s(X),0) -> false leq(s(X),s(Y)) -> leq(X,Y) p(0) -> 0 p(s(X)) -> X ->->-> Unhiding rules: Empty ->->Cycle: popout

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

job log

popout

actions

all output return to TRS Contextsensitive