details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	20.5715830326 seconds
cpu usage	20.526919292
max memory	1.10764032E8

stage attributes

key	value
output-size	25451
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 X X1 X2) (RULES active(cons(X1,X2)) -> cons(active(X1),X2) active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(f(X)) -> f(active(X)) active(p(s(0))) -> mark(0) active(p(X)) -> p(active(X)) active(s(X)) -> s(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) p(mark(X)) -> mark(p(X)) p(ok(X)) -> ok(p(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(f(X)) -> f(proper(X)) proper(p(X)) -> p(proper(X)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(cons(X1,X2)) -> ACTIVE(X1) ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2) ACTIVE(f(X)) -> ACTIVE(X) ACTIVE(f(X)) -> F(active(X)) ACTIVE(p(X)) -> ACTIVE(X) ACTIVE(p(X)) -> P(active(X)) ACTIVE(s(X)) -> ACTIVE(X) ACTIVE(s(X)) -> S(active(X)) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(ok(X1),ok(X2)) -> CONS(X1,X2) F(mark(X)) -> F(X) F(ok(X)) -> F(X) P(mark(X)) -> P(X) P(ok(X)) -> P(X) PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2)) PROPER(cons(X1,X2)) -> PROPER(X1) PROPER(cons(X1,X2)) -> PROPER(X2) PROPER(f(X)) -> F(proper(X)) PROPER(f(X)) -> PROPER(X) PROPER(p(X)) -> P(proper(X)) PROPER(p(X)) -> PROPER(X) PROPER(s(X)) -> PROPER(X) PROPER(s(X)) -> S(proper(X)) S(mark(X)) -> S(X) S(ok(X)) -> S(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(cons(X1,X2)) -> cons(active(X1),X2) active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(f(X)) -> f(active(X)) active(p(s(0))) -> mark(0) active(p(X)) -> p(active(X)) active(s(X)) -> s(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) p(mark(X)) -> mark(p(X)) p(ok(X)) -> ok(p(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(f(X)) -> f(proper(X)) proper(p(X)) -> p(proper(X)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Problem 1: SCC Processor: -> Pairs: ACTIVE(cons(X1,X2)) -> ACTIVE(X1) ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2) popout

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

job log

popout

actions

all output return to TRS Inner 89993