Average Error: 0.0 → 0.0
Time: 48.7s
Precision: 64
\[x + \left(y - x\right) \cdot z\]
↓
\[x - z \cdot \left(x - y\right)\]
x + \left(y - x\right) \cdot z
↓
x - z \cdot \left(x - y\right)
double f(double x, double y, double z) {
        double r237366 = x;
        double r237367 = y;
        double r237368 = r237367 - r237366;
        double r237369 = z;
        double r237370 = r237368 * r237369;
        double r237371 = r237366 + r237370;
        return r237371;
}
↓
double f(double x, double y, double z) {
        double r237372 = x;
        double r237373 = z;
        double r237374 = y;
        double r237375 = r237372 - r237374;
        double r237376 = r237373 * r237375;
        double r237377 = r237372 - r237376;
        return r237377;
}

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. Simplified0.0

    \[\leadsto \color{blue}{x - z \cdot \left(x - y\right)}\]

  3. Final simplification0.0

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

Reproduce

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