Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904122
details
property
value
status
complete
benchmark
#4.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.301734209 seconds
cpu usage
1118.36601015
max memory
8.901709824E9
stage attributes
key
value
output-size
88083
starexec-result
WORST_CASE(Omega(n^2), O(n^3))
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^2), O(n^3)) 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^2, n^3). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (10) CpxRNTS (11) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxRNTS (13) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) IntTrsBoundProof [UPPER BOUND(ID), 234 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 169 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 384 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 166 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 960 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 447 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 1896 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 554 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 806 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 166 ms] (44) CpxRNTS (45) FinalProof [FINISHED, 0 ms] (46) BOUNDS(1, n^3) (47) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (48) CpxTRS (49) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (50) typed CpxTrs (51) OrderProof [LOWER BOUND(ID), 0 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 313 ms] (54) BEST (55) proven lower bound (56) LowerBoundPropagationProof [FINISHED, 0 ms] (57) BOUNDS(n^1, INF) (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 24 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 20 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 1127 ms] (64) proven lower bound (65) LowerBoundPropagationProof [FINISHED, 0 ms] (66) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(m)) -> false eq(s(n), 0) -> false eq(s(n), s(m)) -> eq(n, m) le(0, m) -> true le(s(n), 0) -> false le(s(n), s(m)) -> le(n, m) min(cons(0, nil)) -> 0 min(cons(s(n), nil)) -> s(n)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807