Average Error: 0.0 → 0.0
Time: 821.0ms
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 r170439 = x;
        double r170440 = y;
        double r170441 = r170440 - r170439;
        double r170442 = z;
        double r170443 = r170441 * r170442;
        double r170444 = r170439 + r170443;
        return r170444;
}
↓
double f(double x, double y, double z) {
        double r170445 = x;
        double r170446 = y;
        double r170447 = r170446 - r170445;
        double r170448 = z;
        double r170449 = r170447 * r170448;
        double r170450 = r170445 + r170449;
        return r170450;
}

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