TRS Context Sensitive pair #516978804

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.124993085861 seconds
cpu usage	0.01572704
max memory	1130496.0

stage attributes

key	value
output-size	818
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)
(STRATEGY CONTEXTSENSITIVE
(f 1)
(g)
(h 1)
)
(RULES
f(X) -> g(h(f(X)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(X) -> g(h(f(X)))
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 f(X) -> g(h(f(X)))
-> Unhiding Rules:
 Empty

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 f(X) -> g(h(f(X)))
-> 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 Context Sensitive