Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313338
details
property
value
status
complete
benchmark
isort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n176.star.cs.uiowa.edu
space
hoca
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.619 seconds
cpu usage
334.772
user time
331.306
system time
3.46616
max virtual memory
3.64456E7
max residence set size
5726068.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
334.58/291.55 WORST_CASE(Omega(n^1), O(n^2)) 334.58/291.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 334.58/291.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 334.58/291.57 334.58/291.57 334.58/291.57 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 334.58/291.57 334.58/291.57 (0) CpxTRS 334.58/291.57 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 334.58/291.57 (2) CpxWeightedTrs 334.58/291.57 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 334.58/291.57 (4) CpxTypedWeightedTrs 334.58/291.57 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (6) CpxTypedWeightedCompleteTrs 334.58/291.57 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 334.58/291.57 (8) CpxTypedWeightedCompleteTrs 334.58/291.57 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (10) CpxRNTS 334.58/291.57 (11) SimplificationProof [BOTH BOUNDS(ID, ID), 5 ms] 334.58/291.57 (12) CpxRNTS 334.58/291.57 (13) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 334.58/291.57 (14) CpxRNTS 334.58/291.57 (15) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (16) CpxRNTS 334.58/291.57 (17) IntTrsBoundProof [UPPER BOUND(ID), 416 ms] 334.58/291.57 (18) CpxRNTS 334.58/291.57 (19) IntTrsBoundProof [UPPER BOUND(ID), 179 ms] 334.58/291.57 (20) CpxRNTS 334.58/291.57 (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (22) CpxRNTS 334.58/291.57 (23) IntTrsBoundProof [UPPER BOUND(ID), 1912 ms] 334.58/291.57 (24) CpxRNTS 334.58/291.57 (25) IntTrsBoundProof [UPPER BOUND(ID), 554 ms] 334.58/291.57 (26) CpxRNTS 334.58/291.57 (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (28) CpxRNTS 334.58/291.57 (29) IntTrsBoundProof [UPPER BOUND(ID), 421 ms] 334.58/291.57 (30) CpxRNTS 334.58/291.57 (31) IntTrsBoundProof [UPPER BOUND(ID), 156 ms] 334.58/291.57 (32) CpxRNTS 334.58/291.57 (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (34) CpxRNTS 334.58/291.57 (35) IntTrsBoundProof [UPPER BOUND(ID), 196 ms] 334.58/291.57 (36) CpxRNTS 334.58/291.57 (37) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 334.58/291.57 (38) CpxRNTS 334.58/291.57 (39) FinalProof [FINISHED, 0 ms] 334.58/291.57 (40) BOUNDS(1, n^2) 334.58/291.57 (41) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 334.58/291.57 (42) TRS for Loop Detection 334.58/291.57 (43) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 334.58/291.57 (44) BEST 334.58/291.57 (45) proven lower bound 334.58/291.57 (46) LowerBoundPropagationProof [FINISHED, 0 ms] 334.58/291.57 (47) BOUNDS(n^1, INF) 334.58/291.57 (48) TRS for Loop Detection 334.58/291.57 334.58/291.57 334.58/291.57 ---------------------------------------- 334.58/291.57 334.58/291.57 (0) 334.58/291.57 Obligation: 334.58/291.57 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 334.58/291.57 334.58/291.57 334.58/291.57 The TRS R consists of the following rules: 334.58/291.57 334.58/291.57 sort#2(Nil) -> Nil 334.58/291.57 sort#2(Cons(x4, x2)) -> insert#3(x4, sort#2(x2)) 334.58/291.57 cond_insert_ord_x_ys_1(True, x3, x2, x1) -> Cons(x3, Cons(x2, x1)) 334.58/291.57 cond_insert_ord_x_ys_1(False, x3, x2, x1) -> Cons(x2, insert#3(x3, x1)) 334.58/291.57 insert#3(x2, Nil) -> Cons(x2, Nil) 334.58/291.57 insert#3(x6, Cons(x4, x2)) -> cond_insert_ord_x_ys_1(leq#2(x6, x4), x6, x4, x2) 334.58/291.57 leq#2(0, x8) -> True 334.58/291.57 leq#2(S(x12), 0) -> False 334.58/291.57 leq#2(S(x4), S(x2)) -> leq#2(x4, x2) 334.58/291.57 main(x1) -> sort#2(x1) 334.58/291.57 334.58/291.57 S is empty. 334.58/291.57 Rewrite Strategy: INNERMOST 334.58/291.57 ---------------------------------------- 334.58/291.57 334.58/291.57 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 334.58/291.57 Transformed relative TRS to weighted TRS 334.58/291.57 ---------------------------------------- 334.58/291.57 334.58/291.57 (2) 334.58/291.57 Obligation: 334.58/291.57 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). 334.58/291.57 334.58/291.57 334.58/291.57 The TRS R consists of the following rules: 334.58/291.57 334.58/291.57 sort#2(Nil) -> Nil [1] 334.58/291.57 sort#2(Cons(x4, x2)) -> insert#3(x4, sort#2(x2)) [1] 334.58/291.57 cond_insert_ord_x_ys_1(True, x3, x2, x1) -> Cons(x3, Cons(x2, x1)) [1] 334.58/291.57 cond_insert_ord_x_ys_1(False, x3, x2, x1) -> Cons(x2, insert#3(x3, x1)) [1] 334.58/291.57 insert#3(x2, Nil) -> Cons(x2, Nil) [1] 334.58/291.57 insert#3(x6, Cons(x4, x2)) -> cond_insert_ord_x_ys_1(leq#2(x6, x4), x6, x4, x2) [1] 334.58/291.57 leq#2(0, x8) -> True [1]
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