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	n066.star.cs.uiowa.edu
space	Various_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.131926059723 seconds
cpu usage	0.038473397
max memory	3215360.0

stage attributes

key	value
output-size	3678
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 z:S) (RULES max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) ) Problem 1: Innermost Equivalent Processor: -> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) -> 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:S)),L(s(y:S)))) -> MAX(N(L(x:S),L(y:S))) MAX(N(L(x:S),N(y:S,z:S))) -> MAX(N(L(x:S),L(max(N(y:S,z:S))))) MAX(N(L(x:S),N(y:S,z:S))) -> MAX(N(y:S,z:S)) -> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) Problem 1: SCC Processor: -> Pairs: MAX(N(L(s(x:S)),L(s(y:S)))) -> MAX(N(L(x:S),L(y:S))) MAX(N(L(x:S),N(y:S,z:S))) -> MAX(N(L(x:S),L(max(N(y:S,z:S))))) MAX(N(L(x:S),N(y:S,z:S))) -> MAX(N(y:S,z:S)) -> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MAX(N(L(s(x:S)),L(s(y:S)))) -> MAX(N(L(x:S),L(y:S))) ->->-> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) ->->Cycle: ->->-> Pairs: MAX(N(L(x:S),N(y:S,z:S))) -> MAX(N(y:S,z:S)) ->->-> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: MAX(N(L(s(x:S)),L(s(y:S)))) -> MAX(N(L(x:S),L(y:S))) -> Rules: max(L(x:S)) -> x:S max(N(L(0),L(y:S))) -> y:S max(N(L(s(x:S)),L(s(y:S)))) -> s(max(N(L(x:S),L(y:S)))) max(N(L(x:S),N(y:S,z:S))) -> max(N(L(x:S),L(max(N(y:S,z:S))))) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [max](X) = 0 [0] = 0 [L](X) = 2.X popout

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

job log

popout

actions

all output return to TRS Standard