Average Error: 0.0 → 0.0
Time: 3.3s
Precision: 64
\[x + \left(y - x\right) \cdot z\]
↓
\[x + \left(y - x\right) \cdot z\]
x + \left(y - x\right) \cdot z
↓
x + \left(y - x\right) \cdot z
double f(double x, double y, double z) {
        double r179174 = x;
        double r179175 = y;
        double r179176 = r179175 - r179174;
        double r179177 = z;
        double r179178 = r179176 * r179177;
        double r179179 = r179174 + r179178;
        return r179179;
}
↓
double f(double x, double y, double z) {
        double r179180 = x;
        double r179181 = y;
        double r179182 = r179181 - r179180;
        double r179183 = z;
        double r179184 = r179182 * r179183;
        double r179185 = r179180 + r179184;
        return r179185;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + \left(y - x\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x + \left(y - x\right) \cdot z\]

Reproduce

herbie shell --seed 2020060 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))