details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.014767 seconds
cpu usage	0.015329
user time	0.003244
system time	0.012085
max virtual memory	113188.0
max residence set size	3676.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR X Y) (STRATEGY CONTEXTSENSITIVE (f 1) (g 1) ) (RULES f(g(X),Y) -> f(X,f(g(X),Y)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(g(X),Y) -> F(X,f(g(X),Y)) -> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: F(g(X),Y) -> F(X,f(g(X),Y)) -> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(X),Y) -> F(X,f(g(X),Y)) ->->-> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: F(g(X),Y) -> F(X,f(g(X),Y)) -> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) -> Unhiding rules: Empty ->Projection: pi(F) = 1 Problem 1: Basic Processor: -> Pairs: Empty -> Rules: f(g(X),Y) -> f(X,f(g(X),Y)) -> 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 Contextsensitive