Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905087
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts-noand_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.519721031 seconds
cpu usage
807.598557347
max memory
6.353043456E9
stage attributes
key
value
output-size
37295
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (2) CdtProblem (3) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (4) CdtProblem (5) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtKnowledgeProof [BOTH BOUNDS(ID, ID), 2 ms] (8) CdtProblem (9) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 113 ms] (12) CdtProblem (13) CdtKnowledgeProof [FINISHED, 0 ms] (14) BOUNDS(1, 1) (15) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (16) TRS for Loop Detection (17) DecreasingLoopProof [LOWER BOUND(ID), 17.8 s] (18) BEST (19) proven lower bound (20) LowerBoundPropagationProof [FINISHED, 0 ms] (21) BOUNDS(n^1, INF) (22) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: U11(tt, N, XS) -> U12(tt, activate(N), activate(XS)) U12(tt, N, XS) -> snd(splitAt(activate(N), activate(XS))) U21(tt, X) -> U22(tt, activate(X)) U22(tt, X) -> activate(X) U31(tt, N) -> U32(tt, activate(N)) U32(tt, N) -> activate(N) U41(tt, N, XS) -> U42(tt, activate(N), activate(XS)) U42(tt, N, XS) -> head(afterNth(activate(N), activate(XS))) U51(tt, Y) -> U52(tt, activate(Y)) U52(tt, Y) -> activate(Y) U61(tt, N, X, XS) -> U62(tt, activate(N), activate(X), activate(XS)) U62(tt, N, X, XS) -> U63(tt, activate(N), activate(X), activate(XS)) U63(tt, N, X, XS) -> U64(splitAt(activate(N), activate(XS)), activate(X)) U64(pair(YS, ZS), X) -> pair(cons(activate(X), YS), ZS) U71(tt, XS) -> U72(tt, activate(XS)) U72(tt, XS) -> activate(XS) U81(tt, N, XS) -> U82(tt, activate(N), activate(XS)) U82(tt, N, XS) -> fst(splitAt(activate(N), activate(XS))) afterNth(N, XS) -> U11(tt, N, XS) fst(pair(X, Y)) -> U21(tt, X) head(cons(N, XS)) -> U31(tt, N) natsFrom(N) -> cons(N, n__natsFrom(s(N))) sel(N, XS) -> U41(tt, N, XS) snd(pair(X, Y)) -> U51(tt, Y) splitAt(0, XS) -> pair(nil, XS) splitAt(s(N), cons(X, XS)) -> U61(tt, N, X, activate(XS)) tail(cons(N, XS)) -> U71(tt, activate(XS)) take(N, XS) -> U81(tt, N, XS) natsFrom(X) -> n__natsFrom(X) activate(n__natsFrom(X)) -> natsFrom(X) activate(X) -> X S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: U11(tt, z0, z1) -> U12(tt, activate(z0), activate(z1)) U12(tt, z0, z1) -> snd(splitAt(activate(z0), activate(z1))) U21(tt, z0) -> U22(tt, activate(z0)) U22(tt, z0) -> activate(z0) U31(tt, z0) -> U32(tt, activate(z0)) U32(tt, z0) -> activate(z0) U41(tt, z0, z1) -> U42(tt, activate(z0), activate(z1)) U42(tt, z0, z1) -> head(afterNth(activate(z0), activate(z1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807