details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.514072179794 seconds
cpu usage	0.439076173
max memory	9519104.0

stage attributes

key	value
output-size	92892
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 Y:S Z:S) (RULES active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S))) active(add(0,X:S)) -> mark(X:S) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(fst(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,fst(X:S,Z:S))) active(fst(0,Z:S)) -> mark(nil) active(len(cons(X:S,Z:S))) -> mark(s(len(Z:S))) active(len(nil)) -> mark(0) add(active(X1:S),X2:S) -> add(X1:S,X2:S) add(mark(X1:S),X2:S) -> add(X1:S,X2:S) add(X1:S,active(X2:S)) -> add(X1:S,X2:S) add(X1:S,mark(X2:S)) -> add(X1:S,X2: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) fst(active(X1:S),X2:S) -> fst(X1:S,X2:S) fst(mark(X1:S),X2:S) -> fst(X1:S,X2:S) fst(X1:S,active(X2:S)) -> fst(X1:S,X2:S) fst(X1:S,mark(X2:S)) -> fst(X1:S,X2:S) len(active(X:S)) -> len(X:S) len(mark(X:S)) -> len(X:S) mark(add(X1:S,X2:S)) -> active(add(mark(X1:S),mark(X2:S))) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(from(X:S)) -> active(from(mark(X:S))) mark(fst(X1:S,X2:S)) -> active(fst(mark(X1:S),mark(X2:S))) mark(len(X:S)) -> active(len(mark(X:S))) mark(s(X:S)) -> active(s(X:S)) mark(0) -> active(0) mark(nil) -> active(nil) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X:S),Y:S)) -> ADD(X:S,Y:S) ACTIVE(add(s(X:S),Y:S)) -> MARK(s(add(X:S,Y:S))) ACTIVE(add(s(X:S),Y:S)) -> S(add(X:S,Y:S)) ACTIVE(add(0,X:S)) -> MARK(X: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) ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,fst(X:S,Z:S)) ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> FST(X:S,Z:S) ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> MARK(cons(Y:S,fst(X:S,Z:S))) ACTIVE(fst(0,Z:S)) -> MARK(nil) ACTIVE(len(cons(X:S,Z:S))) -> LEN(Z:S) ACTIVE(len(cons(X:S,Z:S))) -> MARK(s(len(Z:S))) ACTIVE(len(cons(X:S,Z:S))) -> S(len(Z:S)) ACTIVE(len(nil)) -> MARK(0) ADD(active(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(mark(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(X1:S,active(X2:S)) -> ADD(X1:S,X2:S) ADD(X1:S,mark(X2:S)) -> ADD(X1:S,X2: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) FST(active(X1:S),X2:S) -> FST(X1:S,X2:S) FST(mark(X1:S),X2:S) -> FST(X1:S,X2:S) FST(X1:S,active(X2:S)) -> FST(X1:S,X2:S) FST(X1:S,mark(X2:S)) -> FST(X1:S,X2:S) LEN(active(X:S)) -> LEN(X:S) LEN(mark(X:S)) -> LEN(X:S) MARK(add(X1:S,X2:S)) -> ACTIVE(add(mark(X1:S),mark(X2:S))) MARK(add(X1:S,X2:S)) -> ADD(mark(X1:S),mark(X2:S)) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(add(X1:S,X2:S)) -> MARK(X2: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(fst(X1:S,X2:S)) -> ACTIVE(fst(mark(X1:S),mark(X2:S))) MARK(fst(X1:S,X2:S)) -> FST(mark(X1:S),mark(X2:S)) MARK(fst(X1:S,X2:S)) -> MARK(X1:S) MARK(fst(X1:S,X2:S)) -> MARK(X2:S) MARK(len(X:S)) -> ACTIVE(len(mark(X:S))) MARK(len(X:S)) -> LEN(mark(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost