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	n074.star.cs.uiowa.edu
space	Zantema_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	98.9097540379 seconds
cpu usage	97.997404411
max memory	1.06348544E8

stage attributes

key	value
output-size	9249
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 x1) (RULES c(c(x1)) -> c(x1) c(f(x1)) -> f(n(a(c(x1)))) f(x1) -> n(c(n(a(x1)))) n(f(x1)) -> f(n(x1)) n(a(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) ) Problem 1: Dependency Pairs Processor: -> Pairs: C(f(x1)) -> C(x1) C(f(x1)) -> F(n(a(c(x1)))) C(f(x1)) -> N(a(c(x1))) F(x1) -> C(n(a(x1))) F(x1) -> N(c(n(a(x1)))) F(x1) -> N(a(x1)) N(f(x1)) -> F(n(x1)) N(f(x1)) -> N(x1) N(a(x1)) -> C(x1) N(s(x1)) -> F(s(s(x1))) -> Rules: c(c(x1)) -> c(x1) c(f(x1)) -> f(n(a(c(x1)))) f(x1) -> n(c(n(a(x1)))) n(f(x1)) -> f(n(x1)) n(a(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) Problem 1: SCC Processor: -> Pairs: C(f(x1)) -> C(x1) C(f(x1)) -> F(n(a(c(x1)))) C(f(x1)) -> N(a(c(x1))) F(x1) -> C(n(a(x1))) F(x1) -> N(c(n(a(x1)))) F(x1) -> N(a(x1)) N(f(x1)) -> F(n(x1)) N(f(x1)) -> N(x1) N(a(x1)) -> C(x1) N(s(x1)) -> F(s(s(x1))) -> Rules: c(c(x1)) -> c(x1) c(f(x1)) -> f(n(a(c(x1)))) f(x1) -> n(c(n(a(x1)))) n(f(x1)) -> f(n(x1)) n(a(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(f(x1)) -> C(x1) C(f(x1)) -> F(n(a(c(x1)))) C(f(x1)) -> N(a(c(x1))) F(x1) -> C(n(a(x1))) F(x1) -> N(c(n(a(x1)))) F(x1) -> N(a(x1)) N(f(x1)) -> F(n(x1)) N(f(x1)) -> N(x1) N(a(x1)) -> C(x1) N(s(x1)) -> F(s(s(x1))) ->->-> Rules: c(c(x1)) -> c(x1) c(f(x1)) -> f(n(a(c(x1)))) f(x1) -> n(c(n(a(x1)))) n(f(x1)) -> f(n(x1)) n(a(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C(f(x1)) -> C(x1) C(f(x1)) -> F(n(a(c(x1)))) C(f(x1)) -> N(a(c(x1))) F(x1) -> C(n(a(x1))) F(x1) -> N(c(n(a(x1)))) F(x1) -> N(a(x1)) N(f(x1)) -> F(n(x1)) N(f(x1)) -> N(x1) N(a(x1)) -> C(x1) N(s(x1)) -> F(s(s(x1))) -> Rules: c(c(x1)) -> c(x1) popout

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

job log

popout

actions

all output return to SRS Stand 10685