TRS Standard pair #516965541

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.07901787758 seconds
cpu usage	0.926674168
max memory	7376896.0

stage attributes

key	value
output-size	2435
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 v_NonEmpty:S x:S)
(RULES
f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),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(x:S,f(a,a)) -> F(f(f(a,a),a),x:S)
 F(x:S,f(a,a)) -> F(a,f(f(f(a,a),a),x:S))
-> Rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))

Problem 1: 

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

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(x:S,f(a,a)) -> F(f(f(a,a),a),x:S)
 F(x:S,f(a,a)) -> F(a,f(f(f(a,a),a),x:S))
-> Rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))
-> Usable rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))
->Interpretation type:
 Simple mixed
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X1,X2) = 1/2.X1.X2
[a] = 1
[fSNonEmpty] = 0
[F](X1,X2) = 2.X1.X2 + 1/2.X2

Problem 1: 

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

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(x:S,f(a,a)) -> F(a,f(f(f(a,a),a),x:S))
-> Rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))
-> Usable rules:
 f(x:S,f(a,a)) -> f(a,f(f(f(a,a),a),x:S))
->Interpretation type:
 Linear
->Coefficients:
 All rationals

popout

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

job log

popout

actions all output return to TRS Standard