Runtime Complexity: TRS pair #487109878

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	6.62897 seconds
cpu usage	20.3208
user time	18.8024
system time	1.51835
max virtual memory	1.90785E7
max residence set size	3875140.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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).

(0) CpxTRS
(1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms]
(2) CpxTRS
    (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
    (4) CpxTRS
    (5) CpxTrsMatchBoundsTAProof [FINISHED, 66 ms]
    (6) BOUNDS(1, n^1)
(7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(8) TRS for Loop Detection
    (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (10) BEST
        (11) proven lower bound
            (12) LowerBoundPropagationProof [FINISHED, 0 ms]
            (13) BOUNDS(n^1, INF)
        (14) TRS for Loop Detection


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

(0)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).


The TRS R consists of the following rules:

   active(f(0)) -> mark(cons(0, f(s(0))))
   active(f(s(0))) -> mark(f(p(s(0))))
   active(p(s(X))) -> mark(X)
   active(f(X)) -> f(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   active(p(X)) -> p(active(X))
   f(mark(X)) -> mark(f(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   p(mark(X)) -> mark(p(X))
   proper(f(X)) -> f(proper(X))
   proper(0) -> ok(0)
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(p(X)) -> p(proper(X))
   f(ok(X)) -> ok(f(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   p(ok(X)) -> ok(p(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

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

(1) NestedDefinedSymbolProof (UPPER BOUND(ID))
The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(f(0)) -> mark(cons(0, f(s(0))))
active(f(s(0))) -> mark(f(p(s(0))))
active(p(s(X))) -> mark(X)
active(f(X)) -> f(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(p(X)) -> p(active(X))
proper(f(X)) -> f(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(p(X)) -> p(proper(X))

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

(2)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

   f(mark(X)) -> mark(f(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   p(mark(X)) -> mark(p(X))
   proper(0) -> ok(0)
   f(ok(X)) -> ok(f(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   p(ok(X)) -> ok(p(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

S is empty.

popout

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

job log

popout

actions all output return to Runtime Complexity: TRS