Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904048
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.460883856 seconds
cpu usage
473.991287798
max memory
6.319857664E9
stage attributes
key
value
output-size
62268
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) 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), 398 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 129 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 140 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 52 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 276 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 86 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 319 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 82 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 2282 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 2276 ms] (44) CpxRNTS (45) FinalProof [FINISHED, 0 ms] (46) BOUNDS(1, n^2) (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), 242 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), 64 ms] (60) 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: cond1(true, x) -> cond2(even(x), x) cond2(true, x) -> cond1(neq(x, 0), div2(x)) cond2(false, x) -> cond1(neq(x, 0), p(x)) neq(0, 0) -> false neq(0, s(x)) -> true neq(s(x), 0) -> true neq(s(x), s(y)) -> neq(x, y) even(0) -> true even(s(0)) -> false even(s(s(x))) -> even(x) div2(0) -> 0 div2(s(0)) -> 0 div2(s(s(x))) -> s(div2(x)) p(0) -> 0 p(s(x)) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807