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 r224970 = x;
        double r224971 = y;
        double r224972 = r224971 - r224970;
        double r224973 = z;
        double r224974 = r224972 * r224973;
        double r224975 = r224970 + r224974;
        return r224975;
}
↓
double f(double x, double y, double z) {
        double r224976 = x;
        double r224977 = y;
        double r224978 = r224977 - r224976;
        double r224979 = z;
        double r224980 = r224978 * r224979;
        double r224981 = r224976 + r224980;
        return r224981;
}

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