Average Error: 62.0 → 62.0
Time: 1.5s
Precision: 64
\[lo \lt -1 \cdot 10^{308} \land hi \gt 10^{308}\]
\[\frac{x - lo}{hi - lo}\]
↓
\[0\]
\frac{x - lo}{hi - lo}
↓
0
double f(double lo, double hi, double x) {
        double r174931 = x;
        double r174932 = lo;
        double r174933 = r174931 - r174932;
        double r174934 = hi;
        double r174935 = r174934 - r174932;
        double r174936 = r174933 / r174935;
        return r174936;
}
↓
double f(double __attribute__((unused)) lo, double __attribute__((unused)) hi, double __attribute__((unused)) x) {
        double r174937 = 0.0;
        return r174937;
}

Error

Bits error versus lo

Bits error versus hi

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 62.0

    \[\frac{x - lo}{hi - lo}\]

  2. Taylor expanded around 0 62.0

    \[\leadsto \color{blue}{0}\]

  3. Final simplification62.0

    \[\leadsto 0\]

Reproduce

herbie shell --seed 2020046 +o rules:numerics
(FPCore (lo hi x)
  :name "(/ (- x lo) (- hi lo))"
  :precision binary64
  :pre (and (< lo -1e+308) (> hi 1e+308))
  (/ (- x lo) (- hi lo)))