Average Error: 0.0 → 0.0
Time: 3.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 r254470 = x;
        double r254471 = y;
        double r254472 = r254471 - r254470;
        double r254473 = z;
        double r254474 = r254472 * r254473;
        double r254475 = r254470 + r254474;
        return r254475;
}
↓
double f(double x, double y, double z) {
        double r254476 = x;
        double r254477 = y;
        double r254478 = r254477 - r254476;
        double r254479 = z;
        double r254480 = r254478 * r254479;
        double r254481 = r254476 + r254480;
        return r254481;
}

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