MAYBE
proof of input_AsDuibXO8q.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) CpxTrsToCdtProof [BOTH BOUNDS(ID, ID), 0 ms]
(4) CdtProblem
    (5) CdtToCpxRelTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (6) CpxRelTRS
    (7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (8) CpxRelTRS
        (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (10) typed CpxTrs
        (11) OrderProof [LOWER BOUND(ID), 7 ms]
        (12) typed CpxTrs
    (13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
    (14) TRS for Loop Detection
(15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(16) 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) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
                (32) CpxRNTS
            (33) CompletionProof [UPPER BOUND(ID), 0 ms]
            (34) CpxTypedWeightedCompleteTrs
                (35) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
                (36) CpxTypedWeightedCompleteTrs
                (37) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
                (38) CpxRNTS
                (39) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
                (40) CpxRNTS
                (41) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
                (42) CpxRNTS
                (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
                (44) CpxRNTS
                (45) IntTrsBoundProof [UPPER BOUND(ID), 220 ms]
                (46) CpxRNTS
                (47) IntTrsBoundProof [UPPER BOUND(ID), 53 ms]
                (48) CpxRNTS
    (49) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (50) CdtProblem
(51) RelTrsToWeightedTrsProof [UPPER BOUND(ID), 0 ms]
(52) CpxWeightedTrs
    (53) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (54) CpxTypedWeightedTrs
    (55) CompletionProof [UPPER BOUND(ID), 0 ms]
    (56) CpxTypedWeightedCompleteTrs
        (57) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (58) CpxTypedWeightedCompleteTrs
        (59) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (60) CpxRNTS
        (61) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (62) CpxRNTS
        (63) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
        (64) CpxRNTS
        (65) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (66) CpxRNTS
        (67) IntTrsBoundProof [UPPER BOUND(ID), 144 ms]
        (68) CpxRNTS
        (69) IntTrsBoundProof [UPPER BOUND(ID), 88 ms]
        (70) CpxRNTS
    (71) CompletionProof [UPPER BOUND(ID), 0 ms]
    (72) CpxTypedWeightedCompleteTrs
        (73) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (74) 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) -> f(a)

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) -> f(a)

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

(3) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))
Converted Cpx (relative) TRS with rewrite strategy PARALLEL_INNERMOST to CDT
----------------------------------------

(4)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   f(z0) -> f(a)
Tuples:
   F(z0) -> c(F(a))
S tuples:
   F(z0) -> c(F(a))
K tuples:none
Defined Rule Symbols:   f_1

Defined Pair Symbols:   F_1

Compound Symbols:   c_1


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

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

(6)
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) -> c(F(a))

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

   f(z0) -> f(a)

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

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

(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) -> c(F(a))

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

   f(z0) -> f(a)

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

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

(10)
Obligation:
Innermost TRS:
Rules:
F(z0) -> c(F(a))
f(z0) -> f(a)

Types:
F :: a -> c
c :: c -> c
a :: a
f :: a -> f
hole_c1_1 :: c
hole_a2_1 :: a
hole_f3_1 :: f
gen_c4_1 :: Nat -> c

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

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

(12)
Obligation:
Innermost TRS:
Rules:
F(z0) -> c(F(a))
f(z0) -> f(a)

Types:
F :: a -> c
c :: c -> c
a :: a
f :: a -> f
hole_c1_1 :: c
hole_a2_1 :: a
hole_f3_1 :: f
gen_c4_1 :: Nat -> c


Generator Equations:
gen_c4_1(0) <=> hole_c1_1
gen_c4_1(+(x, 1)) <=> c(gen_c4_1(x))


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

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

(14)
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) -> c(F(a))

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

   f(z0) -> f(a)

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

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

(16)
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) -> f(a)

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

(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) -> f(a)
Tuples:
   F(z0) -> c(F(a))
S tuples:
   F(z0) -> c(F(a))
K tuples:none
Defined Rule Symbols:   f_1

Defined Pair Symbols:   F_1

Compound Symbols:   c_1


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

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

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

(20)
Obligation:
Complexity Dependency Tuples Problem

Rules:none
Tuples:
   F(z0) -> c(F(a))
S tuples:
   F(z0) -> c(F(a))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:   F_1

Compound Symbols:   c_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) -> c(F(a))

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) -> c(F(a))

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) -> c(F(a)) [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) -> c(F(a)) [1]

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

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

(29) 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

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

(30)
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) -> c(F(a)) [1]

The TRS has the following type information:
F :: a -> c
c :: c -> c
a :: a
const :: c

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

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

   a => 0
   const => 0

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

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

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

Only complete derivations are relevant for the runtime complexity.

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

(33) 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_1

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:    const

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

(34)
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) -> c(F(a)) [1]

The TRS has the following type information:
F :: a -> c
c :: c -> c
a :: a
const :: c

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

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

(36)
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) -> c(F(a)) [1]

The TRS has the following type information:
F :: a -> c
c :: c -> c
a :: a
const :: c

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

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

   a => 0
   const => 0

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

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

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


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

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

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

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


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

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

   { F }

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

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

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

Function symbols to be analyzed: {F}

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

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

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

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

Function symbols to be analyzed: {F}

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

(45) 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

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

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

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

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

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

(47) 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: ?

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

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

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

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

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

(49) CdtInstantiationProof (BOTH BOUNDS(ID, ID))
Use instantiation to replace F(z0) -> c(F(a)) by 
   F(a) -> c(F(a))

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

(50)
Obligation:
Complexity Dependency Tuples Problem

Rules:none
Tuples:
   F(a) -> c(F(a))
S tuples:
   F(a) -> c(F(a))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:   F_1

Compound Symbols:   c_1


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

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

(52)
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) -> f(a) [1]

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

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

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

   f(x) -> f(a) [1]

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

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

(55) 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_1

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:    const

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

(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) -> f(a) [1]

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

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

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

(58)
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) -> f(a) [1]

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

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

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

   a => 0
   const => 0

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

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

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


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

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

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

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


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

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

   { f }

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

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

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

Function symbols to be analyzed: {f}

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

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

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

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

Function symbols to be analyzed: {f}

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

(67) 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

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

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

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

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

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

(69) 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: ?

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

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

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

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

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

(71) 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

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

(72)
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) -> f(a) [1]

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

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

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

   a => 0
   const => 0

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

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

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

Only complete derivations are relevant for the runtime complexity.