Runtime Complexity: TRS Innermost pair #487112690

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.36824 seconds
cpu usage	11.3796
user time	10.4981
system time	0.881519
max virtual memory	1.8676872E7
max residence set size	3169344.0

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^1))
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^1).

(0) CpxTRS
(1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(2) CdtProblem
    (3) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (4) CdtProblem
    (5) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
    (6) CdtProblem
    (7) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 8 ms]
    (8) CdtProblem
    (9) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms]
    (10) BOUNDS(1, 1)
(11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(12) CpxTRS
    (13) SlicingProof [LOWER BOUND(ID), 0 ms]
    (14) CpxTRS
    (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (16) typed CpxTrs
    (17) OrderProof [LOWER BOUND(ID), 0 ms]
    (18) typed CpxTrs
    (19) RewriteLemmaProof [LOWER BOUND(ID), 265 ms]
    (20) proven lower bound
    (21) LowerBoundPropagationProof [FINISHED, 0 ms]
    (22) BOUNDS(n^1, INF)


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

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

   duplicate(Cons(x, xs)) -> Cons(x, Cons(x, duplicate(xs)))
   duplicate(Nil) -> Nil
   goal(x) -> duplicate(x)

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

(1) CpxTrsToCdtProof (UPPER BOUND(ID))
Converted Cpx (relative) TRS to CDT
----------------------------------------

(2)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   duplicate(Cons(z0, z1)) -> Cons(z0, Cons(z0, duplicate(z1)))
   duplicate(Nil) -> Nil
   goal(z0) -> duplicate(z0)
Tuples:
   DUPLICATE(Cons(z0, z1)) -> c(DUPLICATE(z1))
   DUPLICATE(Nil) -> c1
   GOAL(z0) -> c2(DUPLICATE(z0))
S tuples:
   DUPLICATE(Cons(z0, z1)) -> c(DUPLICATE(z1))
   DUPLICATE(Nil) -> c1
   GOAL(z0) -> c2(DUPLICATE(z0))
K tuples:none
Defined Rule Symbols:   duplicate_1, goal_1

Defined Pair Symbols:   DUPLICATE_1, GOAL_1

Compound Symbols:   c_1, c1, c2_1


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

(3) CdtLeafRemovalProof (ComplexityIfPolyImplication)
Removed 1 leading nodes:
   GOAL(z0) -> c2(DUPLICATE(z0))
Removed 1 trailing nodes:
   DUPLICATE(Nil) -> c1

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

(4)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   duplicate(Cons(z0, z1)) -> Cons(z0, Cons(z0, duplicate(z1)))
   duplicate(Nil) -> Nil
   goal(z0) -> duplicate(z0)
Tuples:
   DUPLICATE(Cons(z0, z1)) -> c(DUPLICATE(z1))
S tuples:
   DUPLICATE(Cons(z0, z1)) -> c(DUPLICATE(z1))
K tuples:none

popout

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

job log

popout

actions all output return to Runtime Complexity: TRS Innermost