Average Error: 0.0 → 0.0
Time: 7.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 r142810 = x;
        double r142811 = y;
        double r142812 = r142811 - r142810;
        double r142813 = z;
        double r142814 = r142812 * r142813;
        double r142815 = r142810 + r142814;
        return r142815;
}
↓
double f(double x, double y, double z) {
        double r142816 = x;
        double r142817 = y;
        double r142818 = r142817 - r142816;
        double r142819 = z;
        double r142820 = r142818 * r142819;
        double r142821 = r142816 + r142820;
        return r142821;
}

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