Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308424
details
property
value
status
complete
benchmark
4.45.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
5.61873 seconds
cpu usage
15.2857
user time
13.7298
system time
1.55586
max virtual memory
1.8678696E7
max residence set size
4025304.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
15.13/5.57 WORST_CASE(Omega(n^1), O(n^1)) 15.22/5.58 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 15.22/5.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 15.22/5.58 15.22/5.58 15.22/5.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 15.22/5.58 15.22/5.58 (0) CpxTRS 15.22/5.58 (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (2) CpxTRS 15.22/5.58 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (4) CpxWeightedTrs 15.22/5.58 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (6) CpxTypedWeightedTrs 15.22/5.58 (7) CompletionProof [UPPER BOUND(ID), 0 ms] 15.22/5.58 (8) CpxTypedWeightedCompleteTrs 15.22/5.58 (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (10) CpxTypedWeightedCompleteTrs 15.22/5.58 (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 15.22/5.58 (12) CpxRNTS 15.22/5.58 (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (14) CpxRNTS 15.22/5.58 (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 15.22/5.58 (16) CpxRNTS 15.22/5.58 (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 15.22/5.58 (18) CpxRNTS 15.22/5.58 (19) IntTrsBoundProof [UPPER BOUND(ID), 260 ms] 15.22/5.58 (20) CpxRNTS 15.22/5.58 (21) IntTrsBoundProof [UPPER BOUND(ID), 85 ms] 15.22/5.58 (22) CpxRNTS 15.22/5.58 (23) FinalProof [FINISHED, 0 ms] 15.22/5.58 (24) BOUNDS(1, n^1) 15.22/5.58 (25) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 15.22/5.58 (26) TRS for Loop Detection 15.22/5.58 (27) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 15.22/5.58 (28) BEST 15.22/5.58 (29) proven lower bound 15.22/5.58 (30) LowerBoundPropagationProof [FINISHED, 0 ms] 15.22/5.58 (31) BOUNDS(n^1, INF) 15.22/5.58 (32) TRS for Loop Detection 15.22/5.58 15.22/5.58 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (0) 15.22/5.58 Obligation: 15.22/5.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 15.22/5.58 15.22/5.58 15.22/5.58 The TRS R consists of the following rules: 15.22/5.58 15.22/5.58 f(x, x) -> a 15.22/5.58 f(g(x), y) -> f(x, y) 15.22/5.58 15.22/5.58 S is empty. 15.22/5.58 Rewrite Strategy: FULL 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) 15.22/5.58 Converted rc-obligation to irc-obligation. 15.22/5.58 15.22/5.58 As the TRS does not nest defined symbols, we have rc = irc. 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (2) 15.22/5.58 Obligation: 15.22/5.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). 15.22/5.58 15.22/5.58 15.22/5.58 The TRS R consists of the following rules: 15.22/5.58 15.22/5.58 f(x, x) -> a 15.22/5.58 f(g(x), y) -> f(x, y) 15.22/5.58 15.22/5.58 S is empty. 15.22/5.58 Rewrite Strategy: INNERMOST 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (3) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 15.22/5.58 Transformed relative TRS to weighted TRS 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (4) 15.22/5.58 Obligation: 15.22/5.58 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). 15.22/5.58 15.22/5.58 15.22/5.58 The TRS R consists of the following rules: 15.22/5.58 15.22/5.58 f(x, x) -> a [1] 15.22/5.58 f(g(x), y) -> f(x, y) [1] 15.22/5.58 15.22/5.58 Rewrite Strategy: INNERMOST 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 15.22/5.58 Infered types. 15.22/5.58 ---------------------------------------- 15.22/5.58 15.22/5.58 (6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11