Runtime Complexity: TRS Innermost pair #487112134

details

property	value
status	complete
benchmark	division.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n144.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.548 seconds
cpu usage	1010.1
user time	1001.35
system time	8.75434
max virtual memory	3.777718E7
max residence set size	6685996.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^2))

output

WORST_CASE(Omega(n^1), O(n^2))
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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), 375 ms]
    (18) CpxRNTS
    (19) IntTrsBoundProof [UPPER BOUND(ID), 79 ms]
    (20) CpxRNTS
    (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (22) CpxRNTS
    (23) IntTrsBoundProof [UPPER BOUND(ID), 361 ms]
    (24) CpxRNTS
    (25) IntTrsBoundProof [UPPER BOUND(ID), 83 ms]
    (26) CpxRNTS
    (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (28) CpxRNTS
    (29) IntTrsBoundProof [UPPER BOUND(ID), 239 ms]
    (30) CpxRNTS
    (31) IntTrsBoundProof [UPPER BOUND(ID), 75 ms]
    (32) CpxRNTS
    (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (34) CpxRNTS
    (35) IntTrsBoundProof [UPPER BOUND(ID), 1790 ms]
    (36) CpxRNTS
    (37) IntTrsBoundProof [UPPER BOUND(ID), 1463 ms]
    (38) CpxRNTS
    (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (40) CpxRNTS
    (41) IntTrsBoundProof [UPPER BOUND(ID), 67 ms]
    (42) CpxRNTS
    (43) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (44) CpxRNTS
    (45) FinalProof [FINISHED, 0 ms]
    (46) BOUNDS(1, n^2)
(47) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(48) TRS for Loop Detection
    (49) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (50) BEST
        (51) proven lower bound
            (52) LowerBoundPropagationProof [FINISHED, 0 ms]
            (53) BOUNDS(n^1, INF)
        (54) TRS for Loop Detection


----------------------------------------

(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:

   division(x, y) -> div(x, y, 0)
   div(x, y, z) -> if(lt(x, y), x, y, inc(z))
   if(true, x, y, z) -> z
   if(false, x, s(y), z) -> div(minus(x, s(y)), s(y), z)
   minus(x, 0) -> x
   minus(s(x), s(y)) -> minus(x, y)
   lt(x, 0) -> false
   lt(0, s(y)) -> true
   lt(s(x), s(y)) -> lt(x, y)
   inc(0) -> s(0)
   inc(s(x)) -> s(inc(x))

S is empty.
Rewrite Strategy: INNERMOST
----------------------------------------

(1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID))
Transformed relative TRS to weighted TRS
----------------------------------------

(2)
Obligation:
The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Runtime Complexity: TRS Innermost