Average Error: 0.0 → 0.0
Time: 16.9s
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 r13313371 = x;
        double r13313372 = y;
        double r13313373 = r13313372 - r13313371;
        double r13313374 = z;
        double r13313375 = r13313373 * r13313374;
        double r13313376 = r13313371 + r13313375;
        return r13313376;
}
↓
double f(double x, double y, double z) {
        double r13313377 = x;
        double r13313378 = y;
        double r13313379 = r13313378 - r13313377;
        double r13313380 = z;
        double r13313381 = r13313379 * r13313380;
        double r13313382 = r13313377 + r13313381;
        return r13313382;
}

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