details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.178256 seconds
cpu usage	0.184012
user time	0.139433
system time	0.044579
max virtual memory	113188.0
max residence set size	11992.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 __(mark(X1:S),X2:S) -> mark(__(X1:S,X2:S)) __(ok(X1:S),ok(X2:S)) -> ok(__(X1:S,X2:S)) __(X1:S,mark(X2:S)) -> mark(__(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(__(X1:S,X2:S)) -> __(active(X1:S),X2:S) active(__(X1:S,X2:S)) -> __(X1:S,active(X2:S)) active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2: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(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) isList(ok(X:S)) -> ok(isList(X:S)) isNeList(ok(X:S)) -> ok(isNeList(X:S)) isNePal(ok(X:S)) -> ok(isNePal(X:S)) isPal(ok(X:S)) -> ok(isPal(X:S)) isQid(ok(X:S)) -> ok(isQid(X:S)) proper(__(X1:S,X2:S)) -> __(proper(X1:S),proper(X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(isList(X:S)) -> isList(proper(X:S)) proper(isNeList(X:S)) -> isNeList(proper(X:S)) proper(isNePal(X:S)) -> isNePal(proper(X:S)) proper(isPal(X:S)) -> isPal(proper(X:S)) proper(isQid(X:S)) -> isQid(proper(X:S)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(nil) -> ok(nil) proper(o) -> ok(o) proper(tt) -> ok(tt) proper(u) -> ok(u) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S) __#(ok(X1:S),ok(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(__(X1:S,X2:S)) -> __#(active(X1:S),X2:S) ACTIVE(__(X1:S,X2:S)) -> __#(X1:S,active(X2:S)) ACTIVE(__(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(__(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2: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(V:S)) -> 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(V:S)) -> 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(V:S)) -> ISQID(V:S) ACTIVE(isPal(V:S)) -> ISNEPAL(V:S) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) ISLIST(ok(X:S)) -> ISLIST(X:S) ISNELIST(ok(X:S)) -> ISNELIST(X:S) ISNEPAL(ok(X:S)) -> ISNEPAL(X:S) ISPAL(ok(X:S)) -> ISPAL(X:S) ISQID(ok(X:S)) -> ISQID(X:S) PROPER(__(X1:S,X2:S)) -> __#(proper(X1:S),proper(X2:S)) PROPER(__(X1:S,X2:S)) -> PROPER(X1:S) PROPER(__(X1:S,X2:S)) -> PROPER(X2:S) PROPER(and(X1:S,X2:S)) -> AND(proper(X1:S),proper(X2:S)) PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) popout

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

job log

popout

actions

all output return to TRS Standard