TRS Standard pair #615306593

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0587539672852 seconds
cpu usage	0.051872368
max memory	3268608.0

stage attributes

key	value
output-size	3288
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 y:S)
(RULES
f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
g(s(f(x:S))) -> g(f(x:S))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S)))
 G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S))
 G(s(f(x:S))) -> G(f(x:S))
-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))

Problem 1: 

SCC Processor:
-> Pairs:
 F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S)))
 G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S))
 G(s(f(x:S))) -> G(f(x:S))
-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S))
->->-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))
->->Cycle:
->->-> Pairs:
 G(s(f(x:S))) -> G(f(x:S))
->->-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))
->->Cycle:
->->-> Pairs:
 F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S)))
->->-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))


The problem is decomposed in 3 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S))
-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))
-> Usable rules:
 Empty
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[c](X1,X2) = 2.X2
[s](X) = 2.X + 2
[G](X) = 2.X

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S)))
 g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S))
 g(s(f(x:S))) -> g(f(x:S))

popout

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

job log

popout

actions all output return to TRS Standard