details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0401258468628 seconds
cpu usage	0.029577936
max memory	3309568.0

stage attributes

key	value
output-size	3248
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 x y z) (RULES max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) ) Problem 1: Innermost Equivalent Processor: -> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: MAX(N(L(s(x)),L(s(y)))) -> MAX(N(L(x),L(y))) MAX(N(L(x),N(y,z))) -> MAX(N(L(x),L(max(N(y,z))))) MAX(N(L(x),N(y,z))) -> MAX(N(y,z)) -> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) Problem 1: SCC Processor: -> Pairs: MAX(N(L(s(x)),L(s(y)))) -> MAX(N(L(x),L(y))) MAX(N(L(x),N(y,z))) -> MAX(N(L(x),L(max(N(y,z))))) MAX(N(L(x),N(y,z))) -> MAX(N(y,z)) -> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MAX(N(L(s(x)),L(s(y)))) -> MAX(N(L(x),L(y))) ->->-> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) ->->Cycle: ->->-> Pairs: MAX(N(L(x),N(y,z))) -> MAX(N(y,z)) ->->-> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: MAX(N(L(s(x)),L(s(y)))) -> MAX(N(L(x),L(y))) -> Rules: max(L(x)) -> x max(N(L(0),L(y))) -> y max(N(L(s(x)),L(s(y)))) -> s(max(N(L(x),L(y)))) max(N(L(x),N(y,z))) -> max(N(L(x),L(max(N(y,z))))) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [L](X) = 2.X [N](X1,X2) = 2.X1 + 2.X2 [s](X) = 2.X + 2 popout

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

job log

popout

actions

all output return to TRS Stand 20472