Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS Innermost pair #487112722
details
property
value
status
complete
benchmark
gcd.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.614 seconds
cpu usage
1136.14
user time
1124.52
system time
11.6233
max virtual memory
3.8343808E7
max residence set size
1.498434E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). (0) CpxRelTRS (1) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 215 ms] (2) CpxRelTRS (3) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxRelTRS (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) typed CpxTrs (7) OrderProof [LOWER BOUND(ID), 0 ms] (8) typed CpxTrs (9) RewriteLemmaProof [LOWER BOUND(ID), 274 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 29 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 50 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 32 ms] (20) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: @(Cons(x, xs), ys) -> Cons(x, @(xs, ys)) @(Nil, ys) -> ys gt0(Cons(x, xs), Nil) -> True gt0(Cons(x', xs'), Cons(x, xs)) -> gt0(xs', xs) gcd(Nil, Nil) -> Nil gcd(Nil, Cons(x, xs)) -> Nil gcd(Cons(x, xs), Nil) -> Nil gcd(Cons(x', xs'), Cons(x, xs)) -> gcd[Ite](eqList(Cons(x', xs'), Cons(x, xs)), Cons(x', xs'), Cons(x, xs)) lgth(Cons(x, xs)) -> @(Cons(Nil, Nil), lgth(xs)) eqList(Cons(x, xs), Cons(y, ys)) -> and(eqList(x, y), eqList(xs, ys)) eqList(Cons(x, xs), Nil) -> False eqList(Nil, Cons(y, ys)) -> False eqList(Nil, Nil) -> True lgth(Nil) -> Nil gt0(Nil, y) -> False monus(x, y) -> monus[Ite](eqList(lgth(y), Cons(Nil, Nil)), x, y) goal(x, y) -> gcd(x, y) The (relative) TRS S consists of the following rules: and(False, False) -> False and(True, False) -> False and(False, True) -> False and(True, True) -> True monus[Ite](False, Cons(x', xs'), Cons(x, xs)) -> monus(xs', xs) monus[Ite](True, Cons(x, xs), y) -> xs gcd[Ite](False, x, y) -> gcd[False][Ite](gt0(x, y), x, y) gcd[Ite](True, x, y) -> x gcd[False][Ite](False, x, y) -> gcd(x, monus(y, x)) gcd[False][Ite](True, x, y) -> gcd(monus(x, y), y) Rewrite Strategy: INNERMOST ---------------------------------------- (1) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: @(Cons(x, xs), ys) -> Cons(x, @(xs, ys)) @(Nil, ys) -> ys gt0(Cons(x, xs), Nil) -> True gt0(Cons(x', xs'), Cons(x, xs)) -> gt0(xs', xs) gcd(Nil, Nil) -> Nil gcd(Nil, Cons(x, xs)) -> Nil gcd(Cons(x, xs), Nil) -> Nil gcd(Cons(x', xs'), Cons(x, xs)) -> gcd[Ite](eqList(Cons(x', xs'), Cons(x, xs)), Cons(x', xs'), Cons(x, xs)) lgth(Cons(x, xs)) -> @(Cons(Nil, Nil), lgth(xs)) eqList(Cons(x, xs), Cons(y, ys)) -> and(eqList(x, y), eqList(xs, ys)) eqList(Cons(x, xs), Nil) -> False eqList(Nil, Cons(y, ys)) -> False eqList(Nil, Nil) -> True lgth(Nil) -> Nil gt0(Nil, y) -> False monus(x, y) -> monus[Ite](eqList(lgth(y), Cons(Nil, Nil)), x, y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS Innermost