details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0189738273621 seconds
cpu usage	0.015805032
max memory	1740800.0

stage attributes

key	value
output-size	2898
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 (f 1) (g 1) (sel 1 2) (0) (cons 1) (s 1) ) (RULES f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(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: G(s(X)) -> G(X) SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding Rules: f(g(X)) -> F(g(X)) f(g(X)) -> G(X) Problem 1: SCC Processor: -> Pairs: G(s(X)) -> G(X) SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: f(g(X)) -> F(g(X)) f(g(X)) -> G(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(s(X)) -> G(X) ->->-> Rules: f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ->->-> Unhiding rules: Empty ->->Cycle: ->->-> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) ->->-> Rules: f(X) -> cons(X,f(g(X))) g(0) -> s(0) g(s(X)) -> s(s(g(X))) sel(0,cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ->->-> Unhiding rules: Empty The problem is decomposed in 2 subproblems. Problem 1.1: popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651