details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.08962 seconds
cpu usage	0.036999
user time	0.016769
system time	0.02023
max virtual memory	113188.0
max residence set size	9316.0

stage attributes

key	value
starexec-result	NO

output

NO Input TRS: 1: primes() -> sieve(from(s(s(0())))) 2: from(X) -> cons(X,from(s(X))) 3: head(cons(X,Y)) -> X 4: tail(cons(X,Y)) -> Y 5: if(true(),X,Y) -> X 6: if(false(),X,Y) -> Y 7: filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) 8: sieve(cons(X,Y)) -> cons(X,filter(X,sieve(Y))) Number of strict rules: 8 Direct POLO(bPol) ... failed. Uncurrying filter^1_s filter if 1: primes() -> sieve(from(s(s(0())))) 2: from(X) -> cons(X,from(s(X))) 3: head(cons(X,Y)) -> X 4: tail(cons(X,Y)) -> Y 5: if^1_true(X,Y) -> X 6: if^1_false(X,Y) -> Y 7: filter^1_s^1_s(X,cons(Y,Z)) -> if^1_divides(s(s(X)),Y,filter^1_s^1_s(X,Z),cons(Y,filter(X,sieve(Y)))) 8: sieve(cons(X,Y)) -> cons(X,filter(X,sieve(Y))) 9: if(false(),_2,_3) ->= if^1_false(_2,_3) 10: if(divides(_1,_2),_4,_5) ->= if^1_divides(_1,_2,_4,_5) 11: if(true(),_2,_3) ->= if^1_true(_2,_3) 12: filter(s(_1),_2) ->= filter^1_s(_1,_2) 13: filter^1_s(s(_1),_2) ->= filter^1_s^1_s(_1,_2) Number of strict rules: 8 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #from(X) -> #from(s(X)) #2: #filter^1_s(s(_1),_2) ->? #filter^1_s^1_s(_1,_2) #3: #if(false(),_2,_3) ->? #if^1_false(_2,_3) #4: #if(true(),_2,_3) ->? #if^1_true(_2,_3) #5: #filter(s(_1),_2) ->? #filter^1_s(_1,_2) #6: #filter^1_s^1_s(X,cons(Y,Z)) -> #filter^1_s^1_s(X,Z) #7: #filter^1_s^1_s(X,cons(Y,Z)) -> #filter(X,sieve(Y)) #8: #filter^1_s^1_s(X,cons(Y,Z)) -> #sieve(Y) #9: #primes() -> #sieve(from(s(s(0())))) #10: #primes() -> #from(s(s(0()))) #11: #sieve(cons(X,Y)) -> #filter(X,sieve(Y)) #12: #sieve(cons(X,Y)) -> #sieve(Y) Number of SCCs: 2, DPs: 8 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #from(X) -#1-> #from(s(X)) --->* #from(s(X)) Looping with: [ X := s(X); ] popout

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

job log

popout

actions

all output return to TRS Standard