The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).

(0) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Rewrite Strategy: INNERMOST

(1) DependencyGraphProof (BOTH BOUNDS(ID, ID) transformation)

The following rules are not reachable from basic terms in the dependency graph and can be removed:
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))

(2) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

++(x, ++(y, z)) → ++(++(x, y), z)
++(.(x, y), z) → .(x, ++(y, z))
rev(nil) → nil
++(nil, y) → y
++(x, nil) → x
make(x) → .(x, nil)

Rewrite Strategy: INNERMOST

(3) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)

The TRS does not nest defined symbols.
Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
++(x, ++(y, z)) → ++(++(x, y), z)

(4) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

++(.(x, y), z) → .(x, ++(y, z))
rev(nil) → nil
++(nil, y) → y
++(x, nil) → x
make(x) → .(x, nil)

Rewrite Strategy: INNERMOST

(5) TrsToWeightedTrsProof (BOTH BOUNDS(ID, ID) transformation)

Transformed TRS to weighted TRS

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

++(.(x, y), z) → .(x, ++(y, z)) [1]
rev(nil) → nil [1]
++(nil, y) → y [1]
++(x, nil) → x [1]
make(x) → .(x, nil) [1]

Rewrite Strategy: INNERMOST

(7) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(8) Obligation:

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

++(.(x, y), z) → .(x, ++(y, z)) [1]
rev(nil) → nil [1]
++(nil, y) → y [1]
++(x, nil) → x [1]
make(x) → .(x, nil) [1]

The TRS has the following type information:

++ :: .:nil → .:nil → .:nil . :: a → .:nil → .:nil rev :: .:nil → .:nil nil :: .:nil make :: a → .:nil

Rewrite Strategy: INNERMOST

(9) CompletionProof (UPPER BOUND(ID) transformation)

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:

++
rev
make

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:

const

(10) 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: ++(.(x, y), z) → .(x, ++(y, z)) [1] rev(nil) → nil [1] ++(nil, y) → y [1] ++(x, nil) → x [1] make(x) → .(x, nil) [1] The TRS has the following type information: ++ :: .:nil → .:nil → .:nil . :: a → .:nil → .:nil rev :: .:nil → .:nil nil :: .:nil make :: a → .:nil const :: a Rewrite Strategy: INNERMOST

(11) NarrowingProof (BOTH BOUNDS(ID, ID) transformation)

Narrowed the inner basic terms of all right-hand sides by a single narrowing step.

(12) 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: ++(.(x, y), z) → .(x, ++(y, z)) [1] rev(nil) → nil [1] ++(nil, y) → y [1] ++(x, nil) → x [1] make(x) → .(x, nil) [1] The TRS has the following type information: ++ :: .:nil → .:nil → .:nil . :: a → .:nil → .:nil rev :: .:nil → .:nil nil :: .:nil make :: a → .:nil const :: a Rewrite Strategy: INNERMOST

(13) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID) transformation)

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

nil => 0
const => 0

(14) Obligation:

Complexity RNTS consisting of the following rules:

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

(15) SimplificationProof (BOTH BOUNDS(ID, ID) transformation)

Simplified the RNTS by moving equalities from the constraints into the right-hand sides.

(16) Obligation:

Complexity RNTS consisting of the following rules:

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

(17) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID) transformation)

Found the following analysis order by SCC decomposition:

{ rev } { make } { ++ }

(18) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {rev}, {make}, {++}

(19) IntTrsBoundProof (UPPER BOUND(ID) transformation)

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

(20) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {rev}, {make}, {++}
Previous analysis results are:

rev: runtime: ?, size: O(1) [0]

(21) IntTrsBoundProof (UPPER BOUND(ID) transformation)

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

(22) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {make}, {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0]

(23) ResultPropagationProof (UPPER BOUND(ID) transformation)

Applied inner abstraction using the recently inferred runtime/size bounds where possible.

(24) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {make}, {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0]

(25) IntTrsBoundProof (UPPER BOUND(ID) transformation)

Computed SIZE bound using CoFloCo for: make
after applying outer abstraction to obtain an ITS,
resulting in: O(n¹) with polynomial bound: 1 + z'

(26) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {make}, {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0] make: runtime: ?, size: O(n1) [1 + z']

(27) IntTrsBoundProof (UPPER BOUND(ID) transformation)

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

(28) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0] make: runtime: O(1) [1], size: O(n1) [1 + z']

(29) ResultPropagationProof (UPPER BOUND(ID) transformation)

Applied inner abstraction using the recently inferred runtime/size bounds where possible.

(30) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0] make: runtime: O(1) [1], size: O(n1) [1 + z']

(31) IntTrsBoundProof (UPPER BOUND(ID) transformation)

Computed SIZE bound using CoFloCo for: ++
after applying outer abstraction to obtain an ITS,
resulting in: O(n¹) with polynomial bound: z' + z''

(32) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed: {++}
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0] make: runtime: O(1) [1], size: O(n1) [1 + z'] ++: runtime: ?, size: O(n1) [z' + z'']

(33) IntTrsBoundProof (UPPER BOUND(ID) transformation)

Computed RUNTIME bound using CoFloCo for: ++
after applying outer abstraction to obtain an ITS,
resulting in: O(n¹) with polynomial bound: 1 + z'

(34) Obligation:

Complexity RNTS consisting of the following rules:

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

Function symbols to be analyzed:
Previous analysis results are:

rev: runtime: O(1) [1], size: O(1) [0] make: runtime: O(1) [1], size: O(n1) [1 + z'] ++: runtime: O(n1) [1 + z'], size: O(n1) [z' + z'']

(35) FinalProof (EQUIVALENT transformation)

Computed overall runtime complexity

(36) BOUNDS(1, n^1)