details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	2.46695613861 seconds
cpu usage	2.209918041
max memory	9474048.0

stage attributes

key	value
output-size	7264
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 x1:S) (RULES a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(d(x1:S)) -> B(d(x1:S)) A(d(x1:S)) -> B(c(b(d(x1:S)))) A(d(x1:S)) -> D(b(c(b(d(x1:S))))) A(x1:S) -> B(b(f(b(b(x1:S))))) A(x1:S) -> B(b(x1:S)) A(x1:S) -> B(f(b(b(x1:S)))) A(x1:S) -> B(x1:S) B(d(b(x1:S))) -> A(d(x1:S)) B(d(b(x1:S))) -> D(x1:S) D(f(x1:S)) -> B(d(x1:S)) D(f(x1:S)) -> D(x1:S) -> Rules: a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) Problem 1: SCC Processor: -> Pairs: A(d(x1:S)) -> B(d(x1:S)) A(d(x1:S)) -> B(c(b(d(x1:S)))) A(d(x1:S)) -> D(b(c(b(d(x1:S))))) A(x1:S) -> B(b(f(b(b(x1:S))))) A(x1:S) -> B(b(x1:S)) A(x1:S) -> B(f(b(b(x1:S)))) A(x1:S) -> B(x1:S) B(d(b(x1:S))) -> A(d(x1:S)) B(d(b(x1:S))) -> D(x1:S) D(f(x1:S)) -> B(d(x1:S)) D(f(x1:S)) -> D(x1:S) -> Rules: a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(d(x1:S)) -> B(d(x1:S)) A(x1:S) -> B(b(x1:S)) A(x1:S) -> B(x1:S) B(d(b(x1:S))) -> A(d(x1:S)) B(d(b(x1:S))) -> D(x1:S) D(f(x1:S)) -> B(d(x1:S)) D(f(x1:S)) -> D(x1:S) ->->-> Rules: a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: A(d(x1:S)) -> B(d(x1:S)) A(x1:S) -> B(b(x1:S)) A(x1:S) -> B(x1:S) B(d(b(x1:S))) -> A(d(x1:S)) B(d(b(x1:S))) -> D(x1:S) D(f(x1:S)) -> B(d(x1:S)) D(f(x1:S)) -> D(x1:S) -> Rules: a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) -> Usable rules: a(d(x1:S)) -> d(b(c(b(d(x1:S))))) a(x1:S) -> b(b(f(b(b(x1:S))))) b(d(b(x1:S))) -> a(d(x1:S)) d(f(x1:S)) -> b(d(x1:S)) ->Interpretation type: Linear ->Coefficients: All rationals popout

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

job log

popout

actions

all output return to SRS Standard