TRS Stand 20472 pair #381712175

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.508062124252 seconds
cpu usage	0.337405121
max memory	6316032.0

stage attributes

key	value
output-size	2316
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 y)
(RULES
f(x,f(y,a)) -> f(f(f(f(a,x),y),a),h(a))
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(x,f(y,a)) -> F(f(a,x),y)
 F(x,f(y,a)) -> F(a,x)
-> Rules:
 f(x,f(y,a)) -> f(f(f(f(a,x),y),a),h(a))
-> Usable rules:
 f(x,f(y,a)) -> f(f(f(f(a,x),y),a),h(a))
->Interpretation type:
 Simple mixed
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X1,X2) = 2.X1.X2 + 2
[a] = 1
[h](X) = 0
[F](X1,X2) = X1.X2 + X1 + 2.X2

Problem 1: 

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

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(x,f(y,a)) -> F(a,x)
-> Rules:
 f(x,f(y,a)) -> f(f(f(f(a,x),y),a),h(a))
-> Usable rules:
 Empty

popout

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

job log

popout

actions all output return to TRS Stand 20472