TRS Context Sensitive pair #516978786

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.166687011719 seconds
cpu usage	0.029985356
max memory	1155072.0

stage attributes

key	value
output-size	823
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: 

(STRATEGY CONTEXTSENSITIVE
(f 1)
(a)
(g)
)
(RULES
f(f(a)) -> f(g(f(a)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(f(a)) -> f(g(f(a)))
-> 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(f(a)) -> f(g(f(a)))
-> Unhiding Rules:
 Empty

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 f(f(a)) -> f(g(f(a)))
-> 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