details

property	value
status	complete
benchmark	random-376.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n173.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.238763809204 seconds
cpu usage	0.127448178
max memory	3837952.0

stage attributes

key	value
output-size	7306
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 x1:S) (RULES a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(b(a(b(x1:S)))) -> A(a(x1:S)) A(b(a(b(x1:S)))) -> A(x1:S) A(b(a(b(x1:S)))) -> B(a(a(x1:S))) A(b(a(b(x1:S)))) -> B(b(a(a(x1:S)))) A(b(b(b(x1:S)))) -> A(a(b(x1:S))) A(b(b(b(x1:S)))) -> A(b(x1:S)) A(b(b(b(x1:S)))) -> B(a(a(b(x1:S)))) B(a(a(a(x1:S)))) -> B(a(a(x1:S))) B(a(a(a(x1:S)))) -> B(b(a(a(x1:S)))) -> Rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) Problem 1: SCC Processor: -> Pairs: A(b(a(b(x1:S)))) -> A(a(x1:S)) A(b(a(b(x1:S)))) -> A(x1:S) A(b(a(b(x1:S)))) -> B(a(a(x1:S))) A(b(a(b(x1:S)))) -> B(b(a(a(x1:S)))) A(b(b(b(x1:S)))) -> A(a(b(x1:S))) A(b(b(b(x1:S)))) -> A(b(x1:S)) A(b(b(b(x1:S)))) -> B(a(a(b(x1:S)))) B(a(a(a(x1:S)))) -> B(a(a(x1:S))) B(a(a(a(x1:S)))) -> B(b(a(a(x1:S)))) -> Rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(a(a(a(x1:S)))) -> B(a(a(x1:S))) B(a(a(a(x1:S)))) -> B(b(a(a(x1:S)))) ->->-> Rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) ->->Cycle: ->->-> Pairs: A(b(a(b(x1:S)))) -> A(a(x1:S)) A(b(a(b(x1:S)))) -> A(x1:S) A(b(b(b(x1:S)))) -> A(a(b(x1:S))) A(b(b(b(x1:S)))) -> A(b(x1:S)) ->->-> Rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: B(a(a(a(x1:S)))) -> B(a(a(x1:S))) B(a(a(a(x1:S)))) -> B(b(a(a(x1:S)))) -> Rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) -> Usable rules: a(b(a(b(x1:S)))) -> b(b(a(a(x1:S)))) a(b(b(b(x1:S)))) -> b(a(a(b(x1:S)))) b(a(a(a(x1:S)))) -> b(b(a(a(x1:S)))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a](X) = 2.X + 2 popout

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

job log

popout

actions

all output return to SRS Standard