Runtime Complexity: TRS pair #487110738

details

property	value
status	complete
benchmark	ternary-hard.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n137.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	294.368 seconds
cpu usage	1119.92
user time	1108.26
system time	11.6546
max virtual memory	3.8108084E7
max residence set size	1.5065368E7

stage attributes

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

output

WORST_CASE(Omega(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, INF).

(0) CpxTRS
(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxTRS
(3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
(4) typed CpxTrs
(5) OrderProof [LOWER BOUND(ID), 0 ms]
(6) typed CpxTrs
(7) RewriteLemmaProof [LOWER BOUND(ID), 17.3 s]
(8) BEST
    (9) proven lower bound
        (10) LowerBoundPropagationProof [FINISHED, 0 ms]
        (11) BOUNDS(n^1, INF)
    (12) typed CpxTrs
        (13) RewriteLemmaProof [LOWER BOUND(ID), 1338 ms]
        (14) typed CpxTrs
        (15) RewriteLemmaProof [LOWER BOUND(ID), 2022 ms]
        (16) BOUNDS(1, INF)


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

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


The TRS R consists of the following rules:

   0(#) -> #
   +(#, x) -> x
   +(x, #) -> x
   +(0(x), 0(y)) -> 0(+(x, y))
   +(0(x), 1(y)) -> 1(+(x, y))
   +(1(x), 0(y)) -> 1(+(x, y))
   +(0(x), j(y)) -> j(+(x, y))
   +(j(x), 0(y)) -> j(+(x, y))
   +(1(x), 1(y)) -> j(+(+(x, y), 1(#)))
   +(j(x), j(y)) -> 1(+(+(x, y), j(#)))
   +(1(x), j(y)) -> 0(+(x, y))
   +(j(x), 1(y)) -> 0(+(x, y))
   +(+(x, y), z) -> +(x, +(y, z))
   opp(#) -> #
   opp(0(x)) -> 0(opp(x))
   opp(1(x)) -> j(opp(x))
   opp(j(x)) -> 1(opp(x))
   -(x, y) -> +(x, opp(y))
   *(#, x) -> #
   *(0(x), y) -> 0(*(x, y))
   *(1(x), y) -> +(0(*(x, y)), y)
   *(j(x), y) -> -(0(*(x, y)), y)
   *(*(x, y), z) -> *(x, *(y, z))
   *(+(x, y), z) -> +(*(x, z), *(y, z))
   *(x, +(y, z)) -> +(*(x, y), *(x, z))

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

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

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


The TRS R consists of the following rules:

   0(#) -> #
   +'(#, x) -> x
   +'(x, #) -> x
   +'(0(x), 0(y)) -> 0(+'(x, y))
   +'(0(x), 1(y)) -> 1(+'(x, y))
   +'(1(x), 0(y)) -> 1(+'(x, y))
   +'(0(x), j(y)) -> j(+'(x, y))
   +'(j(x), 0(y)) -> j(+'(x, y))
   +'(1(x), 1(y)) -> j(+'(+'(x, y), 1(#)))
   +'(j(x), j(y)) -> 1(+'(+'(x, y), j(#)))
   +'(1(x), j(y)) -> 0(+'(x, y))
   +'(j(x), 1(y)) -> 0(+'(x, y))
   +'(+'(x, y), z) -> +'(x, +'(y, z))
   opp(#) -> #
   opp(0(x)) -> 0(opp(x))
   opp(1(x)) -> j(opp(x))
   opp(j(x)) -> 1(opp(x))
   -(x, y) -> +'(x, opp(y))
   *'(#, x) -> #
   *'(0(x), y) -> 0(*'(x, y))
   *'(1(x), y) -> +'(0(*'(x, y)), y)
   *'(j(x), y) -> -(0(*'(x, y)), y)
   *'(*'(x, y), z) -> *'(x, *'(y, z))
   *'(+'(x, y), z) -> +'(*'(x, z), *'(y, z))

popout

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

job log

popout

actions all output return to Runtime Complexity: TRS