details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0832469463348 seconds
cpu usage	0.066097771
max memory	5312512.0

stage attributes

key	value
output-size	11501
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR I P V V1 V2 X Y Z) (STRATEGY CONTEXTSENSITIVE (__ 1 2) (and 1) (isList) (isNeList) (isNePal) (isPal) (isQid) (a) (e) (i) (nil) (o) (tt) (u) ) (RULES __(__(X,Y),Z) -> __(X,__(Y,Z)) __(nil,X) -> X __(X,nil) -> X and(tt,X) -> X isList(__(V1,V2)) -> and(isList(V1),isList(V2)) isList(nil) -> tt isList(V) -> isNeList(V) isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) isNeList(V) -> isQid(V) isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) isNePal(V) -> isQid(V) isPal(nil) -> tt isPal(V) -> isNePal(V) isQid(a) -> tt isQid(e) -> tt isQid(i) -> tt isQid(o) -> tt isQid(u) -> tt ) Problem 1: Dependency Pairs Processor: -> Pairs: __#(__(X,Y),Z) -> __#(X,__(Y,Z)) __#(__(X,Y),Z) -> __#(Y,Z) AND(tt,X) -> X ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) ISLIST(__(V1,V2)) -> ISLIST(V1) ISLIST(V) -> ISNELIST(V) ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) ISNELIST(__(V1,V2)) -> ISLIST(V1) ISNELIST(__(V1,V2)) -> ISNELIST(V1) ISNELIST(V) -> ISQID(V) ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) ISNEPAL(__(I,__(P,I))) -> ISQID(I) ISNEPAL(V) -> ISQID(V) ISPAL(V) -> ISNEPAL(V) -> Rules: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(nil,X) -> X __(X,nil) -> X and(tt,X) -> X isList(__(V1,V2)) -> and(isList(V1),isList(V2)) isList(nil) -> tt isList(V) -> isNeList(V) isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) isNeList(V) -> isQid(V) isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) isNePal(V) -> isQid(V) isPal(nil) -> tt isPal(V) -> isNePal(V) isQid(a) -> tt isQid(e) -> tt isQid(i) -> tt isQid(o) -> tt isQid(u) -> tt -> Unhiding Rules: isList(V2) -> ISLIST(V2) isNeList(V2) -> ISNELIST(V2) isPal(P) -> ISPAL(P) Problem 1: SCC Processor: -> Pairs: __#(__(X,Y),Z) -> __#(X,__(Y,Z)) __#(__(X,Y),Z) -> __#(Y,Z) AND(tt,X) -> X popout

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

job log

popout

actions

all output return to TRS Context Sensitive