Average Error: 0 → 0
Time: 3.1s
Precision: 64
\[a + b \cdot t\]
\[a + b \cdot t\]
a + b \cdot t
a + b \cdot t
double f(double a, double b, double t) {
        double r528921 = a;
        double r528922 = b;
        double r528923 = t;
        double r528924 = r528922 * r528923;
        double r528925 = r528921 + r528924;
        return r528925;
}

double f(double a, double b, double t) {
        double r528926 = a;
        double r528927 = b;
        double r528928 = t;
        double r528929 = r528927 * r528928;
        double r528930 = r528926 + r528929;
        return r528930;
}

Error

Bits error versus a

Bits error versus b

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

    \[a + b \cdot t\]
  2. Final simplification0

    \[\leadsto a + b \cdot t\]

Reproduce

herbie shell --seed 1 
(FPCore (a b t)
  :name "a+b*t"
  :precision binary32
  (+ a (* b t)))