details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	66.0446 seconds
cpu usage	65.7646
user time	65.0086
system time	0.756058
max virtual memory	924944.0
max residence set size	79296.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S) (RULES active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(f(X:S)) -> f(active(X:S)) active(p(s(X:S))) -> mark(X:S) active(p(X:S)) -> p(active(X:S)) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) p(mark(X:S)) -> mark(p(X:S)) p(ok(X:S)) -> ok(p(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(f(X:S)) -> f(proper(X:S)) proper(p(X:S)) -> p(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(p(X:S)) -> ACTIVE(X:S) ACTIVE(p(X:S)) -> P(active(X:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) F(mark(X:S)) -> F(X:S) F(ok(X:S)) -> F(X:S) P(mark(X:S)) -> P(X:S) P(ok(X:S)) -> P(X:S) PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(f(X:S)) -> F(proper(X:S)) PROPER(f(X:S)) -> PROPER(X:S) PROPER(p(X:S)) -> P(proper(X:S)) PROPER(p(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(f(X:S)) -> f(active(X:S)) active(p(s(X:S))) -> mark(X:S) active(p(X:S)) -> p(active(X:S)) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) p(mark(X:S)) -> mark(p(X:S)) p(ok(X:S)) -> ok(p(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(f(X:S)) -> f(proper(X:S)) proper(p(X:S)) -> p(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(p(X:S)) -> ACTIVE(X:S) ACTIVE(p(X:S)) -> P(active(X:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost