MAYBE
proof of input_tfd16l9hdQ.trs
# AProVE Commit ID: aff8ecad908e01718a4c36e68d2e55d5e0f16e15 fuhs 20220216 unpublished


The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).

(0) CpxTRS
(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxTRS
(3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(4) CpxTRS
(5) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(6) CdtProblem
    (7) CdtToCpxRelTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (8) CpxRelTRS
    (9) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
    (10) TRS for Loop Detection
    (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (12) CpxRelTRS
        (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (14) typed CpxTrs
        (15) OrderProof [LOWER BOUND(ID), 0 ms]
        (16) typed CpxTrs
(17) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(18) CdtProblem
    (19) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CdtProblem
    (21) CdtToCpxRelTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (22) CpxTRS
    (23) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
    (24) CpxTRS
    (25) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (26) CpxWeightedTrs
        (27) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (28) CpxTypedWeightedTrs
        (29) CompletionProof [UPPER BOUND(ID), 0 ms]
        (30) CpxTypedWeightedCompleteTrs
            (31) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (32) CpxTypedWeightedCompleteTrs
            (33) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (34) CpxRNTS
            (35) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
            (36) CpxRNTS
            (37) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
            (38) CpxRNTS
            (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (40) CpxRNTS
            (41) IntTrsBoundProof [UPPER BOUND(ID), 1776 ms]
            (42) CpxRNTS
            (43) IntTrsBoundProof [UPPER BOUND(ID), 146 ms]
            (44) CpxRNTS
        (45) CompletionProof [UPPER BOUND(ID), 0 ms]
        (46) CpxTypedWeightedCompleteTrs
            (47) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (48) CpxRNTS
(49) RelTrsToWeightedTrsProof [UPPER BOUND(ID), 0 ms]
(50) CpxWeightedTrs
    (51) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (52) CpxTypedWeightedTrs
    (53) CompletionProof [UPPER BOUND(ID), 0 ms]
    (54) CpxTypedWeightedCompleteTrs
        (55) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (56) CpxTypedWeightedCompleteTrs
        (57) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (58) CpxRNTS
        (59) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (60) CpxRNTS
        (61) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
        (62) CpxRNTS
        (63) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (64) CpxRNTS
        (65) IntTrsBoundProof [UPPER BOUND(ID), 1560 ms]
        (66) CpxRNTS
        (67) IntTrsBoundProof [UPPER BOUND(ID), 169 ms]
        (68) CpxRNTS
    (69) CompletionProof [UPPER BOUND(ID), 0 ms]
    (70) CpxTypedWeightedCompleteTrs
        (71) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (72) CpxRNTS


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

(0)
Obligation:
The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   f(x, y) -> f(x, x)
   f(s(x), y) -> f(y, x)

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

(1) RenamingProof (BOTH BOUNDS(ID, ID))
Renamed function symbols to avoid clashes with predefined symbol.
----------------------------------------

(2)
Obligation:
The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   f(x, y) -> f(x, x)
   f(s(x), y) -> f(y, x)

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

(3) RelTrsToTrsProof (UPPER BOUND(ID))
transformed relative TRS to TRS
----------------------------------------

(4)
Obligation:
The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   f(x, y) -> f(x, x)
   f(s(x), y) -> f(y, x)

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

(5) CpxTrsToCdtProof (UPPER BOUND(ID))
Converted Cpx (relative) TRS with rewrite strategy PARALLEL_INNERMOST to CDT
----------------------------------------

(6)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)
Tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
S tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
K tuples:none
Defined Rule Symbols:   f_2

Defined Pair Symbols:   F_2

Compound Symbols:   c_1, c1_1


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

(7) CdtToCpxRelTrsProof (BOTH BOUNDS(ID, ID))
Converted S to standard rules, and D \ S as well as R to relative rules.
----------------------------------------

(8)
Obligation:
The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))

The (relative) TRS S consists of the following rules:

   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)

Rewrite Strategy: INNERMOST
----------------------------------------

(9) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
Transformed a relative TRS into a decreasing-loop problem.
----------------------------------------

(10)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))

The (relative) TRS S consists of the following rules:

   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)

Rewrite Strategy: INNERMOST
----------------------------------------

(11) RenamingProof (BOTH BOUNDS(ID, ID))
Renamed function symbols to avoid clashes with predefined symbol.
----------------------------------------

(12)
Obligation:
The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))

The (relative) TRS S consists of the following rules:

   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)

Rewrite Strategy: INNERMOST
----------------------------------------

(13) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Inferred types.
----------------------------------------

(14)
Obligation:
Innermost TRS:
Rules:
F(z0, z1) -> c(F(z0, z0))
F(s(z0), z1) -> c1(F(z1, z0))
f(z0, z1) -> f(z0, z0)
f(s(z0), z1) -> f(z1, z0)

Types:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1
f :: s -> s -> f
hole_c:c11_2 :: c:c1
hole_s2_2 :: s
hole_f3_2 :: f
gen_c:c14_2 :: Nat -> c:c1
gen_s5_2 :: Nat -> s

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

(15) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
F, f
----------------------------------------

