Average Error: 0.0 → 0.0
Time: 9.8s
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 r158310 = x;
        double r158311 = y;
        double r158312 = r158311 - r158310;
        double r158313 = z;
        double r158314 = r158312 * r158313;
        double r158315 = r158310 + r158314;
        return r158315;
}
↓
double f(double x, double y, double z) {
        double r158316 = x;
        double r158317 = y;
        double r158318 = r158317 - r158316;
        double r158319 = z;
        double r158320 = r158318 * r158319;
        double r158321 = r158316 + r158320;
        return r158321;
}

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