Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307938
details
property
value
status
complete
benchmark
cade07.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
GTSSK07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.659 seconds
cpu usage
1141.05
user time
1127.51
system time
13.5426
max virtual memory
5.699992E7
max residence set size
1.3034728E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
1140.75/291.57 WORST_CASE(Omega(n^1), O(n^2)) 1140.93/291.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1140.93/291.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1140.93/291.58 1140.93/291.58 1140.93/291.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 1140.93/291.58 1140.93/291.58 (0) CpxTRS 1140.93/291.58 (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 1140.93/291.58 (2) CpxTRS 1140.93/291.58 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 1140.93/291.58 (4) CpxWeightedTrs 1140.93/291.58 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1140.93/291.58 (6) CpxTypedWeightedTrs 1140.93/291.58 (7) CompletionProof [UPPER BOUND(ID), 0 ms] 1140.93/291.58 (8) CpxTypedWeightedCompleteTrs 1140.93/291.58 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 1140.93/291.58 (10) CpxRNTS 1140.93/291.58 (11) CompleteCoflocoProof [FINISHED, 1462 ms] 1140.93/291.58 (12) BOUNDS(1, n^2) 1140.93/291.58 (13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 1140.93/291.58 (14) TRS for Loop Detection 1140.93/291.58 (15) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 1140.93/291.58 (16) BEST 1140.93/291.58 (17) proven lower bound 1140.93/291.58 (18) LowerBoundPropagationProof [FINISHED, 0 ms] 1140.93/291.58 (19) BOUNDS(n^1, INF) 1140.93/291.58 (20) TRS for Loop Detection 1140.93/291.58 1140.93/291.58 1140.93/291.58 ---------------------------------------- 1140.93/291.58 1140.93/291.58 (0) 1140.93/291.58 Obligation: 1140.93/291.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 1140.93/291.58 1140.93/291.58 1140.93/291.58 The TRS R consists of the following rules: 1140.93/291.58 1140.93/291.58 f(true, x, y, z) -> g(gt(x, y), x, y, z) 1140.93/291.58 g(true, x, y, z) -> f(gt(x, z), x, s(y), z) 1140.93/291.58 g(true, x, y, z) -> f(gt(x, z), x, y, s(z)) 1140.93/291.58 gt(0, v) -> false 1140.93/291.58 gt(s(u), 0) -> true 1140.93/291.58 gt(s(u), s(v)) -> gt(u, v) 1140.93/291.58 1140.93/291.58 S is empty. 1140.93/291.58 Rewrite Strategy: FULL 1140.93/291.58 ---------------------------------------- 1140.93/291.58 1140.93/291.58 (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) 1140.93/291.58 Converted rc-obligation to irc-obligation. 1140.93/291.58 1140.93/291.58 The duplicating contexts are: 1140.93/291.58 f(true, [], y, z) 1140.93/291.58 f(true, x, [], z) 1140.93/291.58 g(true, [], y, z) 1140.93/291.58 g(true, x, y, []) 1140.93/291.58 1140.93/291.58 1140.93/291.58 The defined contexts are: 1140.93/291.58 g([], x1, x2, x3) 1140.93/291.58 f([], x1, s(x2), x3) 1140.93/291.58 f([], x1, x2, s(x3)) 1140.93/291.58 1140.93/291.58 1140.93/291.58 [] just represents basic- or constructor-terms in the following defined contexts: 1140.93/291.58 g([], x1, x2, x3) 1140.93/291.58 f([], x1, s(x2), x3) 1140.93/291.58 f([], x1, x2, s(x3)) 1140.93/291.58 1140.93/291.58 1140.93/291.58 As the TRS is an overlay system and the defined contexts and the duplicating contexts don't overlap, we have rc = irc. 1140.93/291.58 ---------------------------------------- 1140.93/291.58 1140.93/291.58 (2) 1140.93/291.58 Obligation: 1140.93/291.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2). 1140.93/291.58 1140.93/291.58 1140.93/291.58 The TRS R consists of the following rules: 1140.93/291.58 1140.93/291.58 f(true, x, y, z) -> g(gt(x, y), x, y, z) 1140.93/291.58 g(true, x, y, z) -> f(gt(x, z), x, s(y), z) 1140.93/291.58 g(true, x, y, z) -> f(gt(x, z), x, y, s(z)) 1140.93/291.58 gt(0, v) -> false 1140.93/291.58 gt(s(u), 0) -> true 1140.93/291.58 gt(s(u), s(v)) -> gt(u, v) 1140.93/291.58 1140.93/291.58 S is empty. 1140.93/291.58 Rewrite Strategy: INNERMOST 1140.93/291.58 ---------------------------------------- 1140.93/291.58 1140.93/291.58 (3) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 1140.93/291.58 Transformed relative TRS to weighted TRS 1140.93/291.58 ---------------------------------------- 1140.93/291.58 1140.93/291.58 (4) 1140.93/291.58 Obligation: 1140.93/291.58 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2).
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
