details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0170891284943 seconds
cpu usage	0.013666716
max memory	1384448.0

stage attributes

key	value
output-size	1873
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 (from 1) (sel 1 2) (0) (cons 1) (s 1) ) (RULES from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ) Problem 1: Innermost Equivalent Processor: -> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding Rules: from(s(X)) -> FROM(s(X)) Problem 1: SCC Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: from(s(X)) -> FROM(s(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) ->->-> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) -> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: Empty ->Projection: pi(SEL) = 1 Problem 1: Basic Processor: -> Pairs: Empty -> Rules: from(X) -> cons(X,from(s(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: Empty -> Result: Set P is empty The problem is finite. popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651