details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.5870039463 seconds
cpu usage	7.326848713
max memory	4.70458368E8

stage attributes

key	value
output-size	18746
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 185 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 71 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 29 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 19 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 3 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) a____(X, nil) -> mark(X) a____(nil, X) -> mark(X) a__U11(tt) -> tt a__U21(tt, V2) -> a__U22(a__isList(V2)) a__U22(tt) -> tt a__U31(tt) -> tt a__U41(tt, V2) -> a__U42(a__isNeList(V2)) a__U42(tt) -> tt a__U51(tt, V2) -> a__U52(a__isList(V2)) a__U52(tt) -> tt a__U61(tt) -> tt a__U71(tt, P) -> a__U72(a__isPal(P)) a__U72(tt) -> tt a__U81(tt) -> tt a__isList(V) -> a__U11(a__isNeList(V)) a__isList(nil) -> tt a__isList(__(V1, V2)) -> a__U21(a__isList(V1), V2) a__isNeList(V) -> a__U31(a__isQid(V)) a__isNeList(__(V1, V2)) -> a__U41(a__isList(V1), V2) a__isNeList(__(V1, V2)) -> a__U51(a__isNeList(V1), V2) a__isNePal(V) -> a__U61(a__isQid(V)) a__isNePal(__(I, __(P, I))) -> a__U71(a__isQid(I), P) a__isPal(V) -> a__U81(a__isNePal(V)) a__isPal(nil) -> tt a__isQid(a) -> tt a__isQid(e) -> tt a__isQid(i) -> tt a__isQid(o) -> tt a__isQid(u) -> tt mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U21(X1, X2)) -> a__U21(mark(X1), X2) mark(U22(X)) -> a__U22(mark(X)) mark(isList(X)) -> a__isList(X) mark(U31(X)) -> a__U31(mark(X)) mark(U41(X1, X2)) -> a__U41(mark(X1), X2) mark(U42(X)) -> a__U42(mark(X)) mark(isNeList(X)) -> a__isNeList(X) mark(U51(X1, X2)) -> a__U51(mark(X1), X2) mark(U52(X)) -> a__U52(mark(X)) mark(U61(X)) -> a__U61(mark(X)) mark(U71(X1, X2)) -> a__U71(mark(X1), X2) mark(U72(X)) -> a__U72(mark(X)) mark(isPal(X)) -> a__isPal(X) mark(U81(X)) -> a__U81(mark(X)) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(nil) -> nil mark(tt) -> tt mark(a) -> a mark(e) -> e mark(i) -> i mark(o) -> o mark(u) -> u a____(X1, X2) -> __(X1, X2) a__U11(X) -> U11(X) a__U21(X1, X2) -> U21(X1, X2) a__U22(X) -> U22(X) a__isList(X) -> isList(X) a__U31(X) -> U31(X) a__U41(X1, X2) -> U41(X1, X2) a__U42(X) -> U42(X) a__isNeList(X) -> isNeList(X) a__U51(X1, X2) -> U51(X1, X2) popout

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

job log

popout

actions

all output return to TRS Stand 20472