details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.132306098938 seconds
cpu usage	0.103642678
max memory	5201920.0

stage attributes

key	value
output-size	29706
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 v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES 2nd(mark(X:S)) -> mark(2nd(X:S)) 2nd(ok(X:S)) -> ok(2nd(X:S)) active(2nd(cons(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) active(2nd(X:S)) -> 2nd(active(X:S)) active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(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)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(2nd(X:S)) -> 2nd(proper(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) 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: 2ND(mark(X:S)) -> 2ND(X:S) 2ND(ok(X:S)) -> 2ND(X:S) ACTIVE(2nd(X:S)) -> 2ND(active(X:S)) ACTIVE(2nd(X:S)) -> ACTIVE(X:S) ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(from(X:S)) -> ACTIVE(X:S) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(active(X:S)) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> S(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) FROM(mark(X:S)) -> FROM(X:S) FROM(ok(X:S)) -> FROM(X:S) PROPER(2nd(X:S)) -> 2ND(proper(X:S)) PROPER(2nd(X:S)) -> PROPER(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(from(X:S)) -> FROM(proper(X:S)) PROPER(from(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: 2nd(mark(X:S)) -> mark(2nd(X:S)) 2nd(ok(X:S)) -> ok(2nd(X:S)) active(2nd(cons(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) active(2nd(X:S)) -> 2nd(active(X:S)) active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(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)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(2nd(X:S)) -> 2nd(proper(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) 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: 2ND(mark(X:S)) -> 2ND(X:S) 2ND(ok(X:S)) -> 2ND(X:S) ACTIVE(2nd(X:S)) -> 2ND(active(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost