Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487071239
details
property
value
status
complete
benchmark
Ex1_GM03_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0186309 seconds
cpu usage
0.019094
user time
0.011166
system time
0.007928
max virtual memory
113188.0
max residence set size
5216.0
stage attributes
key
value
starexec-result
NO
output
NO Problem 1: (VAR v_NonEmpty:S X:S Y:S) (RULES 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S))) if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) leq(0,Y:S) -> ttrue leq(s(X:S),0) -> ffalse leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S) p(0) -> 0 p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__s(X:S)) -> S(X:S) DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S) DIFF(X:S,Y:S) -> IF(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S))) DIFF(X:S,Y:S) -> LEQ(X:S,Y:S) DIFF(X:S,Y:S) -> P(X:S) IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S) IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S) LEQ(s(X:S),s(Y:S)) -> LEQ(X:S,Y:S) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S))) if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) leq(0,Y:S) -> ttrue leq(s(X:S),0) -> ffalse leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S) p(0) -> 0 p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) Problem 1: Infinite Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__s(X:S)) -> S(X:S) DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S) DIFF(X:S,Y:S) -> IF(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S))) DIFF(X:S,Y:S) -> LEQ(X:S,Y:S) DIFF(X:S,Y:S) -> P(X:S) IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S) IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S) LEQ(s(X:S),s(Y:S)) -> LEQ(X:S,Y:S) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S))) if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) leq(0,Y:S) -> ttrue leq(s(X:S),0) -> ffalse leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S) p(0) -> 0 p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) -> Pairs in cycle: DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard