Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903527
details
property
value
status
complete
benchmark
LISTUTILITIES_complete_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
17.3949859142 seconds
cpu usage
63.968512129
max memory
4.216602624E9
stage attributes
key
value
output-size
211357
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 30 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 118 ms] (4) CpxTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (6) CdtProblem (7) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 430 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 102 ms] (16) CdtProblem (17) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (18) BOUNDS(1, 1) (19) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (20) TRS for Loop Detection (21) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (22) BEST (23) proven lower bound (24) LowerBoundPropagationProof [FINISHED, 0 ms] (25) BOUNDS(n^1, INF) (26) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(U101(tt, V1, V2)) -> mark(U102(isNatural(V1), V2)) active(U102(tt, V2)) -> mark(U103(isLNat(V2))) active(U103(tt)) -> mark(tt) active(U11(tt, N, XS)) -> mark(snd(splitAt(N, XS))) active(U111(tt, V1)) -> mark(U112(isLNat(V1))) active(U112(tt)) -> mark(tt) active(U121(tt, V1)) -> mark(U122(isNatural(V1))) active(U122(tt)) -> mark(tt) active(U131(tt, V1, V2)) -> mark(U132(isNatural(V1), V2)) active(U132(tt, V2)) -> mark(U133(isLNat(V2))) active(U133(tt)) -> mark(tt) active(U141(tt, V1, V2)) -> mark(U142(isLNat(V1), V2)) active(U142(tt, V2)) -> mark(U143(isLNat(V2))) active(U143(tt)) -> mark(tt) active(U151(tt, V1, V2)) -> mark(U152(isNatural(V1), V2)) active(U152(tt, V2)) -> mark(U153(isLNat(V2))) active(U153(tt)) -> mark(tt) active(U161(tt, N)) -> mark(cons(N, natsFrom(s(N)))) active(U171(tt, N, XS)) -> mark(head(afterNth(N, XS))) active(U181(tt, Y)) -> mark(Y) active(U191(tt, XS)) -> mark(pair(nil, XS)) active(U201(tt, N, X, XS)) -> mark(U202(splitAt(N, XS), X)) active(U202(pair(YS, ZS), X)) -> mark(pair(cons(X, YS), ZS)) active(U21(tt, X)) -> mark(X) active(U211(tt, XS)) -> mark(XS) active(U221(tt, N, XS)) -> mark(fst(splitAt(N, XS))) active(U31(tt, N)) -> mark(N) active(U41(tt, V1, V2)) -> mark(U42(isNatural(V1), V2)) active(U42(tt, V2)) -> mark(U43(isLNat(V2))) active(U43(tt)) -> mark(tt) active(U51(tt, V1, V2)) -> mark(U52(isNatural(V1), V2)) active(U52(tt, V2)) -> mark(U53(isLNat(V2))) active(U53(tt)) -> mark(tt) active(U61(tt, V1)) -> mark(U62(isPLNat(V1))) active(U62(tt)) -> mark(tt) active(U71(tt, V1)) -> mark(U72(isNatural(V1))) active(U72(tt)) -> mark(tt) active(U81(tt, V1)) -> mark(U82(isPLNat(V1))) active(U82(tt)) -> mark(tt) active(U91(tt, V1)) -> mark(U92(isLNat(V1))) active(U92(tt)) -> mark(tt) active(afterNth(N, XS)) -> mark(U11(and(and(isNatural(N), isNaturalKind(N)), and(isLNat(XS), isLNatKind(XS))), N, XS)) active(and(tt, X)) -> mark(X) active(fst(pair(X, Y))) -> mark(U21(and(and(isLNat(X), isLNatKind(X)), and(isLNat(Y), isLNatKind(Y))), X)) active(head(cons(N, XS))) -> mark(U31(and(and(isNatural(N), isNaturalKind(N)), and(isLNat(XS), isLNatKind(XS))), N)) active(isLNat(nil)) -> mark(tt) active(isLNat(afterNth(V1, V2))) -> mark(U41(and(isNaturalKind(V1), isLNatKind(V2)), V1, V2)) active(isLNat(cons(V1, V2))) -> mark(U51(and(isNaturalKind(V1), isLNatKind(V2)), V1, V2)) active(isLNat(fst(V1))) -> mark(U61(isPLNatKind(V1), V1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127