details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	101.152 seconds
cpu usage	101.124
user time	96.7596
system time	4.36429
max virtual memory	835692.0
max residence set size	91348.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) Problem 1: SCC Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) ->->-> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) Problem 1: Reduction Pair Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) -> Usable rules: popout

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

job log

popout

actions

all output return to SRS Standard