TRS Standard pair #516967066

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.10636305809 seconds
cpu usage	0.041250826
max memory	3260416.0

stage attributes

key	value
output-size	2255
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 v_NonEmpty:S x:S)
(RULES
f(0) -> s(0)
f(s(0)) -> s(0)
f(s(s(x:S))) -> f(f(s(x:S)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(s(s(x:S))) -> F(f(s(x:S)))
 F(s(s(x:S))) -> F(s(x:S))
-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(s(x:S))) -> F(f(s(x:S)))
 F(s(s(x:S))) -> F(s(x:S))
-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(s(x:S))) -> F(f(s(x:S)))
 F(s(s(x:S))) -> F(s(x:S))
->->-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(s(s(x:S))) -> F(f(s(x:S)))
 F(s(s(x:S))) -> F(s(x:S))
-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))
-> Usable rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X) = 2
[0] = 0
[fSNonEmpty] = 0
[s](X) = 2.X + 2
[F](X) = 2.X

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(s(x:S))) -> F(s(x:S))
-> Rules:
 f(0) -> s(0)
 f(s(0)) -> s(0)
 f(s(s(x:S))) -> f(f(s(x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:

popout

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

job log

popout

actions all output return to TRS Standard