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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.41114807129 seconds
cpu usage	6.389659003
max memory	4.79965184E8

stage attributes

key	value
output-size	14661
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) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 96 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 4 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (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) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(and(X1, X2)) -> and(active(X1), X2) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(isList(X)) -> isList(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) isList(ok(X)) -> ok(isList(X)) isNeList(ok(X)) -> ok(isNeList(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) isPal(ok(X)) -> ok(isPal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(isList(x0)) active(isNeList(x0)) active(isNePal(x0)) active(isPal(x0)) active(isQid(a)) active(isQid(e)) active(isQid(i)) active(isQid(o)) active(isQid(u)) active(__(x0, x1)) active(and(x0, x1)) __(mark(x0), x1) popout

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

job log

popout

actions

all output return to TRS Innermost