details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.04989814758 seconds
cpu usage	4.982797372
max memory	2.7521024E8

stage attributes

key	value
output-size	23871
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 88 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 7 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 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(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(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(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) popout

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

job log

popout

actions

all output return to TRS Innermost