details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	5.11487102509 seconds
cpu usage	4.975645932
max memory	2.7049984E7

stage attributes

key	value
output-size	7674
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) (STRATEGY CONTEXTSENSITIVE (add 1 2) (fact 1) (if 1) (p 1) (prod 1 2) (zero 1) (0) (false) (s 1) (true) ) (RULES add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fact(X) -> if(zero(X),s(0),prod(X,fact(p(X)))) if(false,X,Y) -> Y if(true,X,Y) -> X p(s(X)) -> X prod(0,X) -> 0 prod(s(X),Y) -> add(Y,prod(X,Y)) zero(0) -> true zero(s(X)) -> false ) Problem 1: Innermost Equivalent Processor: -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fact(X) -> if(zero(X),s(0),prod(X,fact(p(X)))) if(false,X,Y) -> Y if(true,X,Y) -> X p(s(X)) -> X prod(0,X) -> 0 prod(s(X),Y) -> add(Y,prod(X,Y)) zero(0) -> true zero(s(X)) -> false -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) FACT(X) -> IF(zero(X),s(0),prod(X,fact(p(X)))) FACT(X) -> ZERO(X) IF(false,X,Y) -> Y IF(true,X,Y) -> X PROD(s(X),Y) -> ADD(Y,prod(X,Y)) PROD(s(X),Y) -> PROD(X,Y) -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fact(X) -> if(zero(X),s(0),prod(X,fact(p(X)))) if(false,X,Y) -> Y if(true,X,Y) -> X p(s(X)) -> X prod(0,X) -> 0 prod(s(X),Y) -> add(Y,prod(X,Y)) zero(0) -> true zero(s(X)) -> false -> Unhiding Rules: prod(X,fact(p(X))) -> FACT(p(X)) prod(X,fact(p(X))) -> P(X) prod(X,fact(p(X))) -> PROD(X,fact(p(X))) Problem 1: SCC Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) FACT(X) -> IF(zero(X),s(0),prod(X,fact(p(X)))) FACT(X) -> ZERO(X) IF(false,X,Y) -> Y IF(true,X,Y) -> X PROD(s(X),Y) -> ADD(Y,prod(X,Y)) PROD(s(X),Y) -> PROD(X,Y) -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fact(X) -> if(zero(X),s(0),prod(X,fact(p(X)))) if(false,X,Y) -> Y if(true,X,Y) -> X p(s(X)) -> X prod(0,X) -> 0 prod(s(X),Y) -> add(Y,prod(X,Y)) popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651