Average Error: 0.0 → 0.0
Time: 14.7s
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 r186649 = x;
        double r186650 = y;
        double r186651 = r186650 - r186649;
        double r186652 = z;
        double r186653 = r186651 * r186652;
        double r186654 = r186649 + r186653;
        return r186654;
}
↓
double f(double x, double y, double z) {
        double r186655 = x;
        double r186656 = y;
        double r186657 = r186656 - r186655;
        double r186658 = z;
        double r186659 = r186657 * r186658;
        double r186660 = r186655 + r186659;
        return r186660;
}

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