Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313540
details
property
value
status
complete
benchmark
sat.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.715 seconds
cpu usage
380.535
user time
375.493
system time
5.04153
max virtual memory
1.9282328E7
max residence set size
6528420.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
380.25/291.60 WORST_CASE(Omega(n^1), O(n^2)) 380.25/291.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 380.25/291.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 380.25/291.61 380.25/291.61 380.25/291.61 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 380.25/291.61 380.25/291.61 (0) CpxTRS 380.25/291.61 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 380.25/291.61 (2) CpxWeightedTrs 380.25/291.61 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 380.25/291.61 (4) CpxTypedWeightedTrs 380.25/291.61 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (6) CpxTypedWeightedCompleteTrs 380.25/291.61 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 380.25/291.61 (8) CpxTypedWeightedCompleteTrs 380.25/291.61 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (10) CpxRNTS 380.25/291.61 (11) InliningProof [UPPER BOUND(ID), 853 ms] 380.25/291.61 (12) CpxRNTS 380.25/291.61 (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 380.25/291.61 (14) CpxRNTS 380.25/291.61 (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 380.25/291.61 (16) CpxRNTS 380.25/291.61 (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (18) CpxRNTS 380.25/291.61 (19) IntTrsBoundProof [UPPER BOUND(ID), 263 ms] 380.25/291.61 (20) CpxRNTS 380.25/291.61 (21) IntTrsBoundProof [UPPER BOUND(ID), 75 ms] 380.25/291.61 (22) CpxRNTS 380.25/291.61 (23) ResultPropagationProof [UPPER BOUND(ID), 3 ms] 380.25/291.61 (24) CpxRNTS 380.25/291.61 (25) IntTrsBoundProof [UPPER BOUND(ID), 373 ms] 380.25/291.61 (26) CpxRNTS 380.25/291.61 (27) IntTrsBoundProof [UPPER BOUND(ID), 125 ms] 380.25/291.61 (28) CpxRNTS 380.25/291.61 (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (30) CpxRNTS 380.25/291.61 (31) IntTrsBoundProof [UPPER BOUND(ID), 148 ms] 380.25/291.61 (32) CpxRNTS 380.25/291.61 (33) IntTrsBoundProof [UPPER BOUND(ID), 22 ms] 380.25/291.61 (34) CpxRNTS 380.25/291.61 (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (36) CpxRNTS 380.25/291.61 (37) IntTrsBoundProof [UPPER BOUND(ID), 329 ms] 380.25/291.61 (38) CpxRNTS 380.25/291.61 (39) IntTrsBoundProof [UPPER BOUND(ID), 73 ms] 380.25/291.61 (40) CpxRNTS 380.25/291.61 (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (42) CpxRNTS 380.25/291.61 (43) IntTrsBoundProof [UPPER BOUND(ID), 260 ms] 380.25/291.61 (44) CpxRNTS 380.25/291.61 (45) IntTrsBoundProof [UPPER BOUND(ID), 125 ms] 380.25/291.61 (46) CpxRNTS 380.25/291.61 (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (48) CpxRNTS 380.25/291.61 (49) IntTrsBoundProof [UPPER BOUND(ID), 2233 ms] 380.25/291.61 (50) CpxRNTS 380.25/291.61 (51) IntTrsBoundProof [UPPER BOUND(ID), 1221 ms] 380.25/291.61 (52) CpxRNTS 380.25/291.61 (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (54) CpxRNTS 380.25/291.61 (55) IntTrsBoundProof [UPPER BOUND(ID), 1303 ms] 380.25/291.61 (56) CpxRNTS 380.25/291.61 (57) IntTrsBoundProof [UPPER BOUND(ID), 1065 ms] 380.25/291.61 (58) CpxRNTS 380.25/291.61 (59) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (60) CpxRNTS 380.25/291.61 (61) IntTrsBoundProof [UPPER BOUND(ID), 395 ms] 380.25/291.61 (62) CpxRNTS 380.25/291.61 (63) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] 380.25/291.61 (64) CpxRNTS 380.25/291.61 (65) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.25/291.61 (66) CpxRNTS 380.25/291.61 (67) IntTrsBoundProof [UPPER BOUND(ID), 258 ms] 380.25/291.61 (68) CpxRNTS 380.25/291.61 (69) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] 380.25/291.61 (70) CpxRNTS 380.25/291.61 (71) FinalProof [FINISHED, 0 ms] 380.25/291.61 (72) BOUNDS(1, n^2) 380.25/291.61 (73) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 380.25/291.61 (74) TRS for Loop Detection 380.25/291.61 (75) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 380.25/291.61 (76) BEST 380.25/291.61 (77) proven lower bound 380.25/291.61 (78) LowerBoundPropagationProof [FINISHED, 0 ms] 380.25/291.61 (79) BOUNDS(n^1, INF) 380.25/291.61 (80) TRS for Loop Detection 380.25/291.61 380.25/291.61 380.25/291.61 ---------------------------------------- 380.25/291.61 380.25/291.61 (0) 380.25/291.61 Obligation: 380.25/291.61 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 380.25/291.61 380.25/291.61 380.25/291.61 The TRS R consists of the following rules: 380.25/291.61 380.25/291.61 if(true, t, e) -> t
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
