Average Error: 49.1 → 49.1
Time: 4.8s
Precision: 64
\[1.9 \le t \le 2.1\]
\[1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}\]
↓
\[1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}\]
1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}
↓
1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}
double f(double t) {
        double r2565296 = 1.7e+308;
        double r2565297 = t;
        double r2565298 = r2565296 * r2565297;
        double r2565299 = r2565298 - r2565296;
        return r2565299;
}
↓
double f(double t) {
        double r2565300 = 1.7e+308;
        double r2565301 = t;
        double r2565302 = r2565300 * r2565301;
        double r2565303 = r2565302 - r2565300;
        return r2565303;
}

Error

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original49.1
Target0
Herbie49.1
\[\mathsf{fma}\left(1.7 \cdot 10^{+308}, t, -1.7 \cdot 10^{+308}\right)\]

Derivation

  1. Initial program 49.1

    \[1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}\]

  2. Final simplification49.1

    \[\leadsto 1.7 \cdot 10^{+308} \cdot t - 1.7 \cdot 10^{+308}\]

Reproduce

herbie shell --seed 2019158 
(FPCore (t)
  :name "fma_test2"
  :pre (<= 1.9 t 2.1)

  :herbie-target
  (fma 1.7e+308 t (- 1.7e+308))

  (- (* 1.7e+308 t) 1.7e+308))