Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733326
details
property
value
status
complete
benchmark
LISTUTILITIES_nokinds-noand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.1431350708 seconds
cpu usage
6.004728136
max memory
4.7214592E8
stage attributes
key
value
output-size
43994
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 of the given CSR could be proven: (0) CSR (1) CSDependencyPairsProof [EQUIVALENT, 114 ms] (2) QCSDP (3) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QCSDP (6) QCSUsableRulesProof [EQUIVALENT, 0 ms] (7) QCSDP (8) QCSDPMuMonotonicPoloProof [EQUIVALENT, 68 ms] (9) QCSDP (10) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (11) AND (12) QCSDP (13) QCSDPSubtermProof [EQUIVALENT, 0 ms] (14) QCSDP (15) PIsEmptyProof [EQUIVALENT, 0 ms] (16) YES (17) QCSDP (18) QCSDPSubtermProof [EQUIVALENT, 0 ms] (19) QCSDP (20) PIsEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QCSDP (23) QCSDPSubtermProof [EQUIVALENT, 0 ms] (24) QCSDP (25) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (26) TRUE (27) QCSDP (28) QCSDPSubtermProof [EQUIVALENT, 0 ms] (29) QCSDP (30) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (31) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: U101(tt, V2) -> U102(isLNat(V2)) U102(tt) -> tt U11(tt, N, XS) -> U12(isLNat(XS), N, XS) U111(tt) -> tt U12(tt, N, XS) -> snd(splitAt(N, XS)) U121(tt) -> tt U131(tt, V2) -> U132(isLNat(V2)) U132(tt) -> tt U141(tt, V2) -> U142(isLNat(V2)) U142(tt) -> tt U151(tt, V2) -> U152(isLNat(V2)) U152(tt) -> tt U161(tt, N) -> cons(N, natsFrom(s(N))) U171(tt, N, XS) -> U172(isLNat(XS), N, XS) U172(tt, N, XS) -> head(afterNth(N, XS)) U181(tt, Y) -> U182(isLNat(Y), Y) U182(tt, Y) -> Y U191(tt, XS) -> pair(nil, XS) U201(tt, N, X, XS) -> U202(isNatural(X), N, X, XS) U202(tt, N, X, XS) -> U203(isLNat(XS), N, X, XS) U203(tt, N, X, XS) -> U204(splitAt(N, XS), X) U204(pair(YS, ZS), X) -> pair(cons(X, YS), ZS) U21(tt, X, Y) -> U22(isLNat(Y), X) U211(tt, XS) -> U212(isLNat(XS), XS) U212(tt, XS) -> XS U22(tt, X) -> X U221(tt, N, XS) -> U222(isLNat(XS), N, XS) U222(tt, N, XS) -> fst(splitAt(N, XS)) U31(tt, N, XS) -> U32(isLNat(XS), N) U32(tt, N) -> N U41(tt, V2) -> U42(isLNat(V2)) U42(tt) -> tt U51(tt, V2) -> U52(isLNat(V2)) U52(tt) -> tt U61(tt) -> tt U71(tt) -> tt U81(tt) -> tt U91(tt) -> tt afterNth(N, XS) -> U11(isNatural(N), N, XS) fst(pair(X, Y)) -> U21(isLNat(X), X, Y) head(cons(N, XS)) -> U31(isNatural(N), N, XS) isLNat(nil) -> tt isLNat(afterNth(V1, V2)) -> U41(isNatural(V1), V2) isLNat(cons(V1, V2)) -> U51(isNatural(V1), V2) isLNat(fst(V1)) -> U61(isPLNat(V1)) isLNat(natsFrom(V1)) -> U71(isNatural(V1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651