details

property	value
status	complete
benchmark	csrdiv.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	Maude_06

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.280193 seconds
cpu usage	0.193074
user time	0.101699
system time	0.091375
max virtual memory	113188.0
max residence set size	5792.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR X Y) (STRATEGY CONTEXTSENSITIVE (div 1 2) (gt 1 2) (if 1) (minus 1 2) (p 1) (0) (false) (s 1) (true) ) (RULES div(0,s(Y)) -> 0 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) gt(0,Y) -> false gt(s(X),0) -> true gt(s(X),s(Y)) -> gt(X,Y) if(false,X,Y) -> Y if(true,X,Y) -> X minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) p(0) -> 0 p(s(X)) -> X ) Problem 1: Innermost Equivalent Processor: -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) gt(0,Y) -> false gt(s(X),0) -> true gt(s(X),s(Y)) -> gt(X,Y) if(false,X,Y) -> Y if(true,X,Y) -> X minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) 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: DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) DIV(s(X),s(Y)) -> MINUS(X,Y) GT(s(X),s(Y)) -> GT(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X MINUS(X,Y) -> GT(Y,0) MINUS(X,Y) -> IF(gt(Y,0),minus(p(X),p(Y)),X) -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) gt(0,Y) -> false gt(s(X),0) -> true gt(s(X),s(Y)) -> gt(X,Y) if(false,X,Y) -> Y if(true,X,Y) -> X minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) p(0) -> 0 p(s(X)) -> X -> Unhiding Rules: minus(p(X),p(Y)) -> MINUS(p(X),p(Y)) minus(p(X),p(Y)) -> P(X) minus(p(X),p(Y)) -> P(Y) Problem 1: SCC Processor: -> Pairs: DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) DIV(s(X),s(Y)) -> MINUS(X,Y) GT(s(X),s(Y)) -> GT(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X MINUS(X,Y) -> GT(Y,0) MINUS(X,Y) -> IF(gt(Y,0),minus(p(X),p(Y)),X) -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) gt(0,Y) -> false gt(s(X),0) -> true gt(s(X),s(Y)) -> gt(X,Y) if(false,X,Y) -> Y if(true,X,Y) -> X minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) p(0) -> 0 p(s(X)) -> X -> Unhiding rules: minus(p(X),p(Y)) -> MINUS(p(X),p(Y)) minus(p(X),p(Y)) -> P(X) minus(p(X),p(Y)) -> P(Y) ->Strongly Connected Components: popout

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

job log

popout

actions

all output return to TRS Contextsensitive