Average Error: 0.0 → 0.0
Time: 16.7s
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 r269685 = x;
        double r269686 = y;
        double r269687 = r269686 - r269685;
        double r269688 = z;
        double r269689 = r269687 * r269688;
        double r269690 = r269685 + r269689;
        return r269690;
}
↓
double f(double x, double y, double z) {
        double r269691 = x;
        double r269692 = y;
        double r269693 = r269692 - r269691;
        double r269694 = z;
        double r269695 = r269693 * r269694;
        double r269696 = r269691 + r269695;
        return r269696;
}

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