details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0836029052734 seconds
cpu usage	0.03645634
max memory	2985984.0

stage attributes

key	value
output-size	1883
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 Y:S) (RULES f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y: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(c(X:S,s(Y:S))) -> F(c(s(X:S),Y:S)) G(c(s(X:S),Y:S)) -> F(c(X:S,s(Y:S))) -> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) Problem 1: SCC Processor: -> Pairs: F(c(X:S,s(Y:S))) -> F(c(s(X:S),Y:S)) G(c(s(X:S),Y:S)) -> F(c(X:S,s(Y:S))) -> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(c(X:S,s(Y:S))) -> F(c(s(X:S),Y:S)) ->->-> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) Problem 1: Reduction Pairs Processor: -> Pairs: F(c(X:S,s(Y:S))) -> F(c(s(X:S),Y:S)) -> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = 0 [g](X) = 0 [c](X1,X2) = 2.X2 [fSNonEmpty] = 0 [s](X) = 2.X + 2 [F](X) = 2.X [G](X) = 0 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: f(c(X:S,s(Y:S))) -> f(c(s(X:S),Y:S)) g(c(s(X:S),Y:S)) -> f(c(X:S,s(Y:S))) ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

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

job log

popout

actions

all output return to TRS Standard