Average Error: 0.0 → 0.0
Time: 4.1s
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 r243037 = x;
        double r243038 = y;
        double r243039 = r243038 - r243037;
        double r243040 = z;
        double r243041 = r243039 * r243040;
        double r243042 = r243037 + r243041;
        return r243042;
}
↓
double f(double x, double y, double z) {
        double r243043 = x;
        double r243044 = y;
        double r243045 = r243044 - r243043;
        double r243046 = z;
        double r243047 = r243045 * r243046;
        double r243048 = r243043 + r243047;
        return r243048;
}

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