Average Error: 49.1 → 49.1
Time: 1.5s
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 r10075917 = 1.7e+308;
        double r10075918 = t;
        double r10075919 = r10075917 * r10075918;
        double r10075920 = r10075919 - r10075917;
        return r10075920;
}
↓
double f(double t) {
        double r10075921 = 1.7e+308;
        double r10075922 = t;
        double r10075923 = r10075921 * r10075922;
        double r10075924 = r10075923 - r10075921;
        return r10075924;
}

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
\[(\left( 1.7 \cdot 10^{+308} \right) \cdot t + \left(-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 2019107 
(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))