Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308233
details
property
value
status
complete
benchmark
Ex49_GM04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n008.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
8.78793 seconds
cpu usage
25.0005
user time
23.1734
system time
1.82709
max virtual memory
1.914314E7
max residence set size
3961624.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
24.75/8.73 WORST_CASE(Omega(n^1), O(n^1)) 24.93/8.74 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 24.93/8.74 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 24.93/8.74 24.93/8.74 24.93/8.74 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 24.93/8.74 24.93/8.74 (0) CpxTRS 24.93/8.74 (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] 24.93/8.74 (2) CpxTRS 24.93/8.74 (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 24.93/8.74 (4) CpxTRS 24.93/8.74 (5) CpxTrsMatchBoundsTAProof [FINISHED, 35 ms] 24.93/8.74 (6) BOUNDS(1, n^1) 24.93/8.74 (7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 24.93/8.74 (8) CpxTRS 24.93/8.74 (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 24.93/8.74 (10) typed CpxTrs 24.93/8.74 (11) OrderProof [LOWER BOUND(ID), 0 ms] 24.93/8.74 (12) typed CpxTrs 24.93/8.74 (13) RewriteLemmaProof [LOWER BOUND(ID), 492 ms] 24.93/8.74 (14) BEST 24.93/8.74 (15) proven lower bound 24.93/8.74 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 24.93/8.74 (17) BOUNDS(n^1, INF) 24.93/8.74 (18) typed CpxTrs 24.93/8.74 (19) RewriteLemmaProof [LOWER BOUND(ID), 98 ms] 24.93/8.74 (20) typed CpxTrs 24.93/8.74 (21) RewriteLemmaProof [LOWER BOUND(ID), 102 ms] 24.93/8.74 (22) typed CpxTrs 24.93/8.74 24.93/8.74 24.93/8.74 ---------------------------------------- 24.93/8.74 24.93/8.74 (0) 24.93/8.74 Obligation: 24.93/8.74 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 24.93/8.74 24.93/8.74 24.93/8.74 The TRS R consists of the following rules: 24.93/8.74 24.93/8.74 active(minus(0, Y)) -> mark(0) 24.93/8.74 active(minus(s(X), s(Y))) -> mark(minus(X, Y)) 24.93/8.74 active(geq(X, 0)) -> mark(true) 24.93/8.74 active(geq(0, s(Y))) -> mark(false) 24.93/8.74 active(geq(s(X), s(Y))) -> mark(geq(X, Y)) 24.93/8.74 active(div(0, s(Y))) -> mark(0) 24.93/8.74 active(div(s(X), s(Y))) -> mark(if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0)) 24.93/8.74 active(if(true, X, Y)) -> mark(X) 24.93/8.74 active(if(false, X, Y)) -> mark(Y) 24.93/8.74 active(s(X)) -> s(active(X)) 24.93/8.74 active(div(X1, X2)) -> div(active(X1), X2) 24.93/8.74 active(if(X1, X2, X3)) -> if(active(X1), X2, X3) 24.93/8.74 s(mark(X)) -> mark(s(X)) 24.93/8.74 div(mark(X1), X2) -> mark(div(X1, X2)) 24.93/8.74 if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) 24.93/8.74 proper(minus(X1, X2)) -> minus(proper(X1), proper(X2)) 24.93/8.74 proper(0) -> ok(0) 24.93/8.74 proper(s(X)) -> s(proper(X)) 24.93/8.74 proper(geq(X1, X2)) -> geq(proper(X1), proper(X2)) 24.93/8.74 proper(true) -> ok(true) 24.93/8.74 proper(false) -> ok(false) 24.93/8.74 proper(div(X1, X2)) -> div(proper(X1), proper(X2)) 24.93/8.74 proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) 24.93/8.74 minus(ok(X1), ok(X2)) -> ok(minus(X1, X2)) 24.93/8.74 s(ok(X)) -> ok(s(X)) 24.93/8.74 geq(ok(X1), ok(X2)) -> ok(geq(X1, X2)) 24.93/8.74 div(ok(X1), ok(X2)) -> ok(div(X1, X2)) 24.93/8.74 if(ok(X1), ok(X2), ok(X3)) -> ok(if(X1, X2, X3)) 24.93/8.74 top(mark(X)) -> top(proper(X)) 24.93/8.74 top(ok(X)) -> top(active(X)) 24.93/8.74 24.93/8.74 S is empty. 24.93/8.74 Rewrite Strategy: FULL 24.93/8.74 ---------------------------------------- 24.93/8.74 24.93/8.74 (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) 24.93/8.74 The following defined symbols can occur below the 0th argument of top: proper, active 24.93/8.74 The following defined symbols can occur below the 0th argument of proper: proper, active 24.93/8.74 The following defined symbols can occur below the 0th argument of active: proper, active 24.93/8.74 24.93/8.74 Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: 24.93/8.74 active(minus(0, Y)) -> mark(0) 24.93/8.74 active(minus(s(X), s(Y))) -> mark(minus(X, Y)) 24.93/8.74 active(geq(X, 0)) -> mark(true) 24.93/8.74 active(geq(0, s(Y))) -> mark(false) 24.93/8.74 active(geq(s(X), s(Y))) -> mark(geq(X, Y)) 24.93/8.74 active(div(0, s(Y))) -> mark(0) 24.93/8.74 active(div(s(X), s(Y))) -> mark(if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0)) 24.93/8.74 active(if(true, X, Y)) -> mark(X) 24.93/8.74 active(if(false, X, Y)) -> mark(Y) 24.93/8.74 active(s(X)) -> s(active(X)) 24.93/8.74 active(div(X1, X2)) -> div(active(X1), X2) 24.93/8.74 active(if(X1, X2, X3)) -> if(active(X1), X2, X3) 24.93/8.74 proper(minus(X1, X2)) -> minus(proper(X1), proper(X2)) 24.93/8.74 proper(s(X)) -> s(proper(X)) 24.93/8.74 proper(geq(X1, X2)) -> geq(proper(X1), proper(X2)) 24.93/8.74 proper(div(X1, X2)) -> div(proper(X1), proper(X2)) 24.93/8.74 proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) 24.93/8.74
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
