Average Error: 62.0 → 52.1
Time: 1.4s
Precision: 64
\[lo \lt -1 \cdot 10^{308} \land hi \gt 10^{308}\]
\[\frac{x - lo}{hi - lo}\]
↓
\[1\]
\frac{x - lo}{hi - lo}
↓
1
double f(double lo, double hi, double x) {
        double r21489 = x;
        double r21490 = lo;
        double r21491 = r21489 - r21490;
        double r21492 = hi;
        double r21493 = r21492 - r21490;
        double r21494 = r21491 / r21493;
        return r21494;
}
↓
double f(double __attribute__((unused)) lo, double __attribute__((unused)) hi, double __attribute__((unused)) x) {
        double r21495 = 1.0;
        return r21495;
}

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. Using strategy rm

  3. Applied div-sub62.0

    \[\leadsto \color{blue}{\frac{x}{hi - lo} - \frac{lo}{hi - lo}}\]

  4. Taylor expanded around 0 52.1

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

  5. Final simplification52.1

    \[\leadsto 1\]

Reproduce

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