details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.43651 seconds
cpu usage	1.40477
user time	1.18225
system time	0.222528
max virtual memory	725296.0
max residence set size	21340.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(f(g(x1:S))) -> F(x1:S) F(f(g(x1:S))) -> G(f(x1:S)) G(g(x1:S)) -> F(g(x1:S)) G(g(x1:S)) -> G(f(g(x1:S))) G(c(x1:S)) -> G(f(c(x1:S))) -> Rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) Problem 1: SCC Processor: -> Pairs: F(f(g(x1:S))) -> F(x1:S) F(f(g(x1:S))) -> G(f(x1:S)) G(g(x1:S)) -> F(g(x1:S)) G(g(x1:S)) -> G(f(g(x1:S))) G(c(x1:S)) -> G(f(c(x1:S))) -> Rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(g(x1:S))) -> F(x1:S) F(f(g(x1:S))) -> G(f(x1:S)) G(g(x1:S)) -> F(g(x1:S)) G(g(x1:S)) -> G(f(g(x1:S))) ->->-> Rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) Problem 1: Reduction Pair Processor: -> Pairs: F(f(g(x1:S))) -> F(x1:S) F(f(g(x1:S))) -> G(f(x1:S)) G(g(x1:S)) -> F(g(x1:S)) G(g(x1:S)) -> G(f(g(x1:S))) -> Rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) -> Usable rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = X [g](X) = 2.X + 2 [c](X) = 2.X + 2 [F](X) = X [G](X) = X Problem 1: SCC Processor: -> Pairs: F(f(g(x1:S))) -> G(f(x1:S)) G(g(x1:S)) -> F(g(x1:S)) G(g(x1:S)) -> G(f(g(x1:S))) -> Rules: f(f(g(x1:S))) -> g(f(x1:S)) g(f(c(x1:S))) -> g(f(f(c(x1:S)))) g(g(x1:S)) -> g(f(g(x1:S))) g(c(x1:S)) -> g(f(c(x1:S))) popout

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

job log

popout

actions

all output return to SRS Standard