details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.551 seconds
cpu usage	988.517
user time	978.024
system time	10.4925
max virtual memory	1.9536432E7
max residence set size	1.2020176E7

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 Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 298 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 344 ms] (12) proven lower bound (13) LowerBoundPropagationProof [FINISHED, 0 ms] (14) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: xor(x, F) -> x xor(x, neg(x)) -> F and(x, T) -> x and(x, F) -> F and(x, x) -> x and(xor(x, y), z) -> xor(and(x, z), and(y, z)) xor(x, x) -> F impl(x, y) -> xor(and(x, y), xor(x, T)) or(x, y) -> xor(and(x, y), xor(x, y)) equiv(x, y) -> xor(x, xor(y, T)) neg(x) -> xor(x, T) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(F) -> F encArg(T) -> T encArg(cons_xor(x_1, x_2)) -> xor(encArg(x_1), encArg(x_2)) encArg(cons_and(x_1, x_2)) -> and(encArg(x_1), encArg(x_2)) encArg(cons_impl(x_1, x_2)) -> impl(encArg(x_1), encArg(x_2)) encArg(cons_or(x_1, x_2)) -> or(encArg(x_1), encArg(x_2)) encArg(cons_equiv(x_1, x_2)) -> equiv(encArg(x_1), encArg(x_2)) encArg(cons_neg(x_1)) -> neg(encArg(x_1)) encode_xor(x_1, x_2) -> xor(encArg(x_1), encArg(x_2)) encode_F -> F encode_neg(x_1) -> neg(encArg(x_1)) encode_and(x_1, x_2) -> and(encArg(x_1), encArg(x_2)) encode_T -> T encode_impl(x_1, x_2) -> impl(encArg(x_1), encArg(x_2)) encode_or(x_1, x_2) -> or(encArg(x_1), encArg(x_2)) encode_equiv(x_1, x_2) -> equiv(encArg(x_1), encArg(x_2)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: xor(x, F) -> x xor(x, neg(x)) -> F and(x, T) -> x and(x, F) -> F and(x, x) -> x and(xor(x, y), z) -> xor(and(x, z), and(y, z)) xor(x, x) -> F impl(x, y) -> xor(and(x, y), xor(x, T)) or(x, y) -> xor(and(x, y), xor(x, y)) equiv(x, y) -> xor(x, xor(y, T)) neg(x) -> xor(x, T) The (relative) TRS S consists of the following rules: encArg(F) -> F encArg(T) -> T encArg(cons_xor(x_1, x_2)) -> xor(encArg(x_1), encArg(x_2)) encArg(cons_and(x_1, x_2)) -> and(encArg(x_1), encArg(x_2)) encArg(cons_impl(x_1, x_2)) -> impl(encArg(x_1), encArg(x_2)) encArg(cons_or(x_1, x_2)) -> or(encArg(x_1), encArg(x_2)) encArg(cons_equiv(x_1, x_2)) -> equiv(encArg(x_1), encArg(x_2)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost