details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	6.22820806503 seconds
cpu usage	0.944294099
max memory	6221824.0

stage attributes

key	value
output-size	37878
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(active(X:S)) -> 2nd(X:S) 2nd(mark(X:S)) -> 2nd(X:S) active(2nd(cons(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) from(active(X:S)) -> from(X:S) from(mark(X:S)) -> from(X:S) mark(2nd(X:S)) -> active(2nd(mark(X:S))) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(from(X:S)) -> active(from(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: 2ND(active(X:S)) -> 2ND(X:S) 2ND(mark(X:S)) -> 2ND(X:S) ACTIVE(2nd(cons(X:S,cons(Y:S,Z:S)))) -> MARK(Y:S) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> MARK(cons(X:S,from(s(X:S)))) ACTIVE(from(X:S)) -> S(X:S) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) FROM(active(X:S)) -> FROM(X:S) FROM(mark(X:S)) -> FROM(X:S) MARK(2nd(X:S)) -> 2ND(mark(X:S)) MARK(2nd(X:S)) -> ACTIVE(2nd(mark(X:S))) MARK(2nd(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> ACTIVE(from(mark(X:S))) MARK(from(X:S)) -> FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) MARK(s(X:S)) -> S(mark(X:S)) S(active(X:S)) -> S(X:S) S(mark(X:S)) -> S(X:S) -> Rules: 2nd(active(X:S)) -> 2nd(X:S) 2nd(mark(X:S)) -> 2nd(X:S) active(2nd(cons(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) from(active(X:S)) -> from(X:S) from(mark(X:S)) -> from(X:S) mark(2nd(X:S)) -> active(2nd(mark(X:S))) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(from(X:S)) -> active(from(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) Problem 1: SCC Processor: -> Pairs: 2ND(active(X:S)) -> 2ND(X:S) 2ND(mark(X:S)) -> 2ND(X:S) ACTIVE(2nd(cons(X:S,cons(Y:S,Z:S)))) -> MARK(Y:S) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> MARK(cons(X:S,from(s(X:S)))) ACTIVE(from(X:S)) -> S(X:S) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) FROM(active(X:S)) -> FROM(X:S) FROM(mark(X:S)) -> FROM(X:S) MARK(2nd(X:S)) -> 2ND(mark(X:S)) MARK(2nd(X:S)) -> ACTIVE(2nd(mark(X:S))) MARK(2nd(X:S)) -> MARK(X:S) popout

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

job log

popout

actions

all output return to TRS Innermost