Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904105
details
property
value
status
complete
benchmark
thiemann01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.533257961 seconds
cpu usage
987.277521817
max memory
9.557946368E9
stage attributes
key
value
output-size
57096
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
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^2)) proof of /export/starexec/sandbox2/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^2). (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) InliningProof [UPPER BOUND(ID), 35 ms] (12) CpxRNTS (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 375 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 119 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 120 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 53 ms] (28) CpxRNTS (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 304 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 73 ms] (34) CpxRNTS (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 89 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 32 ms] (40) CpxRNTS (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 1946 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 951 ms] (46) CpxRNTS (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 109 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (52) CpxRNTS (53) FinalProof [FINISHED, 0 ms] (54) BOUNDS(1, n^2) (55) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (56) CpxTRS (57) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (58) typed CpxTrs (59) OrderProof [LOWER BOUND(ID), 0 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 275 ms] (62) BEST (63) proven lower bound (64) LowerBoundPropagationProof [FINISHED, 0 ms] (65) BOUNDS(n^1, INF) (66) typed CpxTrs (67) RewriteLemmaProof [LOWER BOUND(ID), 59 ms] (68) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: minus(0, y) -> 0 minus(x, 0) -> x minus(s(x), s(y)) -> minus(x, y) plus(0, y) -> y plus(s(x), y) -> plus(x, s(y)) zero(s(x)) -> false zero(0) -> true
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807