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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.198996067047 seconds
cpu usage	0.199062956
max memory	7188480.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Inner 89993