Average Error: 0.0 → 0.0
Time: 4.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 r284641 = x;
        double r284642 = y;
        double r284643 = r284642 - r284641;
        double r284644 = z;
        double r284645 = r284643 * r284644;
        double r284646 = r284641 + r284645;
        return r284646;
}
↓
double f(double x, double y, double z) {
        double r284647 = x;
        double r284648 = y;
        double r284649 = r284648 - r284647;
        double r284650 = z;
        double r284651 = r284649 * r284650;
        double r284652 = r284647 + r284651;
        return r284652;
}

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