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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.0248670578 seconds
cpu usage	8.773080952
max memory	6.10410496E8

stage attributes

key	value
output-size	21580
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 184 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 50 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 50 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 28 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 20 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 0 ms] (12) QTRS (13) RisEmptyProof [EQUIVALENT, 0 ms] (14) 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(and(tt, X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(and(isList(V1), isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1, V2))) -> mark(and(isList(V1), isNeList(V2))) active(isNeList(__(V1, V2))) -> mark(and(isNeList(V1), isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I, __(P, I)))) -> mark(and(isQid(I), isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil)) -> mark(tt) 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(and(X1, X2)) -> active(and(mark(X1), X2)) mark(tt) -> active(tt) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a) -> active(a) mark(e) -> active(e) mark(i) -> active(i) mark(o) -> active(o) mark(u) -> active(u) __(mark(X1), X2) -> __(X1, X2) __(X1, mark(X2)) -> __(X1, X2) __(active(X1), X2) -> __(X1, X2) __(X1, active(X2)) -> __(X1, X2) and(mark(X1), X2) -> and(X1, X2) and(X1, mark(X2)) -> and(X1, X2) and(active(X1), X2) -> and(X1, X2) and(X1, active(X2)) -> and(X1, X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) The set Q consists of the following terms: active(__(__(x0, x1), x2)) active(__(x0, nil)) active(__(nil, x0)) active(and(tt, x0)) active(isList(x0)) active(isNeList(x0)) active(isNePal(x0)) active(isPal(x0)) active(isQid(a)) popout

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

job log

popout

actions

all output return to TRS Innermost