details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	4.05032300949 seconds
cpu usage	12.265887109
max memory	7.72235264E8

stage attributes

key	value
output-size	38846
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 995 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 294 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 8 ms] (6) QTRS (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt, V)) -> mark(U12(isNeList(V))) active(U12(tt)) -> mark(tt) active(U21(tt, V1, V2)) -> mark(U22(isList(V1), V2)) active(U22(tt, V2)) -> mark(U23(isList(V2))) active(U23(tt)) -> mark(tt) active(U31(tt, V)) -> mark(U32(isQid(V))) active(U32(tt)) -> mark(tt) active(U41(tt, V1, V2)) -> mark(U42(isList(V1), V2)) active(U42(tt, V2)) -> mark(U43(isNeList(V2))) active(U43(tt)) -> mark(tt) active(U51(tt, V1, V2)) -> mark(U52(isNeList(V1), V2)) active(U52(tt, V2)) -> mark(U53(isList(V2))) active(U53(tt)) -> mark(tt) active(U61(tt, V)) -> mark(U62(isQid(V))) active(U62(tt)) -> mark(tt) active(U71(tt, V)) -> mark(U72(isNePal(V))) active(U72(tt)) -> mark(tt) active(and(tt, X)) -> mark(X) active(isList(V)) -> mark(U11(isPalListKind(V), V)) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(and(isPalListKind(V1), isPalListKind(V2)), V1, V2)) active(isNeList(V)) -> mark(U31(isPalListKind(V), V)) active(isNeList(__(V1, V2))) -> mark(U41(and(isPalListKind(V1), isPalListKind(V2)), V1, V2)) active(isNeList(__(V1, V2))) -> mark(U51(and(isPalListKind(V1), isPalListKind(V2)), V1, V2)) active(isNePal(V)) -> mark(U61(isPalListKind(V), V)) active(isNePal(__(I, __(P, I)))) -> mark(and(and(isQid(I), isPalListKind(I)), and(isPal(P), isPalListKind(P)))) active(isPal(V)) -> mark(U71(isPalListKind(V), V)) active(isPal(nil)) -> mark(tt) active(isPalListKind(a)) -> mark(tt) active(isPalListKind(e)) -> mark(tt) active(isPalListKind(i)) -> mark(tt) active(isPalListKind(nil)) -> mark(tt) active(isPalListKind(o)) -> mark(tt) active(isPalListKind(u)) -> mark(tt) active(isPalListKind(__(V1, V2))) -> mark(and(isPalListKind(V1), isPalListKind(V2))) 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) mark(__(X1, X2)) -> active(__(mark(X1), mark(X2))) mark(nil) -> active(nil) mark(U11(X1, X2)) -> active(U11(mark(X1), X2)) mark(tt) -> active(tt) mark(U12(X)) -> active(U12(mark(X))) mark(isNeList(X)) -> active(isNeList(X)) mark(U21(X1, X2, X3)) -> active(U21(mark(X1), X2, X3)) mark(U22(X1, X2)) -> active(U22(mark(X1), X2)) mark(isList(X)) -> active(isList(X)) mark(U23(X)) -> active(U23(mark(X))) mark(U31(X1, X2)) -> active(U31(mark(X1), X2)) mark(U32(X)) -> active(U32(mark(X))) mark(isQid(X)) -> active(isQid(X)) mark(U41(X1, X2, X3)) -> active(U41(mark(X1), X2, X3)) mark(U42(X1, X2)) -> active(U42(mark(X1), X2)) mark(U43(X)) -> active(U43(mark(X))) mark(U51(X1, X2, X3)) -> active(U51(mark(X1), X2, X3)) mark(U52(X1, X2)) -> active(U52(mark(X1), X2)) mark(U53(X)) -> active(U53(mark(X))) mark(U61(X1, X2)) -> active(U61(mark(X1), X2)) mark(U62(X)) -> active(U62(mark(X))) mark(U71(X1, X2)) -> active(U71(mark(X1), X2)) mark(U72(X)) -> active(U72(mark(X))) mark(isNePal(X)) -> active(isNePal(X)) mark(and(X1, X2)) -> active(and(mark(X1), X2)) mark(isPalListKind(X)) -> active(isPalListKind(X)) popout

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

job log

popout

actions

all output return to TRS Innermost