details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.475780964 seconds
cpu usage	1078.72006544
max memory	1.0968592384E10

stage attributes

key	value
output-size	8315
starexec-result	WORST_CASE(Omega(n^2), ?)

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^2), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, 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), 211 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 66 ms] (14) proven lower bound (15) LowerBoundPropagationProof [FINISHED, 0 ms] (16) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0, x), y) -> sum(x, y) sum(nil, y) -> y weight(cons(n, cons(m, x))) -> weight(sum(cons(n, cons(m, x)), cons(0, x))) weight(cons(n, nil)) -> n S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0', x), y) -> sum(x, y) sum(nil, y) -> y weight(cons(n, cons(m, x))) -> weight(sum(cons(n, cons(m, x)), cons(0', x))) weight(cons(n, nil)) -> n S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0', x), y) -> sum(x, y) sum(nil, y) -> y weight(cons(n, cons(m, x))) -> weight(sum(cons(n, cons(m, x)), cons(0', x))) weight(cons(n, nil)) -> n Types: sum :: cons:nil -> cons:nil -> cons:nil cons :: s:0' -> cons:nil -> cons:nil s :: s:0' -> s:0' 0' :: s:0' nil :: cons:nil weight :: cons:nil -> s:0' hole_cons:nil1_0 :: cons:nil hole_s:0'2_0 :: s:0' gen_cons:nil3_0 :: Nat -> cons:nil gen_s:0'4_0 :: Nat -> s:0' ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807