details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.62615394592 seconds
cpu usage	3.430175713
max memory	1.9441664E8

stage attributes

key	value
output-size	4990
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 0 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__from(X) -> cons(mark(X), from(s(X))) a__after(0, XS) -> mark(XS) a__after(s(N), cons(X, XS)) -> a__after(mark(N), mark(XS)) mark(from(X)) -> a__from(mark(X)) mark(after(X1, X2)) -> a__after(mark(X1), mark(X2)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) mark(0) -> 0 a__from(X) -> from(X) a__after(X1, X2) -> after(X1, X2) 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(EXP, INF). The TRS R consists of the following rules: a__from(X) -> cons(mark(X), from(s(X))) a__after(0, XS) -> mark(XS) a__after(s(N), cons(X, XS)) -> a__after(mark(N), mark(XS)) mark(from(X)) -> a__from(mark(X)) mark(after(X1, X2)) -> a__after(mark(X1), mark(X2)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) mark(0) -> 0 a__from(X) -> from(X) a__after(X1, X2) -> after(X1, X2) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence mark(from(X)) ->^+ a__from(mark(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [X / from(X)]. The result substitution is [ ]. ---------------------------------------- (4) Complex Obligation (BEST) ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127