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	n068.star.cs.uiowa.edu
space	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.481774 seconds
cpu usage	0.165637
user time	0.12243
system time	0.043207
max virtual memory	113176.0
max residence set size	9968.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.47 YES 0.00/0.47 0.00/0.47 Problem 1: 0.00/0.47 0.00/0.47 (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S) 0.00/0.47 (RULES 0.00/0.47 active(and(tt,X:S)) -> mark(X:S) 0.00/0.47 active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) 0.00/0.47 active(plus(N:S,0)) -> mark(N:S) 0.00/0.47 and(active(X1:S),X2:S) -> and(X1:S,X2:S) 0.00/0.47 and(mark(X1:S),X2:S) -> and(X1:S,X2:S) 0.00/0.47 and(X1:S,active(X2:S)) -> and(X1:S,X2:S) 0.00/0.47 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) 0.00/0.47 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) 0.00/0.47 mark(plus(X1:S,X2:S)) -> active(plus(mark(X1:S),mark(X2:S))) 0.00/0.47 mark(s(X:S)) -> active(s(mark(X:S))) 0.00/0.47 mark(0) -> active(0) 0.00/0.47 mark(tt) -> active(tt) 0.00/0.47 plus(active(X1:S),X2:S) -> plus(X1:S,X2:S) 0.00/0.47 plus(mark(X1:S),X2:S) -> plus(X1:S,X2:S) 0.00/0.47 plus(X1:S,active(X2:S)) -> plus(X1:S,X2:S) 0.00/0.47 plus(X1:S,mark(X2:S)) -> plus(X1:S,X2:S) 0.00/0.47 s(active(X:S)) -> s(X:S) 0.00/0.47 s(mark(X:S)) -> s(X:S) 0.00/0.47 ) 0.00/0.47 (STRATEGY INNERMOST) 0.00/0.47 0.00/0.47 Problem 1: 0.00/0.47 0.00/0.47 Dependency Pairs Processor: 0.00/0.47 -> Pairs: 0.00/0.47 ACTIVE(and(tt,X:S)) -> MARK(X:S) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> MARK(s(plus(N:S,M:S))) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) 0.00/0.47 ACTIVE(plus(N:S,0)) -> MARK(N:S) 0.00/0.47 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S) 0.00/0.47 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) 0.00/0.47 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S) 0.00/0.47 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S) 0.00/0.47 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S)) 0.00/0.47 MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S) 0.00/0.47 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> ACTIVE(plus(mark(X1:S),mark(X2:S))) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> PLUS(mark(X1:S),mark(X2:S)) 0.00/0.47 MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) 0.00/0.47 MARK(s(X:S)) -> MARK(X:S) 0.00/0.47 MARK(s(X:S)) -> S(mark(X:S)) 0.00/0.47 PLUS(active(X1:S),X2:S) -> PLUS(X1:S,X2:S) 0.00/0.47 PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) 0.00/0.47 PLUS(X1:S,active(X2:S)) -> PLUS(X1:S,X2:S) 0.00/0.47 PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) 0.00/0.47 S(active(X:S)) -> S(X:S) 0.00/0.47 S(mark(X:S)) -> S(X:S) 0.00/0.47 -> Rules: 0.00/0.47 active(and(tt,X:S)) -> mark(X:S) 0.00/0.47 active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) 0.00/0.47 active(plus(N:S,0)) -> mark(N:S) 0.00/0.47 and(active(X1:S),X2:S) -> and(X1:S,X2:S) 0.00/0.47 and(mark(X1:S),X2:S) -> and(X1:S,X2:S) 0.00/0.47 and(X1:S,active(X2:S)) -> and(X1:S,X2:S) 0.00/0.47 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) 0.00/0.47 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) 0.00/0.47 mark(plus(X1:S,X2:S)) -> active(plus(mark(X1:S),mark(X2:S))) 0.00/0.47 mark(s(X:S)) -> active(s(mark(X:S))) 0.00/0.47 mark(0) -> active(0) 0.00/0.47 mark(tt) -> active(tt) 0.00/0.47 plus(active(X1:S),X2:S) -> plus(X1:S,X2:S) 0.00/0.47 plus(mark(X1:S),X2:S) -> plus(X1:S,X2:S) 0.00/0.47 plus(X1:S,active(X2:S)) -> plus(X1:S,X2:S) 0.00/0.47 plus(X1:S,mark(X2:S)) -> plus(X1:S,X2:S) 0.00/0.47 s(active(X:S)) -> s(X:S) 0.00/0.47 s(mark(X:S)) -> s(X:S) 0.00/0.47 0.00/0.47 Problem 1: 0.00/0.47 0.00/0.47 SCC Processor: 0.00/0.47 -> Pairs: 0.00/0.47 ACTIVE(and(tt,X:S)) -> MARK(X:S) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> MARK(s(plus(N:S,M:S))) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) 0.00/0.47 ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) 0.00/0.47 ACTIVE(plus(N:S,0)) -> MARK(N:S) 0.00/0.47 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S) 0.00/0.47 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) 0.00/0.47 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S) 0.00/0.47 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S) 0.00/0.47 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S)) 0.00/0.47 MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S) 0.00/0.47 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> ACTIVE(plus(mark(X1:S),mark(X2:S))) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.47 MARK(plus(X1:S,X2:S)) -> PLUS(mark(X1:S),mark(X2:S)) 0.00/0.47 MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) 0.00/0.47 MARK(s(X:S)) -> MARK(X:S) 0.00/0.47 MARK(s(X:S)) -> S(mark(X:S)) 0.00/0.47 PLUS(active(X1:S),X2:S) -> PLUS(X1:S,X2:S) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12