details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	296.84778595 seconds
cpu usage	1128.92278375
max memory	1.5363833856E10

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (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)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: 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)) S is empty. Rewrite Strategy: FULL popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127