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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	78.0239331722 seconds
cpu usage	77.819947072
max memory	1.88198912E8

stage attributes

key	value
output-size	2438
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR v_NonEmpty:S X:S Y:S Z:S) (RULES filter(s(s(X:S)),cons(Y:S,Z:S)) -> if(divides(s(s(X:S)),Y:S),filter(s(s(X:S)),Z:S),cons(Y:S,filter(X:S,sieve(Y:S)))) from(X:S) -> cons(X:S,from(s(X:S))) head(cons(X:S,Y:S)) -> X:S if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S primes -> sieve(from(s(s(0)))) sieve(cons(X:S,Y:S)) -> cons(X:S,filter(X:S,sieve(Y:S))) tail(cons(X:S,Y:S)) -> Y:S ) Problem 1: Dependency Pairs Processor: -> Pairs: FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> FILTER(s(s(X:S)),Z:S) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> FILTER(X:S,sieve(Y:S)) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> IF(divides(s(s(X:S)),Y:S),filter(s(s(X:S)),Z:S),cons(Y:S,filter(X:S,sieve(Y:S)))) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> SIEVE(Y:S) FROM(X:S) -> FROM(s(X:S)) PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) SIEVE(cons(X:S,Y:S)) -> FILTER(X:S,sieve(Y:S)) SIEVE(cons(X:S,Y:S)) -> SIEVE(Y:S) -> Rules: filter(s(s(X:S)),cons(Y:S,Z:S)) -> if(divides(s(s(X:S)),Y:S),filter(s(s(X:S)),Z:S),cons(Y:S,filter(X:S,sieve(Y:S)))) from(X:S) -> cons(X:S,from(s(X:S))) head(cons(X:S,Y:S)) -> X:S if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S primes -> sieve(from(s(s(0)))) sieve(cons(X:S,Y:S)) -> cons(X:S,filter(X:S,sieve(Y:S))) tail(cons(X:S,Y:S)) -> Y:S Problem 1: Infinite Processor: -> Pairs: FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> FILTER(s(s(X:S)),Z:S) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> FILTER(X:S,sieve(Y:S)) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> IF(divides(s(s(X:S)),Y:S),filter(s(s(X:S)),Z:S),cons(Y:S,filter(X:S,sieve(Y:S)))) FILTER(s(s(X:S)),cons(Y:S,Z:S)) -> SIEVE(Y:S) FROM(X:S) -> FROM(s(X:S)) PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) SIEVE(cons(X:S,Y:S)) -> FILTER(X:S,sieve(Y:S)) SIEVE(cons(X:S,Y:S)) -> SIEVE(Y:S) -> Rules: filter(s(s(X:S)),cons(Y:S,Z:S)) -> if(divides(s(s(X:S)),Y:S),filter(s(s(X:S)),Z:S),cons(Y:S,filter(X:S,sieve(Y:S)))) from(X:S) -> cons(X:S,from(s(X:S))) head(cons(X:S,Y:S)) -> X:S if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S primes -> sieve(from(s(s(0)))) sieve(cons(X:S,Y:S)) -> cons(X:S,filter(X:S,sieve(Y:S))) tail(cons(X:S,Y:S)) -> Y:S -> 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