(16)
Obligation:
Innermost TRS:
Rules:
F(z0, z1) -> c(F(z0, z0))
F(s(z0), z1) -> c1(F(z1, z0))
f(z0, z1) -> f(z0, z0)
f(s(z0), z1) -> f(z1, z0)

Types:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1
f :: s -> s -> f
hole_c:c11_2 :: c:c1
hole_s2_2 :: s
hole_f3_2 :: f
gen_c:c14_2 :: Nat -> c:c1
gen_s5_2 :: Nat -> s


Generator Equations:
gen_c:c14_2(0) <=> hole_c:c11_2
gen_c:c14_2(+(x, 1)) <=> c(gen_c:c14_2(x))
gen_s5_2(0) <=> hole_s2_2
gen_s5_2(+(x, 1)) <=> s(gen_s5_2(x))


The following defined symbols remain to be analysed:
F, f
----------------------------------------

(17) CpxTrsToCdtProof (UPPER BOUND(ID))
Converted Cpx (relative) TRS with rewrite strategy PARALLEL_INNERMOST to CDT
----------------------------------------

(18)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)
Tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
S tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
K tuples:none
Defined Rule Symbols:   f_2

Defined Pair Symbols:   F_2

Compound Symbols:   c_1, c1_1


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

(19) CdtUsableRulesProof (BOTH BOUNDS(ID, ID))
The following rules are not usable and were removed:
   f(z0, z1) -> f(z0, z0)
   f(s(z0), z1) -> f(z1, z0)

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

(20)
Obligation:
Complexity Dependency Tuples Problem

Rules:none
Tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
S tuples:
   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:   F_2

Compound Symbols:   c_1, c1_1


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

(21) CdtToCpxRelTrsProof (BOTH BOUNDS(ID, ID))
Converted S to standard rules, and D \ S as well as R to relative rules.
----------------------------------------

(22)
Obligation:
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))

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

(23) RelTrsToTrsProof (UPPER BOUND(ID))
transformed relative TRS to TRS
----------------------------------------

(24)
Obligation:
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0))
   F(s(z0), z1) -> c1(F(z1, z0))

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

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

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


The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0)) [1]
   F(s(z0), z1) -> c1(F(z1, z0)) [1]

Rewrite Strategy: INNERMOST
----------------------------------------

(27) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Infered types.
----------------------------------------

(28)
Obligation:
Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0)) [1]
   F(s(z0), z1) -> c1(F(z1, z0)) [1]

The TRS has the following type information:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1

Rewrite Strategy: INNERMOST
----------------------------------------

(29) CompletionProof (UPPER BOUND(ID))
The transformation into a RNTS is sound, since:

(a) The obligation is a constructor system where every type has a constant constructor,

(b) The following defined symbols do not have to be completely defined, as they can never occur inside other defined symbols:

   F_2

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:    const, const1

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

(30)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0)) [1]
   F(s(z0), z1) -> c1(F(z1, z0)) [1]

The TRS has the following type information:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1
const :: c:c1
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(31) NarrowingProof (BOTH BOUNDS(ID, ID))
Narrowed the inner basic terms of all right-hand sides by a single narrowing step.
----------------------------------------

(32)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0)) [1]
   F(s(z0), z1) -> c1(F(z1, z0)) [1]

The TRS has the following type information:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1
const :: c:c1
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(33) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   const => 0
   const1 => 0

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

(34)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z0, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   F(z, z') -{ 1 }-> 1 + F(z1, z0) :|: z1 >= 0, z = 1 + z0, z' = z1, z0 >= 0


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

(35) SimplificationProof (BOTH BOUNDS(ID, ID))
Simplified the RNTS by moving equalities from the constraints into the right-hand sides.
----------------------------------------

(36)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z, z) :|: z' >= 0, z >= 0
   F(z, z') -{ 1 }-> 1 + F(z', z - 1) :|: z' >= 0, z - 1 >= 0


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

(37) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID))
Found the following analysis order by SCC decomposition:

   { F }

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

(38)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z, z) :|: z' >= 0, z >= 0
   F(z, z') -{ 1 }-> 1 + F(z', z - 1) :|: z' >= 0, z - 1 >= 0

Function symbols to be analyzed: {F}

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

(39) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(40)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z, z) :|: z' >= 0, z >= 0
   F(z, z') -{ 1 }-> 1 + F(z', z - 1) :|: z' >= 0, z - 1 >= 0

Function symbols to be analyzed: {F}

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

(41) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: F
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

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

(42)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z, z) :|: z' >= 0, z >= 0
   F(z, z') -{ 1 }-> 1 + F(z', z - 1) :|: z' >= 0, z - 1 >= 0

Function symbols to be analyzed: {F}
Previous analysis results are:
  F: runtime: ?, size: O(1) [0]

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

(43) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: F
after applying outer abstraction to obtain an ITS,
resulting in: INF with polynomial bound: ?

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

(44)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z, z) :|: z' >= 0, z >= 0
   F(z, z') -{ 1 }-> 1 + F(z', z - 1) :|: z' >= 0, z - 1 >= 0

