Average Error: 0.0 → 0.0
Time: 2.1s
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 r174117 = x;
        double r174118 = y;
        double r174119 = r174118 - r174117;
        double r174120 = z;
        double r174121 = r174119 * r174120;
        double r174122 = r174117 + r174121;
        return r174122;
}
↓
double f(double x, double y, double z) {
        double r174123 = x;
        double r174124 = y;
        double r174125 = r174124 - r174123;
        double r174126 = z;
        double r174127 = r174125 * r174126;
        double r174128 = r174123 + r174127;
        return r174128;
}

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