details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.19945 seconds
cpu usage	1.20616
user time	1.02462
system time	0.181532
max virtual memory	709228.0
max residence set size	19148.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S I:S P:S V:S V1:S V2:S X:S X1:S X2:S Y:S Z:S) (RULES __(active(X1:S),X2:S) -> __(X1:S,X2:S) __(mark(X1:S),X2:S) -> __(X1:S,X2:S) __(X1:S,active(X2:S)) -> __(X1:S,X2:S) __(X1:S,mark(X2:S)) -> __(X1:S,X2:S) active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S))) active(__(nil,X:S)) -> mark(X:S) active(__(X:S,nil)) -> mark(X:S) active(and(tt,X:S)) -> mark(X:S) active(isList(__(V1:S,V2:S))) -> mark(and(isList(V1:S),isList(V2:S))) active(isList(nil)) -> mark(tt) active(isList(V:S)) -> mark(isNeList(V:S)) active(isNeList(__(V1:S,V2:S))) -> mark(and(isList(V1:S),isNeList(V2:S))) active(isNeList(__(V1:S,V2:S))) -> mark(and(isNeList(V1:S),isList(V2:S))) active(isNeList(V:S)) -> mark(isQid(V:S)) active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(and(isQid(I:S),isPal(P:S))) active(isNePal(V:S)) -> mark(isQid(V:S)) active(isPal(nil)) -> mark(tt) active(isPal(V:S)) -> mark(isNePal(V:S)) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) and(active(X1:S),X2:S) -> and(X1:S,X2:S) and(mark(X1:S),X2:S) -> and(X1:S,X2:S) and(X1:S,active(X2:S)) -> and(X1:S,X2:S) and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) isList(active(X:S)) -> isList(X:S) isList(mark(X:S)) -> isList(X:S) isNeList(active(X:S)) -> isNeList(X:S) isNeList(mark(X:S)) -> isNeList(X:S) isNePal(active(X:S)) -> isNePal(X:S) isNePal(mark(X:S)) -> isNePal(X:S) isPal(active(X:S)) -> isPal(X:S) isPal(mark(X:S)) -> isPal(X:S) isQid(active(X:S)) -> isQid(X:S) isQid(mark(X:S)) -> isQid(X:S) mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S))) mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) mark(isList(X:S)) -> active(isList(X:S)) mark(isNeList(X:S)) -> active(isNeList(X:S)) mark(isNePal(X:S)) -> active(isNePal(X:S)) mark(isPal(X:S)) -> active(isPal(X:S)) mark(isQid(X:S)) -> active(isQid(X:S)) mark(a) -> active(a) mark(e) -> active(e) mark(i) -> active(i) mark(nil) -> active(nil) mark(o) -> active(o) mark(tt) -> active(tt) mark(u) -> active(u) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: __#(active(X1:S),X2:S) -> __#(X1:S,X2:S) __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S) __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S) __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S) ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(X:S,__(Y:S,Z:S)) ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(Y:S,Z:S) ACTIVE(__(__(X:S,Y:S),Z:S)) -> MARK(__(X:S,__(Y:S,Z:S))) ACTIVE(__(nil,X:S)) -> MARK(X:S) ACTIVE(__(X:S,nil)) -> MARK(X:S) ACTIVE(and(tt,X:S)) -> MARK(X:S) ACTIVE(isList(__(V1:S,V2:S))) -> AND(isList(V1:S),isList(V2:S)) ACTIVE(isList(__(V1:S,V2:S))) -> ISLIST(V1:S) ACTIVE(isList(__(V1:S,V2:S))) -> ISLIST(V2:S) ACTIVE(isList(__(V1:S,V2:S))) -> MARK(and(isList(V1:S),isList(V2:S))) ACTIVE(isList(nil)) -> MARK(tt) ACTIVE(isList(V:S)) -> ISNELIST(V:S) ACTIVE(isList(V:S)) -> MARK(isNeList(V:S)) ACTIVE(isNeList(__(V1:S,V2:S))) -> AND(isList(V1:S),isNeList(V2:S)) ACTIVE(isNeList(__(V1:S,V2:S))) -> AND(isNeList(V1:S),isList(V2:S)) ACTIVE(isNeList(__(V1:S,V2:S))) -> ISLIST(V1:S) ACTIVE(isNeList(__(V1:S,V2:S))) -> ISLIST(V2:S) ACTIVE(isNeList(__(V1:S,V2:S))) -> ISNELIST(V1:S) ACTIVE(isNeList(__(V1:S,V2:S))) -> ISNELIST(V2:S) ACTIVE(isNeList(__(V1:S,V2:S))) -> MARK(and(isList(V1:S),isNeList(V2:S))) ACTIVE(isNeList(__(V1:S,V2:S))) -> MARK(and(isNeList(V1:S),isList(V2:S))) ACTIVE(isNeList(V:S)) -> ISQID(V:S) ACTIVE(isNeList(V:S)) -> MARK(isQid(V:S)) ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> AND(isQid(I:S),isPal(P:S)) ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> ISPAL(P:S) ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> ISQID(I:S) ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> MARK(and(isQid(I:S),isPal(P:S))) ACTIVE(isNePal(V:S)) -> ISQID(V:S) ACTIVE(isNePal(V:S)) -> MARK(isQid(V:S)) ACTIVE(isPal(nil)) -> MARK(tt) ACTIVE(isPal(V:S)) -> ISNEPAL(V:S) ACTIVE(isPal(V:S)) -> MARK(isNePal(V:S)) popout

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

job log

popout

actions

all output return to TRS Innermost