Function symbols to be analyzed: {F}
Previous analysis results are:
  F: runtime: INF, size: O(1) [0]

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

(45) CompletionProof (UPPER BOUND(ID))
The TRS is a completely defined constructor system, as every type has a constant constructor and the following rules were added:
none

And the following fresh constants:    const, const1

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

(46)
Obligation:
Runtime Complexity Weighted TRS where all functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   F(z0, z1) -> c(F(z0, z0)) [1]
   F(s(z0), z1) -> c1(F(z1, z0)) [1]

The TRS has the following type information:
F :: s -> s -> c:c1
c :: c:c1 -> c:c1
s :: s -> s
c1 :: c:c1 -> c:c1
const :: c:c1
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(47) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   const => 0
   const1 => 0

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

(48)
Obligation:
Complexity RNTS consisting of the following rules:

   F(z, z') -{ 1 }-> 1 + F(z0, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   F(z, z') -{ 1 }-> 1 + F(z1, z0) :|: z1 >= 0, z = 1 + z0, z' = z1, z0 >= 0

Only complete derivations are relevant for the runtime complexity.

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

(49) RelTrsToWeightedTrsProof (UPPER BOUND(ID))
Transformed relative TRS to weighted TRS
----------------------------------------

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


The TRS R consists of the following rules:

   f(x, y) -> f(x, x) [1]
   f(s(x), y) -> f(y, x) [1]

Rewrite Strategy: INNERMOST
----------------------------------------

(51) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Infered types.
----------------------------------------

(52)
Obligation:
Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f(x, y) -> f(x, x) [1]
   f(s(x), y) -> f(y, x) [1]

The TRS has the following type information:
f :: s -> s -> f
s :: s -> s

Rewrite Strategy: INNERMOST
----------------------------------------

(53) CompletionProof (UPPER BOUND(ID))
The transformation into a RNTS is sound, since:

(a) The obligation is a constructor system where every type has a constant constructor,

(b) The following defined symbols do not have to be completely defined, as they can never occur inside other defined symbols:

   f_2

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:    const, const1

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

(54)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f(x, y) -> f(x, x) [1]
   f(s(x), y) -> f(y, x) [1]

The TRS has the following type information:
f :: s -> s -> f
s :: s -> s
const :: f
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(55) NarrowingProof (BOTH BOUNDS(ID, ID))
Narrowed the inner basic terms of all right-hand sides by a single narrowing step.
----------------------------------------

(56)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f(x, y) -> f(x, x) [1]
   f(s(x), y) -> f(y, x) [1]

The TRS has the following type information:
f :: s -> s -> f
s :: s -> s
const :: f
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(57) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   const => 0
   const1 => 0

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

(58)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(x, x) :|: x >= 0, y >= 0, z = x, z' = y
   f(z, z') -{ 1 }-> f(y, x) :|: x >= 0, y >= 0, z = 1 + x, z' = y


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

(59) SimplificationProof (BOTH BOUNDS(ID, ID))
Simplified the RNTS by moving equalities from the constraints into the right-hand sides.
----------------------------------------

(60)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(z, z) :|: z >= 0, z' >= 0
   f(z, z') -{ 1 }-> f(z', z - 1) :|: z - 1 >= 0, z' >= 0


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

(61) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID))
Found the following analysis order by SCC decomposition:

   { f }

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

(62)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(z, z) :|: z >= 0, z' >= 0
   f(z, z') -{ 1 }-> f(z', z - 1) :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f}

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

(63) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(64)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(z, z) :|: z >= 0, z' >= 0
   f(z, z') -{ 1 }-> f(z', z - 1) :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f}

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

(65) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

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

(66)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(z, z) :|: z >= 0, z' >= 0
   f(z, z') -{ 1 }-> f(z', z - 1) :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f}
Previous analysis results are:
  f: runtime: ?, size: O(1) [0]

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

(67) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: f
after applying outer abstraction to obtain an ITS,
resulting in: INF with polynomial bound: ?

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

(68)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(z, z) :|: z >= 0, z' >= 0
   f(z, z') -{ 1 }-> f(z', z - 1) :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f}
Previous analysis results are:
  f: runtime: INF, size: O(1) [0]

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

(69) CompletionProof (UPPER BOUND(ID))
The TRS is a completely defined constructor system, as every type has a constant constructor and the following rules were added:
none

And the following fresh constants:    const, const1

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

(70)
Obligation:
Runtime Complexity Weighted TRS where all functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f(x, y) -> f(x, x) [1]
   f(s(x), y) -> f(y, x) [1]

The TRS has the following type information:
f :: s -> s -> f
s :: s -> s
const :: f
const1 :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(71) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   const => 0
   const1 => 0

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

(72)
Obligation:
Complexity RNTS consisting of the following rules:

   f(z, z') -{ 1 }-> f(x, x) :|: x >= 0, y >= 0, z = x, z' = y
   f(z, z') -{ 1 }-> f(y, x) :|: x >= 0, y >= 0, z = 1 + x, z' = y

Only complete derivations are relevant for the runtime complexity.