details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.196734189987 seconds
cpu usage	0.15124468
max memory	4939776.0

stage attributes

key	value
output-size	17528
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 v_NonEmpty:S X:S X1:S X2:S XS:S) (RULES active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(tail(X:S)) -> tail(active(X:S)) active(zeros) -> mark(cons(0,zeros)) 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)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(tail(X:S)) -> tail(proper(X:S)) proper(0) -> ok(0) proper(zeros) -> ok(zeros) tail(mark(X:S)) -> mark(tail(X:S)) tail(ok(X:S)) -> ok(tail(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(tail(X:S)) -> ACTIVE(X:S) ACTIVE(tail(X:S)) -> TAIL(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) 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(tail(X:S)) -> PROPER(X:S) PROPER(tail(X:S)) -> TAIL(proper(X:S)) TAIL(mark(X:S)) -> TAIL(X:S) TAIL(ok(X:S)) -> TAIL(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(tail(cons(X:S,XS:S))) -> mark(XS:S) active(tail(X:S)) -> tail(active(X:S)) active(zeros) -> mark(cons(0,zeros)) 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)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(tail(X:S)) -> tail(proper(X:S)) proper(0) -> ok(0) proper(zeros) -> ok(zeros) tail(mark(X:S)) -> mark(tail(X:S)) tail(ok(X:S)) -> ok(tail(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(tail(X:S)) -> ACTIVE(X:S) ACTIVE(tail(X:S)) -> TAIL(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) 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(tail(X:S)) -> PROPER(X:S) PROPER(tail(X:S)) -> TAIL(proper(X:S)) TAIL(mark(X:S)) -> TAIL(X:S) TAIL(ok(X:S)) -> TAIL(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(tail(cons(X:S,XS:S))) -> mark(XS:S) active(tail(X:S)) -> tail(active(X:S)) active(zeros) -> mark(cons(0,zeros)) 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)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(tail(X:S)) -> tail(proper(X:S)) proper(0) -> ok(0) proper(zeros) -> ok(zeros) tail(mark(X:S)) -> mark(tail(X:S)) tail(ok(X:S)) -> ok(tail(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost