details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.136989116669 seconds
cpu usage	0.13909137
max memory	5357568.0

stage attributes

key	value
output-size	28909
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 M N X X1 X2) (RULES active(and(tt,X)) -> mark(X) active(plus(N,s(M))) -> mark(s(plus(N,M))) active(plus(N,0)) -> mark(N) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(plus(N,s(M))) -> MARK(s(plus(N,M))) ACTIVE(plus(N,s(M))) -> PLUS(N,M) ACTIVE(plus(N,s(M))) -> S(plus(N,M)) ACTIVE(plus(N,0)) -> MARK(N) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(plus(X1,X2)) -> PLUS(mark(X1),mark(X2)) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) MARK(s(X)) -> S(mark(X)) PLUS(active(X1),X2) -> PLUS(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) S(active(X)) -> S(X) S(mark(X)) -> S(X) -> Rules: active(and(tt,X)) -> mark(X) active(plus(N,s(M))) -> mark(s(plus(N,M))) active(plus(N,0)) -> mark(N) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(plus(N,s(M))) -> MARK(s(plus(N,M))) ACTIVE(plus(N,s(M))) -> PLUS(N,M) ACTIVE(plus(N,s(M))) -> S(plus(N,M)) ACTIVE(plus(N,0)) -> MARK(N) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) popout

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

job log

popout

actions

all output return to TRS Inner 89993