details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	121.721 seconds
cpu usage	121.642
user time	93.5276
system time	28.1147
max virtual memory	713952.0
max residence set size	10784.0

stage attributes

key	value
starexec-result	NO

output

NO Problem 1: (VAR v_NonEmpty:S N:S X:S XS:S Y:S YS:S) (RULES from(X:S) -> cons(X:S,from(s(X:S))) minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) minus(X:S,0) -> 0 quot(0,s(Y:S)) -> 0 quot(s(X:S),s(Y:S)) -> s(quot(minus(X:S,Y:S),s(Y:S))) sel(0,cons(X:S,XS:S)) -> X:S sel(s(N:S),cons(X:S,XS:S)) -> sel(N:S,XS:S) zWquot(cons(X:S,XS:S),cons(Y:S,YS:S)) -> cons(quot(X:S,Y:S),zWquot(XS:S,YS:S)) zWquot(nil,XS:S) -> nil zWquot(XS:S,nil) -> nil ) Problem 1: Dependency Pairs Processor: -> Pairs: FROM(X:S) -> FROM(s(X:S)) MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) QUOT(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) QUOT(s(X:S),s(Y:S)) -> QUOT(minus(X:S,Y:S),s(Y:S)) SEL(s(N:S),cons(X:S,XS:S)) -> SEL(N:S,XS:S) ZWQUOT(cons(X:S,XS:S),cons(Y:S,YS:S)) -> QUOT(X:S,Y:S) ZWQUOT(cons(X:S,XS:S),cons(Y:S,YS:S)) -> ZWQUOT(XS:S,YS:S) -> Rules: from(X:S) -> cons(X:S,from(s(X:S))) minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) minus(X:S,0) -> 0 quot(0,s(Y:S)) -> 0 quot(s(X:S),s(Y:S)) -> s(quot(minus(X:S,Y:S),s(Y:S))) sel(0,cons(X:S,XS:S)) -> X:S sel(s(N:S),cons(X:S,XS:S)) -> sel(N:S,XS:S) zWquot(cons(X:S,XS:S),cons(Y:S,YS:S)) -> cons(quot(X:S,Y:S),zWquot(XS:S,YS:S)) zWquot(nil,XS:S) -> nil zWquot(XS:S,nil) -> nil Problem 1: Infinite Processor: -> Pairs: FROM(X:S) -> FROM(s(X:S)) MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) QUOT(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) QUOT(s(X:S),s(Y:S)) -> QUOT(minus(X:S,Y:S),s(Y:S)) SEL(s(N:S),cons(X:S,XS:S)) -> SEL(N:S,XS:S) ZWQUOT(cons(X:S,XS:S),cons(Y:S,YS:S)) -> QUOT(X:S,Y:S) ZWQUOT(cons(X:S,XS:S),cons(Y:S,YS:S)) -> ZWQUOT(XS:S,YS:S) -> Rules: from(X:S) -> cons(X:S,from(s(X:S))) minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) minus(X:S,0) -> 0 quot(0,s(Y:S)) -> 0 quot(s(X:S),s(Y:S)) -> s(quot(minus(X:S,Y:S),s(Y:S))) sel(0,cons(X:S,XS:S)) -> X:S sel(s(N:S),cons(X:S,XS:S)) -> sel(N:S,XS:S) zWquot(cons(X:S,XS:S),cons(Y:S,YS:S)) -> cons(quot(X:S,Y:S),zWquot(XS:S,YS:S)) zWquot(nil,XS:S) -> nil zWquot(XS:S,nil) -> nil -> Pairs in cycle: FROM(X:S) -> FROM(s(X: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