Average Error: 0.0 → 0.0
Time: 11.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 r164956 = x;
        double r164957 = y;
        double r164958 = r164957 - r164956;
        double r164959 = z;
        double r164960 = r164958 * r164959;
        double r164961 = r164956 + r164960;
        return r164961;
}
↓
double f(double x, double y, double z) {
        double r164962 = x;
        double r164963 = y;
        double r164964 = r164963 - r164962;
        double r164965 = z;
        double r164966 = r164964 * r164965;
        double r164967 = r164962 + r164966;
        return r164967;
}

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