details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.69996809959 seconds
cpu usage	1.149324463
max memory	9510912.0

stage attributes

key	value
output-size	8699
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 b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(d(d(x1:S))) -> C(c(d(d(c(x1:S))))) B(d(d(x1:S))) -> C(d(d(c(x1:S)))) B(d(d(x1:S))) -> C(x1:S) B(d(d(x1:S))) -> D(c(x1:S)) B(d(d(x1:S))) -> D(d(c(x1:S))) C(d(c(x1:S))) -> D(x1:S) D(a(x1:S)) -> B(d(x1:S)) D(a(x1:S)) -> D(x1:S) -> Rules: b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) Problem 1: SCC Processor: -> Pairs: B(d(d(x1:S))) -> C(c(d(d(c(x1:S))))) B(d(d(x1:S))) -> C(d(d(c(x1:S)))) B(d(d(x1:S))) -> C(x1:S) B(d(d(x1:S))) -> D(c(x1:S)) B(d(d(x1:S))) -> D(d(c(x1:S))) C(d(c(x1:S))) -> D(x1:S) D(a(x1:S)) -> B(d(x1:S)) D(a(x1:S)) -> D(x1:S) -> Rules: b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(d(d(x1:S))) -> C(c(d(d(c(x1:S))))) B(d(d(x1:S))) -> C(d(d(c(x1:S)))) B(d(d(x1:S))) -> C(x1:S) B(d(d(x1:S))) -> D(c(x1:S)) B(d(d(x1:S))) -> D(d(c(x1:S))) C(d(c(x1:S))) -> D(x1:S) D(a(x1:S)) -> B(d(x1:S)) D(a(x1:S)) -> D(x1:S) ->->-> Rules: b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: B(d(d(x1:S))) -> C(c(d(d(c(x1:S))))) B(d(d(x1:S))) -> C(d(d(c(x1:S)))) B(d(d(x1:S))) -> C(x1:S) B(d(d(x1:S))) -> D(c(x1:S)) B(d(d(x1:S))) -> D(d(c(x1:S))) C(d(c(x1:S))) -> D(x1:S) D(a(x1:S)) -> B(d(x1:S)) D(a(x1:S)) -> D(x1:S) -> Rules: b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) -> Usable rules: b(d(d(x1:S))) -> c(c(d(d(c(x1:S))))) b(x1:S) -> a(a(a(x1:S))) c(d(c(x1:S))) -> a(d(x1:S)) d(a(x1:S)) -> b(d(x1:S)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 popout

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

job log

popout

actions

all output return to SRS Standard