details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.420831 seconds
cpu usage	0.420736
user time	0.326402
system time	0.094334
max virtual memory	113188.0
max residence set size	10004.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 __(__(X:S,Y:S),Z:S) -> __(X:S,__(Y:S,Z:S)) __(nil,X:S) -> X:S __(X:S,nil) -> X:S __(X1:S,X2:S) -> n____(X1:S,X2:S) a -> n__a activate(n____(X1:S,X2:S)) -> __(X1:S,X2:S) activate(n__a) -> a activate(n__e) -> e activate(n__i) -> i activate(n__isList(X:S)) -> isList(X:S) activate(n__isNeList(X:S)) -> isNeList(X:S) activate(n__isPal(X:S)) -> isPal(X:S) activate(n__nil) -> nil activate(n__o) -> o activate(n__u) -> u activate(X:S) -> X:S and(tt,X:S) -> activate(X:S) e -> n__e i -> n__i isList(n____(V1:S,V2:S)) -> and(isList(activate(V1:S)),n__isList(activate(V2:S))) isList(n__nil) -> tt isList(V:S) -> isNeList(activate(V:S)) isList(X:S) -> n__isList(X:S) isNeList(n____(V1:S,V2:S)) -> and(isList(activate(V1:S)),n__isNeList(activate(V2:S))) isNeList(n____(V1:S,V2:S)) -> and(isNeList(activate(V1:S)),n__isList(activate(V2:S))) isNeList(V:S) -> isQid(activate(V:S)) isNeList(X:S) -> n__isNeList(X:S) isNePal(n____(I:S,__(P:S,I:S))) -> and(isQid(activate(I:S)),n__isPal(activate(P:S))) isNePal(V:S) -> isQid(activate(V:S)) isPal(n__nil) -> tt isPal(V:S) -> isNePal(activate(V:S)) isPal(X:S) -> n__isPal(X:S) isQid(n__a) -> tt isQid(n__e) -> tt isQid(n__i) -> tt isQid(n__o) -> tt isQid(n__u) -> tt nil -> n__nil o -> n__o u -> n__u ) Problem 1: Dependency Pairs Processor: -> Pairs: __#(__(X:S,Y:S),Z:S) -> __#(X:S,__(Y:S,Z:S)) __#(__(X:S,Y:S),Z:S) -> __#(Y:S,Z:S) ACTIVATE(n____(X1:S,X2:S)) -> __#(X1:S,X2:S) ACTIVATE(n__a) -> A ACTIVATE(n__e) -> E ACTIVATE(n__i) -> I ACTIVATE(n__isList(X:S)) -> ISLIST(X:S) ACTIVATE(n__isNeList(X:S)) -> ISNELIST(X:S) ACTIVATE(n__isPal(X:S)) -> ISPAL(X:S) ACTIVATE(n__nil) -> NIL ACTIVATE(n__o) -> O ACTIVATE(n__u) -> U AND(tt,X:S) -> ACTIVATE(X:S) ISLIST(n____(V1:S,V2:S)) -> ACTIVATE(V1:S) ISLIST(n____(V1:S,V2:S)) -> ACTIVATE(V2:S) ISLIST(n____(V1:S,V2:S)) -> AND(isList(activate(V1:S)),n__isList(activate(V2:S))) ISLIST(n____(V1:S,V2:S)) -> ISLIST(activate(V1:S)) ISLIST(V:S) -> ACTIVATE(V:S) ISLIST(V:S) -> ISNELIST(activate(V:S)) ISNELIST(n____(V1:S,V2:S)) -> ACTIVATE(V1:S) ISNELIST(n____(V1:S,V2:S)) -> ACTIVATE(V2:S) ISNELIST(n____(V1:S,V2:S)) -> AND(isList(activate(V1:S)),n__isNeList(activate(V2:S))) ISNELIST(n____(V1:S,V2:S)) -> AND(isNeList(activate(V1:S)),n__isList(activate(V2:S))) ISNELIST(n____(V1:S,V2:S)) -> ISLIST(activate(V1:S)) ISNELIST(n____(V1:S,V2:S)) -> ISNELIST(activate(V1:S)) ISNELIST(V:S) -> ACTIVATE(V:S) ISNELIST(V:S) -> ISQID(activate(V:S)) ISNEPAL(n____(I:S,__(P:S,I:S))) -> ACTIVATE(I:S) ISNEPAL(n____(I:S,__(P:S,I:S))) -> ACTIVATE(P:S) ISNEPAL(n____(I:S,__(P:S,I:S))) -> AND(isQid(activate(I:S)),n__isPal(activate(P:S))) ISNEPAL(n____(I:S,__(P:S,I:S))) -> ISQID(activate(I:S)) ISNEPAL(V:S) -> ACTIVATE(V:S) ISNEPAL(V:S) -> ISQID(activate(V:S)) ISPAL(V:S) -> ACTIVATE(V:S) ISPAL(V:S) -> ISNEPAL(activate(V:S)) -> Rules: __(__(X:S,Y:S),Z:S) -> __(X:S,__(Y:S,Z:S)) __(nil,X:S) -> X:S __(X:S,nil) -> X:S __(X1:S,X2:S) -> n____(X1:S,X2:S) a -> n__a activate(n____(X1:S,X2:S)) -> __(X1:S,X2:S) activate(n__a) -> a activate(n__e) -> e activate(n__i) -> i activate(n__isList(X:S)) -> isList(X:S) activate(n__isNeList(X:S)) -> isNeList(X:S) activate(n__isPal(X:S)) -> isPal(X:S) popout

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

job log

popout

actions

all output return to TRS Standard