Average Error: 0.0 → 0.0
Time: 3.6s
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 r254506 = x;
        double r254507 = y;
        double r254508 = r254507 - r254506;
        double r254509 = z;
        double r254510 = r254508 * r254509;
        double r254511 = r254506 + r254510;
        return r254511;
}
↓
double f(double x, double y, double z) {
        double r254512 = x;
        double r254513 = y;
        double r254514 = r254513 - r254512;
        double r254515 = z;
        double r254516 = r254514 * r254515;
        double r254517 = r254512 + r254516;
        return r254517;
}

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 2020025 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))