details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	10.3504331112 seconds
cpu usage	26.966726037
max memory	1.8409472E9

stage attributes

key	value
output-size	71728
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 [EQUIVALENT, 0 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 201 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QCSDP (8) QCSUsableRulesProof [EQUIVALENT, 0 ms] (9) QCSDP (10) QCSDPMuMonotonicPoloProof [EQUIVALENT, 59 ms] (11) QCSDP (12) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (13) AND (14) QCSDP (15) QCSDPSubtermProof [EQUIVALENT, 0 ms] (16) QCSDP (17) PIsEmptyProof [EQUIVALENT, 0 ms] (18) YES (19) QCSDP (20) QCSDPSubtermProof [EQUIVALENT, 0 ms] (21) QCSDP (22) PIsEmptyProof [EQUIVALENT, 0 ms] (23) YES (24) QCSDP (25) QCSDPSubtermProof [EQUIVALENT, 0 ms] (26) QCSDP (27) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (28) TRUE (29) QCSDP (30) QCSDPSubtermProof [EQUIVALENT, 0 ms] (31) QCSDP (32) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (33) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(U101(tt, V2)) -> mark(U102(isLNat(V2))) active(U102(tt)) -> mark(tt) active(U11(tt, N, XS)) -> mark(U12(isLNat(XS), N, XS)) active(U111(tt)) -> mark(tt) active(U12(tt, N, XS)) -> mark(snd(splitAt(N, XS))) active(U121(tt)) -> mark(tt) active(U131(tt, V2)) -> mark(U132(isLNat(V2))) active(U132(tt)) -> mark(tt) active(U141(tt, V2)) -> mark(U142(isLNat(V2))) active(U142(tt)) -> mark(tt) active(U151(tt, V2)) -> mark(U152(isLNat(V2))) active(U152(tt)) -> mark(tt) active(U161(tt, N)) -> mark(cons(N, natsFrom(s(N)))) active(U171(tt, N, XS)) -> mark(U172(isLNat(XS), N, XS)) active(U172(tt, N, XS)) -> mark(head(afterNth(N, XS))) active(U181(tt, Y)) -> mark(U182(isLNat(Y), Y)) active(U182(tt, Y)) -> mark(Y) active(U191(tt, XS)) -> mark(pair(nil, XS)) active(U201(tt, N, X, XS)) -> mark(U202(isNatural(X), N, X, XS)) active(U202(tt, N, X, XS)) -> mark(U203(isLNat(XS), N, X, XS)) active(U203(tt, N, X, XS)) -> mark(U204(splitAt(N, XS), X)) active(U204(pair(YS, ZS), X)) -> mark(pair(cons(X, YS), ZS)) active(U21(tt, X, Y)) -> mark(U22(isLNat(Y), X)) active(U211(tt, XS)) -> mark(U212(isLNat(XS), XS)) active(U212(tt, XS)) -> mark(XS) active(U22(tt, X)) -> mark(X) active(U221(tt, N, XS)) -> mark(U222(isLNat(XS), N, XS)) active(U222(tt, N, XS)) -> mark(fst(splitAt(N, XS))) active(U31(tt, N, XS)) -> mark(U32(isLNat(XS), N)) active(U32(tt, N)) -> mark(N) active(U41(tt, V2)) -> mark(U42(isLNat(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isLNat(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(U91(tt)) -> mark(tt) active(afterNth(N, XS)) -> mark(U11(isNatural(N), N, XS)) active(fst(pair(X, Y))) -> mark(U21(isLNat(X), X, Y)) active(head(cons(N, XS))) -> mark(U31(isNatural(N), N, XS)) active(isLNat(nil)) -> mark(tt) active(isLNat(afterNth(V1, V2))) -> mark(U41(isNatural(V1), V2)) active(isLNat(cons(V1, V2))) -> mark(U51(isNatural(V1), V2)) popout

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

job log

popout

actions

all output return to TRS Standard