Average Error: 0.0 → 0.0
Time: 3.4s
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 r266656 = x;
        double r266657 = y;
        double r266658 = r266657 - r266656;
        double r266659 = z;
        double r266660 = r266658 * r266659;
        double r266661 = r266656 + r266660;
        return r266661;
}
↓
double f(double x, double y, double z) {
        double r266662 = x;
        double r266663 = y;
        double r266664 = r266663 - r266662;
        double r266665 = z;
        double r266666 = r266664 * r266665;
        double r266667 = r266662 + r266666;
        return r266667;
}

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