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 r765158 = x;
        double r765159 = y;
        double r765160 = r765159 - r765158;
        double r765161 = z;
        double r765162 = r765160 * r765161;
        double r765163 = r765158 + r765162;
        return r765163;
}
↓
double f(double x, double y, double z) {
        double r765164 = x;
        double r765165 = y;
        double r765166 = r765165 - r765164;
        double r765167 = z;
        double r765168 = r765166 * r765167;
        double r765169 = r765164 + r765168;
        return r765169;
}

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