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	n100.star.cs.uiowa.edu
space	Strategy_removed_CSR_05

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	17.2406389713 seconds
cpu usage	17.027569199
max memory	1.8798592E8

stage attributes

key	value
output-size	2100
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR X Y Z) (RULES filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) from(X) -> cons(X,from(s(X))) head(cons(X,Y)) -> X if(false,X,Y) -> Y if(true,X,Y) -> X primes -> sieve(from(s(s(0)))) sieve(cons(X,Y)) -> cons(X,filter(X,sieve(Y))) tail(cons(X,Y)) -> Y ) Problem 1: Dependency Pairs Processor: -> Pairs: FILTER(s(s(X)),cons(Y,Z)) -> FILTER(s(s(X)),Z) FILTER(s(s(X)),cons(Y,Z)) -> FILTER(X,sieve(Y)) FILTER(s(s(X)),cons(Y,Z)) -> IF(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) FILTER(s(s(X)),cons(Y,Z)) -> SIEVE(Y) FROM(X) -> FROM(s(X)) PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) SIEVE(cons(X,Y)) -> FILTER(X,sieve(Y)) SIEVE(cons(X,Y)) -> SIEVE(Y) -> Rules: filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) from(X) -> cons(X,from(s(X))) head(cons(X,Y)) -> X if(false,X,Y) -> Y if(true,X,Y) -> X primes -> sieve(from(s(s(0)))) sieve(cons(X,Y)) -> cons(X,filter(X,sieve(Y))) tail(cons(X,Y)) -> Y Problem 1: Infinite Processor: -> Pairs: FILTER(s(s(X)),cons(Y,Z)) -> FILTER(s(s(X)),Z) FILTER(s(s(X)),cons(Y,Z)) -> FILTER(X,sieve(Y)) FILTER(s(s(X)),cons(Y,Z)) -> IF(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) FILTER(s(s(X)),cons(Y,Z)) -> SIEVE(Y) FROM(X) -> FROM(s(X)) PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) SIEVE(cons(X,Y)) -> FILTER(X,sieve(Y)) SIEVE(cons(X,Y)) -> SIEVE(Y) -> Rules: filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) from(X) -> cons(X,from(s(X))) head(cons(X,Y)) -> X if(false,X,Y) -> Y if(true,X,Y) -> X primes -> sieve(from(s(s(0)))) sieve(cons(X,Y)) -> cons(X,filter(X,sieve(Y))) tail(cons(X,Y)) -> Y -> Pairs in cycle: FROM(X) -> FROM(s(X)) The problem is infinite. popout

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

job log

popout

actions

all output return to TRS Stand 20472