Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313882
details
property
value
status
complete
benchmark
rematch.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
Frederiksen_Others
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
293.686 seconds
cpu usage
1154.23
user time
1138.32
system time
15.9073
max virtual memory
4.0974496E7
max residence set size
1.502126E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
1147.62/291.94 WORST_CASE(Omega(n^2), ?) 1153.13/293.36 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1153.13/293.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1153.13/293.36 1153.13/293.36 1153.13/293.36 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^2, INF). 1153.13/293.36 1153.13/293.36 (0) CpxRelTRS 1153.13/293.36 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 322 ms] 1153.13/293.36 (2) CpxRelTRS 1153.13/293.36 (3) RenamingProof [BOTH BOUNDS(ID, ID), 1 ms] 1153.13/293.36 (4) CpxRelTRS 1153.13/293.36 (5) SlicingProof [LOWER BOUND(ID), 737 ms] 1153.13/293.36 (6) CpxRelTRS 1153.13/293.36 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 4 ms] 1153.13/293.36 (8) typed CpxTrs 1153.13/293.36 (9) OrderProof [LOWER BOUND(ID), 94 ms] 1153.13/293.36 (10) typed CpxTrs 1153.13/293.36 (11) RewriteLemmaProof [LOWER BOUND(ID), 2421 ms] 1153.13/293.36 (12) BEST 1153.13/293.36 (13) proven lower bound 1153.13/293.36 (14) LowerBoundPropagationProof [FINISHED, 0 ms] 1153.13/293.36 (15) BOUNDS(n^1, INF) 1153.13/293.36 (16) typed CpxTrs 1153.13/293.36 (17) RewriteLemmaProof [LOWER BOUND(ID), 982 ms] 1153.13/293.36 (18) BEST 1153.13/293.36 (19) proven lower bound 1153.13/293.36 (20) LowerBoundPropagationProof [FINISHED, 0 ms] 1153.13/293.36 (21) BOUNDS(n^2, INF) 1153.13/293.36 (22) typed CpxTrs 1153.13/293.36 1153.13/293.36 1153.13/293.36 ---------------------------------------- 1153.13/293.36 1153.13/293.36 (0) 1153.13/293.36 Obligation: 1153.13/293.36 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^2, INF). 1153.13/293.36 1153.13/293.36 1153.13/293.36 The TRS R consists of the following rules: 1153.13/293.36 1153.13/293.36 @(Cons(x, xs), ys) -> Cons(x, @(xs, ys)) 1153.13/293.36 @(Nil, ys) -> ys 1153.13/293.36 domatch(Pchar(Cslash), Cons(Cslash, xs)) -> Cons(Cslash, xs) 1153.13/293.36 domatch(Pchar(Clpar), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Crpar), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Cstar), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Cdot), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Z), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Y), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(X), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(W), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(V), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(U), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(T), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(S), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(R), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Q), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(P), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(O), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(N), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(M), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(L), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(K), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(J), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(I), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(H), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(G), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(F), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(E), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(D), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(C), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(B), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(A), Cons(Cslash, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Cslash), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Clpar), Cons(Clpar, xs)) -> Cons(Clpar, xs) 1153.13/293.36 domatch(Pchar(Crpar), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Cstar), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Cdot), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Z), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Y), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(X), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(W), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(V), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(U), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(T), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(S), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(R), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(Q), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(P), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(O), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(N), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(M), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(L), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(K), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(J), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(I), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(H), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(G), Cons(Clpar, xs)) -> Nil 1153.13/293.36 domatch(Pchar(F), Cons(Clpar, xs)) -> Nil
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