Runti Compl Inner Rewri 22807 pair #381904810

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	10.4971039295 seconds
cpu usage	33.237519205
max memory	3.73131264E9

stage attributes

key	value
output-size	24317
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) 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), 1 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), 1190 ms]
    (18) CpxRNTS
    (19) IntTrsBoundProof [UPPER BOUND(ID), 601 ms]
    (20) CpxRNTS
    (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (22) CpxRNTS
    (23) IntTrsBoundProof [UPPER BOUND(ID), 130 ms]
    (24) CpxRNTS
    (25) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (26) CpxRNTS
    (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (28) CpxRNTS
    (29) IntTrsBoundProof [UPPER BOUND(ID), 291 ms]
    (30) CpxRNTS
    (31) IntTrsBoundProof [UPPER BOUND(ID), 155 ms]
    (32) CpxRNTS
    (33) FinalProof [FINISHED, 0 ms]
    (34) BOUNDS(1, n^1)
(35) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(36) TRS for Loop Detection
    (37) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (38) BEST
        (39) proven lower bound
            (40) LowerBoundPropagationProof [FINISHED, 0 ms]
            (41) BOUNDS(n^1, INF)
        (42) 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:

   cond1(true, x, y) -> cond2(gr(y, 0), x, y)
   cond2(true, x, y) -> cond2(gr(y, 0), x, p(y))
   cond2(false, x, y) -> cond1(gr(x, 0), p(x), y)
   gr(0, x) -> false
   gr(s(x), 0) -> true
   gr(s(x), s(y)) -> gr(x, y)
   p(0) -> 0
   p(s(x)) -> 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^1).


The TRS R consists of the following rules:

   cond1(true, x, y) -> cond2(gr(y, 0), x, y) [1]
   cond2(true, x, y) -> cond2(gr(y, 0), x, p(y)) [1]
   cond2(false, x, y) -> cond1(gr(x, 0), p(x), y) [1]
   gr(0, x) -> false [1]
   gr(s(x), 0) -> true [1]
   gr(s(x), s(y)) -> gr(x, y) [1]
   p(0) -> 0 [1]
   p(s(x)) -> x [1]

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807