details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0450940132141 seconds
cpu usage	0.016738518
max memory	1748992.0

stage attributes

key	value
output-size	2052
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR X Y Z) (STRATEGY CONTEXTSENSITIVE (add 1) (and 1) (first 1 2) (from) (if 1) (0) (cons) (false) (nil) (s) (true) ) (RULES add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) and(false,Y) -> false and(true,X) -> X first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) if(false,X,Y) -> Y if(true,X,Y) -> X ) Problem 1: Innermost Equivalent Processor: -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) and(false,Y) -> false and(true,X) -> X first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) if(false,X,Y) -> Y if(true,X,Y) -> X -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: ADD(0,X) -> X AND(true,X) -> X IF(false,X,Y) -> Y IF(true,X,Y) -> X -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) and(false,Y) -> false and(true,X) -> X first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) if(false,X,Y) -> Y if(true,X,Y) -> X -> Unhiding Rules: add(X,Y) -> ADD(X,Y) add(x3,Y) -> x3 first(X,Z) -> FIRST(X,Z) first(X,x3) -> x3 first(x3,Z) -> x3 from(s(X)) -> FROM(s(X)) Problem 1: Basic Processor: -> Pairs: ADD(0,X) -> X AND(true,X) -> X IF(false,X,Y) -> Y IF(true,X,Y) -> X -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) and(false,Y) -> false and(true,X) -> X first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) if(false,X,Y) -> Y if(true,X,Y) -> X -> Unhiding rules: add(X,Y) -> ADD(X,Y) add(x3,Y) -> x3 first(X,Z) -> FIRST(X,Z) popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651