Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313328
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
n138.star.cs.uiowa.edu
space
hoca
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.10078 seconds
cpu usage
3.70408
user time
3.55163
system time
0.152448
max virtual memory
1.8277336E7
max residence set size
257800.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
3.39/1.65 WORST_CASE(Omega(n^1), O(n^1)) 3.39/2.07 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.39/2.07 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.39/2.07 3.39/2.07 3.39/2.07 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 3.39/2.07 3.39/2.07 (0) CpxTRS 3.39/2.07 (1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 3.39/2.07 (2) CpxTRS 3.39/2.07 (3) CpxTrsMatchBoundsTAProof [FINISHED, 37 ms] 3.39/2.07 (4) BOUNDS(1, n^1) 3.39/2.07 (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 3.39/2.07 (6) TRS for Loop Detection 3.39/2.07 (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 3.39/2.07 (8) BEST 3.39/2.07 (9) proven lower bound 3.39/2.07 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 3.39/2.07 (11) BOUNDS(n^1, INF) 3.39/2.07 (12) TRS for Loop Detection 3.39/2.07 3.39/2.07 3.39/2.07 ---------------------------------------- 3.39/2.07 3.39/2.07 (0) 3.39/2.07 Obligation: 3.39/2.07 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 3.39/2.07 3.39/2.07 3.39/2.07 The TRS R consists of the following rules: 3.39/2.07 3.39/2.07 walk#1(Leaf(x2)) -> cons_x(x2) 3.39/2.07 walk#1(Node(x5, x3)) -> comp_f_g(walk#1(x5), walk#1(x3)) 3.39/2.07 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)) 3.39/2.07 comp_f_g#1(comp_f_g(x7, x9), cons_x(x2), x4) -> comp_f_g#1(x7, x9, Cons(x2, x4)) 3.39/2.07 comp_f_g#1(cons_x(x2), comp_f_g(x5, x7), x3) -> Cons(x2, comp_f_g#1(x5, x7, x3)) 3.39/2.07 comp_f_g#1(cons_x(x5), cons_x(x2), x4) -> Cons(x5, Cons(x2, x4)) 3.39/2.07 main(Leaf(x4)) -> Cons(x4, Nil) 3.39/2.07 main(Node(x9, x5)) -> comp_f_g#1(walk#1(x9), walk#1(x5), Nil) 3.39/2.07 3.39/2.07 S is empty. 3.39/2.07 Rewrite Strategy: INNERMOST 3.39/2.07 ---------------------------------------- 3.39/2.07 3.39/2.07 (1) RelTrsToTrsProof (UPPER BOUND(ID)) 3.39/2.07 transformed relative TRS to TRS 3.39/2.07 ---------------------------------------- 3.39/2.07 3.39/2.07 (2) 3.39/2.07 Obligation: 3.39/2.07 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). 3.39/2.07 3.39/2.07 3.39/2.07 The TRS R consists of the following rules: 3.39/2.07 3.39/2.07 walk#1(Leaf(x2)) -> cons_x(x2) 3.39/2.07 walk#1(Node(x5, x3)) -> comp_f_g(walk#1(x5), walk#1(x3)) 3.39/2.07 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)) 3.39/2.07 comp_f_g#1(comp_f_g(x7, x9), cons_x(x2), x4) -> comp_f_g#1(x7, x9, Cons(x2, x4)) 3.39/2.07 comp_f_g#1(cons_x(x2), comp_f_g(x5, x7), x3) -> Cons(x2, comp_f_g#1(x5, x7, x3)) 3.39/2.07 comp_f_g#1(cons_x(x5), cons_x(x2), x4) -> Cons(x5, Cons(x2, x4)) 3.39/2.07 main(Leaf(x4)) -> Cons(x4, Nil) 3.39/2.07 main(Node(x9, x5)) -> comp_f_g#1(walk#1(x9), walk#1(x5), Nil) 3.39/2.07 3.39/2.07 S is empty. 3.39/2.07 Rewrite Strategy: INNERMOST 3.39/2.07 ---------------------------------------- 3.39/2.07 3.39/2.07 (3) CpxTrsMatchBoundsTAProof (FINISHED) 3.39/2.07 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. 3.39/2.07 3.39/2.07 The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: 3.39/2.07 final states : [1, 2, 3] 3.39/2.07 transitions: 3.39/2.07 Leaf0(0) -> 0 3.39/2.07 cons_x0(0) -> 0 3.39/2.07 Node0(0, 0) -> 0 3.39/2.07 comp_f_g0(0, 0) -> 0 3.39/2.07 Cons0(0, 0) -> 0 3.39/2.07 Nil0() -> 0 3.39/2.07 walk#10(0) -> 1 3.39/2.07 comp_f_g#10(0, 0, 0) -> 2 3.39/2.07 main0(0) -> 3 3.39/2.07 cons_x1(0) -> 1 3.39/2.07 walk#11(0) -> 4 3.39/2.07 walk#11(0) -> 5 3.39/2.07 comp_f_g1(4, 5) -> 1 3.39/2.07 comp_f_g#11(0, 0, 0) -> 6 3.39/2.07 comp_f_g#11(0, 0, 6) -> 2 3.39/2.07 Cons1(0, 0) -> 7 3.39/2.07 comp_f_g#11(0, 0, 7) -> 2 3.39/2.07 comp_f_g#11(0, 0, 0) -> 8 3.39/2.07 Cons1(0, 8) -> 2 3.39/2.07 Cons1(0, 0) -> 9 3.39/2.07 Cons1(0, 9) -> 2 3.39/2.07 Nil1() -> 10 3.39/2.07 Cons1(0, 10) -> 3 3.39/2.07 walk#11(0) -> 11 3.39/2.07 walk#11(0) -> 12 3.39/2.07 Nil1() -> 13
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40
