details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.330186128616 seconds
cpu usage	0.342716295
max memory	6893568.0

stage attributes

key	value
output-size	60224
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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 U11(tt) -> tt U21(tt,V2:S) -> U22(isList(activate(V2:S))) U22(tt) -> tt U31(tt) -> tt U41(tt,V2:S) -> U42(isNeList(activate(V2:S))) U42(tt) -> tt U51(tt,V2:S) -> U52(isList(activate(V2:S))) U52(tt) -> tt U61(tt) -> tt U71(tt,P:S) -> U72(isPal(activate(P:S))) U72(tt) -> tt U81(tt) -> tt __(__(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)) -> __(activate(X1:S),activate(X2:S)) activate(n__a) -> a activate(n__e) -> e activate(n__i) -> i activate(n__nil) -> nil activate(n__o) -> o activate(n__u) -> u activate(X:S) -> X:S e -> n__e i -> n__i isList(n____(V1:S,V2:S)) -> U21(isList(activate(V1:S)),activate(V2:S)) isList(n__nil) -> tt isList(V:S) -> U11(isNeList(activate(V:S))) isNeList(n____(V1:S,V2:S)) -> U41(isList(activate(V1:S)),activate(V2:S)) isNeList(n____(V1:S,V2:S)) -> U51(isNeList(activate(V1:S)),activate(V2:S)) isNeList(V:S) -> U31(isQid(activate(V:S))) isNePal(n____(I:S,n____(P:S,I:S))) -> U71(isQid(activate(I:S)),activate(P:S)) isNePal(V:S) -> U61(isQid(activate(V:S))) isPal(n__nil) -> tt isPal(V:S) -> U81(isNePal(activate(V: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: U21#(tt,V2:S) -> U22#(isList(activate(V2:S))) U21#(tt,V2:S) -> ACTIVATE(V2:S) U21#(tt,V2:S) -> ISLIST(activate(V2:S)) U41#(tt,V2:S) -> U42#(isNeList(activate(V2:S))) U41#(tt,V2:S) -> ACTIVATE(V2:S) U41#(tt,V2:S) -> ISNELIST(activate(V2:S)) U51#(tt,V2:S) -> U52#(isList(activate(V2:S))) U51#(tt,V2:S) -> ACTIVATE(V2:S) U51#(tt,V2:S) -> ISLIST(activate(V2:S)) U71#(tt,P:S) -> U72#(isPal(activate(P:S))) U71#(tt,P:S) -> ACTIVATE(P:S) U71#(tt,P:S) -> ISPAL(activate(P:S)) __#(__(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)) -> __#(activate(X1:S),activate(X2:S)) ACTIVATE(n____(X1:S,X2:S)) -> ACTIVATE(X1:S) ACTIVATE(n____(X1:S,X2:S)) -> ACTIVATE(X2:S) ACTIVATE(n__a) -> A ACTIVATE(n__e) -> E ACTIVATE(n__i) -> I ACTIVATE(n__nil) -> NIL ACTIVATE(n__o) -> O ACTIVATE(n__u) -> U ISLIST(n____(V1:S,V2:S)) -> U21#(isList(activate(V1:S)),activate(V2: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)) -> ISLIST(activate(V1:S)) ISLIST(V:S) -> U11#(isNeList(activate(V:S))) ISLIST(V:S) -> ACTIVATE(V:S) ISLIST(V:S) -> ISNELIST(activate(V:S)) ISNELIST(n____(V1:S,V2:S)) -> U41#(isList(activate(V1:S)),activate(V2:S)) ISNELIST(n____(V1:S,V2:S)) -> U51#(isNeList(activate(V1:S)),activate(V2: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)) -> ISLIST(activate(V1:S)) ISNELIST(n____(V1:S,V2:S)) -> ISNELIST(activate(V1:S)) ISNELIST(V:S) -> U31#(isQid(activate(V:S))) popout

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

job log

popout

actions

all output return to TRS Standard