Average Error: 0.0 → 0.0
Time: 11.2s
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 r183445 = x;
        double r183446 = y;
        double r183447 = r183446 - r183445;
        double r183448 = z;
        double r183449 = r183447 * r183448;
        double r183450 = r183445 + r183449;
        return r183450;
}
↓
double f(double x, double y, double z) {
        double r183451 = x;
        double r183452 = y;
        double r183453 = r183452 - r183451;
        double r183454 = z;
        double r183455 = r183453 * r183454;
        double r183456 = r183451 + r183455;
        return r183456;
}

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