Average Error: 0.0 → 0.0
Time: 7.9s
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 r235035 = x;
        double r235036 = y;
        double r235037 = r235036 - r235035;
        double r235038 = z;
        double r235039 = r235037 * r235038;
        double r235040 = r235035 + r235039;
        return r235040;
}
↓
double f(double x, double y, double z) {
        double r235041 = x;
        double r235042 = y;
        double r235043 = r235042 - r235041;
        double r235044 = z;
        double r235045 = r235043 * r235044;
        double r235046 = r235041 + r235045;
        return r235046;
}

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