details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	11.4761459827 seconds
cpu usage	11.518417685
max memory	7.66070784E8

stage attributes

key	value
output-size	90766
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, 111 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 21 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 17 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 18 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 16 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 14 ms] (14) CSR (15) CSRRRRProof [EQUIVALENT, 0 ms] (16) CSR (17) CSRRRRProof [EQUIVALENT, 10 ms] (18) CSR (19) CSRRRRProof [EQUIVALENT, 28 ms] (20) CSR (21) CSRRRRProof [EQUIVALENT, 0 ms] (22) CSR (23) CSRRRRProof [EQUIVALENT, 11 ms] (24) CSR (25) CSRRRRProof [EQUIVALENT, 0 ms] (26) CSR (27) CSRRRRProof [EQUIVALENT, 14 ms] (28) CSR (29) CSRRRRProof [EQUIVALENT, 0 ms] (30) CSR (31) CSRRRRProof [EQUIVALENT, 7 ms] (32) CSR (33) CSRRRRProof [EQUIVALENT, 0 ms] (34) CSR (35) CSRRRRProof [EQUIVALENT, 0 ms] (36) CSR (37) CSRRRRProof [EQUIVALENT, 5 ms] (38) CSR (39) CSRRRRProof [EQUIVALENT, 0 ms] (40) CSR (41) CSRRRRProof [EQUIVALENT, 0 ms] (42) CSR (43) CSRRRRProof [EQUIVALENT, 3 ms] (44) CSR (45) RisEmptyProof [EQUIVALENT, 0 ms] (46) 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) popout

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

job log

popout

actions

all output return to TRS Innermost