details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.080451965332 seconds
cpu usage	0.07819425
max memory	5009408.0

stage attributes

key	value
output-size	22642
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 X) (RULES active(c(X)) -> mark(d(X)) active(f(f(X))) -> mark(c(f(g(f(X))))) active(f(X)) -> f(active(X)) active(h(X)) -> h(active(X)) active(h(X)) -> mark(c(d(X))) c(ok(X)) -> ok(c(X)) d(ok(X)) -> ok(d(X)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) h(mark(X)) -> mark(h(X)) h(ok(X)) -> ok(h(X)) proper(c(X)) -> c(proper(X)) proper(d(X)) -> d(proper(X)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(h(X)) -> h(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(c(X)) -> D(X) ACTIVE(f(f(X))) -> C(f(g(f(X)))) ACTIVE(f(f(X))) -> F(g(f(X))) ACTIVE(f(f(X))) -> G(f(X)) ACTIVE(f(X)) -> ACTIVE(X) ACTIVE(f(X)) -> F(active(X)) ACTIVE(h(X)) -> ACTIVE(X) ACTIVE(h(X)) -> C(d(X)) ACTIVE(h(X)) -> D(X) ACTIVE(h(X)) -> H(active(X)) C(ok(X)) -> C(X) D(ok(X)) -> D(X) F(mark(X)) -> F(X) F(ok(X)) -> F(X) G(ok(X)) -> G(X) H(mark(X)) -> H(X) H(ok(X)) -> H(X) PROPER(c(X)) -> C(proper(X)) PROPER(c(X)) -> PROPER(X) PROPER(d(X)) -> D(proper(X)) PROPER(d(X)) -> PROPER(X) PROPER(f(X)) -> F(proper(X)) PROPER(f(X)) -> PROPER(X) PROPER(g(X)) -> G(proper(X)) PROPER(g(X)) -> PROPER(X) PROPER(h(X)) -> H(proper(X)) PROPER(h(X)) -> PROPER(X) TOP(mark(X)) -> PROPER(X) TOP(mark(X)) -> TOP(proper(X)) TOP(ok(X)) -> ACTIVE(X) TOP(ok(X)) -> TOP(active(X)) -> Rules: active(c(X)) -> mark(d(X)) active(f(f(X))) -> mark(c(f(g(f(X))))) active(f(X)) -> f(active(X)) active(h(X)) -> h(active(X)) active(h(X)) -> mark(c(d(X))) c(ok(X)) -> ok(c(X)) d(ok(X)) -> ok(d(X)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) h(mark(X)) -> mark(h(X)) h(ok(X)) -> ok(h(X)) proper(c(X)) -> c(proper(X)) proper(d(X)) -> d(proper(X)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(h(X)) -> h(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Problem 1: SCC Processor: -> Pairs: ACTIVE(c(X)) -> D(X) ACTIVE(f(f(X))) -> C(f(g(f(X)))) ACTIVE(f(f(X))) -> F(g(f(X))) ACTIVE(f(f(X))) -> G(f(X)) ACTIVE(f(X)) -> ACTIVE(X) ACTIVE(f(X)) -> F(active(X)) ACTIVE(h(X)) -> ACTIVE(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472