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	n020.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0184450149536 seconds
cpu usage	0.014971788
max memory	1667072.0

stage attributes

key	value
output-size	2644
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR X Y Z) (STRATEGY CONTEXTSENSITIVE (filter 1 2) (from 1) (head 1) (if 1) (primes) (sieve 1) (tail 1) (0) (cons 1) (divides 1 2) (false) (s 1) (true) ) (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: Innermost Equivalent Processor: -> 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 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: IF(false,X,Y) -> Y IF(true,X,Y) -> X PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) TAIL(cons(X,Y)) -> 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 -> Unhiding Rules: filter(s(s(X)),Z) -> FILTER(s(s(X)),Z) filter(s(s(X)),x3) -> x3 filter(X,sieve(Y)) -> FILTER(X,sieve(Y)) filter(X,sieve(Y)) -> SIEVE(Y) filter(X,sieve(x3)) -> x3 from(s(X)) -> FROM(s(X)) Problem 1: SCC Processor: -> Pairs: IF(false,X,Y) -> Y IF(true,X,Y) -> X PRIMES -> FROM(s(s(0))) PRIMES -> SIEVE(from(s(s(0)))) TAIL(cons(X,Y)) -> 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 -> Unhiding rules: filter(s(s(X)),Z) -> FILTER(s(s(X)),Z) filter(s(s(X)),x3) -> x3 filter(X,sieve(Y)) -> FILTER(X,sieve(Y)) popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651