Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Contextsensitive 2019-03-21 05.07 pair #429997100
details
property
value
status
complete
benchmark
emmes.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n031.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.38298 seconds
cpu usage
1.32244
user time
1.0928
system time
0.229645
max virtual memory
698716.0
max residence set size
14008.0
stage attributes
key
value
starexec-result
YES
output
1.06/1.35 YES 1.06/1.35 1.06/1.35 Problem 1: 1.06/1.35 1.06/1.35 (VAR x y) 1.06/1.35 (STRATEGY CONTEXTSENSITIVE 1.06/1.35 (if 1) 1.06/1.35 (isZero 1) 1.06/1.35 (p 1) 1.06/1.35 (plus 1 2) 1.06/1.35 (0) 1.06/1.35 (false) 1.06/1.35 (s 1) 1.06/1.35 (true) 1.06/1.35 ) 1.06/1.35 (RULES 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x 1.06/1.35 isZero(0) -> true 1.06/1.35 isZero(s(x)) -> false 1.06/1.35 p(s(x)) -> x 1.06/1.35 plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 ) 1.06/1.35 1.06/1.35 Problem 1: 1.06/1.35 1.06/1.35 Innermost Equivalent Processor: 1.06/1.35 -> Rules: 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x 1.06/1.35 isZero(0) -> true 1.06/1.35 isZero(s(x)) -> false 1.06/1.35 p(s(x)) -> x 1.06/1.35 plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 1.06/1.35 1.06/1.35 1.06/1.35 Problem 1: 1.06/1.35 1.06/1.35 Dependency Pairs Processor: 1.06/1.35 -> Pairs: 1.06/1.35 IF(false,x,y) -> y 1.06/1.35 IF(true,x,y) -> x 1.06/1.35 PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 PLUS(x,y) -> ISZERO(x) 1.06/1.35 -> Rules: 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x 1.06/1.35 isZero(0) -> true 1.06/1.35 isZero(s(x)) -> false 1.06/1.35 p(s(x)) -> x 1.06/1.35 plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 -> Unhiding Rules: 1.06/1.35 s(plus(p(x),y)) -> P(x) 1.06/1.35 s(plus(p(x),y)) -> PLUS(p(x),y) 1.06/1.35 1.06/1.35 Problem 1: 1.06/1.35 1.06/1.35 SCC Processor: 1.06/1.35 -> Pairs: 1.06/1.35 IF(false,x,y) -> y 1.06/1.35 IF(true,x,y) -> x 1.06/1.35 PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 PLUS(x,y) -> ISZERO(x) 1.06/1.35 -> Rules: 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x 1.06/1.35 isZero(0) -> true 1.06/1.35 isZero(s(x)) -> false 1.06/1.35 p(s(x)) -> x 1.06/1.35 plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 -> Unhiding rules: 1.06/1.35 s(plus(p(x),y)) -> P(x) 1.06/1.35 s(plus(p(x),y)) -> PLUS(p(x),y) 1.06/1.35 ->Strongly Connected Components: 1.06/1.35 ->->Cycle: 1.06/1.35 ->->-> Pairs: 1.06/1.35 IF(false,x,y) -> y 1.06/1.35 IF(true,x,y) -> x 1.06/1.35 PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 ->->-> Rules: 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x 1.06/1.35 isZero(0) -> true 1.06/1.35 isZero(s(x)) -> false 1.06/1.35 p(s(x)) -> x 1.06/1.35 plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 ->->-> Unhiding rules: 1.06/1.35 s(plus(p(x),y)) -> PLUS(p(x),y) 1.06/1.35 1.06/1.35 Problem 1: 1.06/1.35 1.06/1.35 Reduction Pairs Processor: 1.06/1.35 -> Pairs: 1.06/1.35 IF(false,x,y) -> y 1.06/1.35 IF(true,x,y) -> x 1.06/1.35 PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) 1.06/1.35 -> Rules: 1.06/1.35 if(false,x,y) -> y 1.06/1.35 if(true,x,y) -> x
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