details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.71086001396 seconds
cpu usage	3.895055226
max memory	2.56385024E8

stage attributes

key	value
output-size	7743
starexec-result	WORST_CASE(Omega(n^1), O(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), O(n^1)) 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^1, n^1). (0) CpxTRS (1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) CpxTrsMatchBoundsTAProof [FINISHED, 49 ms] (4) BOUNDS(1, n^1) (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: walk#1(Leaf(x2)) -> cons_x(x2) walk#1(Node(x5, x3)) -> comp_f_g(walk#1(x5), walk#1(x3)) comp_f_g#1(comp_f_g(x4, x5), comp_f_g(x2, x3), x1) -> comp_f_g#1(x4, x5, comp_f_g#1(x2, x3, x1)) comp_f_g#1(comp_f_g(x7, x9), cons_x(x2), x4) -> comp_f_g#1(x7, x9, Cons(x2, x4)) comp_f_g#1(cons_x(x2), comp_f_g(x5, x7), x3) -> Cons(x2, comp_f_g#1(x5, x7, x3)) comp_f_g#1(cons_x(x5), cons_x(x2), x4) -> Cons(x5, Cons(x2, x4)) main(Leaf(x4)) -> Cons(x4, Nil) main(Node(x9, x5)) -> comp_f_g#1(walk#1(x9), walk#1(x5), Nil) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: walk#1(Leaf(x2)) -> cons_x(x2) walk#1(Node(x5, x3)) -> comp_f_g(walk#1(x5), walk#1(x3)) comp_f_g#1(comp_f_g(x4, x5), comp_f_g(x2, x3), x1) -> comp_f_g#1(x4, x5, comp_f_g#1(x2, x3, x1)) comp_f_g#1(comp_f_g(x7, x9), cons_x(x2), x4) -> comp_f_g#1(x7, x9, Cons(x2, x4)) comp_f_g#1(cons_x(x2), comp_f_g(x5, x7), x3) -> Cons(x2, comp_f_g#1(x5, x7, x3)) comp_f_g#1(cons_x(x5), cons_x(x2), x4) -> Cons(x5, Cons(x2, x4)) main(Leaf(x4)) -> Cons(x4, Nil) main(Node(x9, x5)) -> comp_f_g#1(walk#1(x9), walk#1(x5), Nil) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsMatchBoundsTAProof (FINISHED) A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2. The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: final states : [1, 2, 3] transitions: Leaf0(0) -> 0 cons_x0(0) -> 0 Node0(0, 0) -> 0 comp_f_g0(0, 0) -> 0 Cons0(0, 0) -> 0 Nil0() -> 0 walk#10(0) -> 1 comp_f_g#10(0, 0, 0) -> 2 main0(0) -> 3 cons_x1(0) -> 1 walk#11(0) -> 4 walk#11(0) -> 5 comp_f_g1(4, 5) -> 1 comp_f_g#11(0, 0, 0) -> 6 comp_f_g#11(0, 0, 6) -> 2 Cons1(0, 0) -> 7 comp_f_g#11(0, 0, 7) -> 2 comp_f_g#11(0, 0, 0) -> 8 Cons1(0, 8) -> 2 Cons1(0, 0) -> 9 popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807