Average Error: 0.0 → 0.0
Time: 2.4s
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 r213378 = x;
        double r213379 = y;
        double r213380 = r213379 - r213378;
        double r213381 = z;
        double r213382 = r213380 * r213381;
        double r213383 = r213378 + r213382;
        return r213383;
}
↓
double f(double x, double y, double z) {
        double r213384 = x;
        double r213385 = y;
        double r213386 = r213385 - r213384;
        double r213387 = z;
        double r213388 = r213386 * r213387;
        double r213389 = r213384 + r213388;
        return r213389;
}

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