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	n107.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.938159942627 seconds
cpu usage	0.958235595
max memory	1.185792E7

stage attributes

key	value
output-size	185936
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 I P V V1 V2 X X1 X2 Y Z) (RULES __(active(X1),X2) -> __(X1,X2) __(mark(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil,X)) -> mark(X) active(__(X,nil)) -> mark(X) active(and(tt,X)) -> mark(X) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isList(nil)) -> mark(tt) active(isList(V)) -> mark(isNeList(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isNePal(V)) -> mark(isQid(V)) active(isPal(nil)) -> mark(tt) active(isPal(V)) -> mark(isNePal(V)) 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),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isList(active(X)) -> isList(X) isList(mark(X)) -> isList(X) isNeList(active(X)) -> isNeList(X) isNeList(mark(X)) -> isNeList(X) isNePal(active(X)) -> isNePal(X) isNePal(mark(X)) -> isNePal(X) isPal(active(X)) -> isPal(X) isPal(mark(X)) -> isPal(X) isQid(active(X)) -> isQid(X) isQid(mark(X)) -> isQid(X) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(isQid(X)) -> active(isQid(X)) 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) ) Problem 1: Dependency Pairs Processor: -> Pairs: __#(active(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) ACTIVE(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ACTIVE(__(__(X,Y),Z)) -> __#(Y,Z) ACTIVE(__(__(X,Y),Z)) -> MARK(__(X,__(Y,Z))) ACTIVE(__(nil,X)) -> MARK(X) ACTIVE(__(X,nil)) -> MARK(X) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isList(__(V1,V2))) -> AND(isList(V1),isList(V2)) ACTIVE(isList(__(V1,V2))) -> ISLIST(V1) ACTIVE(isList(__(V1,V2))) -> ISLIST(V2) ACTIVE(isList(__(V1,V2))) -> MARK(and(isList(V1),isList(V2))) ACTIVE(isList(nil)) -> MARK(tt) ACTIVE(isList(V)) -> ISNELIST(V) ACTIVE(isList(V)) -> MARK(isNeList(V)) ACTIVE(isNeList(__(V1,V2))) -> AND(isList(V1),isNeList(V2)) ACTIVE(isNeList(__(V1,V2))) -> AND(isNeList(V1),isList(V2)) ACTIVE(isNeList(__(V1,V2))) -> ISLIST(V1) ACTIVE(isNeList(__(V1,V2))) -> ISLIST(V2) ACTIVE(isNeList(__(V1,V2))) -> ISNELIST(V1) ACTIVE(isNeList(__(V1,V2))) -> ISNELIST(V2) ACTIVE(isNeList(__(V1,V2))) -> MARK(and(isList(V1),isNeList(V2))) ACTIVE(isNeList(__(V1,V2))) -> MARK(and(isNeList(V1),isList(V2))) ACTIVE(isNeList(V)) -> ISQID(V) ACTIVE(isNeList(V)) -> MARK(isQid(V)) ACTIVE(isNePal(__(I,__(P,I)))) -> AND(isQid(I),isPal(P)) ACTIVE(isNePal(__(I,__(P,I)))) -> ISPAL(P) ACTIVE(isNePal(__(I,__(P,I)))) -> ISQID(I) ACTIVE(isNePal(__(I,__(P,I)))) -> MARK(and(isQid(I),isPal(P))) popout

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

job log

popout

actions

all output return to TRS Stand 20472