Average Error: 0.0 → 0.0
Time: 8.9s
Precision: 64
\[a + t \cdot \left(b - a\right)\]
\[a + t \cdot \left(b - a\right)\]
a + t \cdot \left(b - a\right)
a + t \cdot \left(b - a\right)
double f(double a, double t, double b) {
        double r2113071 = a;
        double r2113072 = t;
        double r2113073 = b;
        double r2113074 = r2113073 - r2113071;
        double r2113075 = r2113072 * r2113074;
        double r2113076 = r2113071 + r2113075;
        return r2113076;
}

double f(double a, double t, double b) {
        double r2113077 = a;
        double r2113078 = t;
        double r2113079 = b;
        double r2113080 = r2113079 - r2113077;
        double r2113081 = r2113078 * r2113080;
        double r2113082 = r2113077 + r2113081;
        return r2113082;
}

Error

Bits error versus a

Bits error versus t

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[a + t \cdot \left(b - a\right)\]
  2. Final simplification0.0

    \[\leadsto a + t \cdot \left(b - a\right)\]

Reproduce

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