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	n014.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.213201 seconds
cpu usage	0.18493
user time	0.115571
system time	0.069359
max virtual memory	113176.0
max residence set size	5796.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.21 YES 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 (VAR X Y) 0.00/0.21 (STRATEGY CONTEXTSENSITIVE 0.00/0.21 (div 1 2) 0.00/0.21 (gt 1 2) 0.00/0.21 (if 1) 0.00/0.21 (minus 1 2) 0.00/0.21 (p 1) 0.00/0.21 (0) 0.00/0.21 (false) 0.00/0.21 (s 1) 0.00/0.21 (true) 0.00/0.21 ) 0.00/0.21 (RULES 0.00/0.21 div(0,s(Y)) -> 0 0.00/0.21 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) 0.00/0.21 gt(0,Y) -> false 0.00/0.21 gt(s(X),0) -> true 0.00/0.21 gt(s(X),s(Y)) -> gt(X,Y) 0.00/0.21 if(false,X,Y) -> Y 0.00/0.21 if(true,X,Y) -> X 0.00/0.21 minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 p(0) -> 0 0.00/0.21 p(s(X)) -> X 0.00/0.21 ) 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 Innermost Equivalent Processor: 0.00/0.21 -> Rules: 0.00/0.21 div(0,s(Y)) -> 0 0.00/0.21 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) 0.00/0.21 gt(0,Y) -> false 0.00/0.21 gt(s(X),0) -> true 0.00/0.21 gt(s(X),s(Y)) -> gt(X,Y) 0.00/0.21 if(false,X,Y) -> Y 0.00/0.21 if(true,X,Y) -> X 0.00/0.21 minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 p(0) -> 0 0.00/0.21 p(s(X)) -> X 0.00/0.21 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 0.00/0.21 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 Dependency Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) 0.00/0.21 DIV(s(X),s(Y)) -> MINUS(X,Y) 0.00/0.21 GT(s(X),s(Y)) -> GT(X,Y) 0.00/0.21 IF(false,X,Y) -> Y 0.00/0.21 IF(true,X,Y) -> X 0.00/0.21 MINUS(X,Y) -> GT(Y,0) 0.00/0.21 MINUS(X,Y) -> IF(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 -> Rules: 0.00/0.21 div(0,s(Y)) -> 0 0.00/0.21 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) 0.00/0.21 gt(0,Y) -> false 0.00/0.21 gt(s(X),0) -> true 0.00/0.21 gt(s(X),s(Y)) -> gt(X,Y) 0.00/0.21 if(false,X,Y) -> Y 0.00/0.21 if(true,X,Y) -> X 0.00/0.21 minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 p(0) -> 0 0.00/0.21 p(s(X)) -> X 0.00/0.21 -> Unhiding Rules: 0.00/0.21 minus(p(X),p(Y)) -> MINUS(p(X),p(Y)) 0.00/0.21 minus(p(X),p(Y)) -> P(X) 0.00/0.21 minus(p(X),p(Y)) -> P(Y) 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) 0.00/0.21 DIV(s(X),s(Y)) -> MINUS(X,Y) 0.00/0.21 GT(s(X),s(Y)) -> GT(X,Y) 0.00/0.21 IF(false,X,Y) -> Y 0.00/0.21 IF(true,X,Y) -> X 0.00/0.21 MINUS(X,Y) -> GT(Y,0) 0.00/0.21 MINUS(X,Y) -> IF(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 -> Rules: 0.00/0.21 div(0,s(Y)) -> 0 0.00/0.21 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) 0.00/0.21 gt(0,Y) -> false 0.00/0.21 gt(s(X),0) -> true 0.00/0.21 gt(s(X),s(Y)) -> gt(X,Y) 0.00/0.21 if(false,X,Y) -> Y 0.00/0.21 if(true,X,Y) -> X 0.00/0.21 minus(X,Y) -> if(gt(Y,0),minus(p(X),p(Y)),X) 0.00/0.21 p(0) -> 0 0.00/0.21 p(s(X)) -> X 0.00/0.21 -> Unhiding rules: 0.00/0.21 minus(p(X),p(Y)) -> MINUS(p(X),p(Y)) 0.00/0.21 minus(p(X),p(Y)) -> P(X) 0.00/0.21 minus(p(X),p(Y)) -> P(Y) 0.00/0.21 ->Strongly Connected Components: popout

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

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07