Average Error: 0.0 → 0.0
Time: 2.6s
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 r244416 = x;
        double r244417 = y;
        double r244418 = r244417 - r244416;
        double r244419 = z;
        double r244420 = r244418 * r244419;
        double r244421 = r244416 + r244420;
        return r244421;
}
↓
double f(double x, double y, double z) {
        double r244422 = x;
        double r244423 = y;
        double r244424 = r244423 - r244422;
        double r244425 = z;
        double r244426 = r244424 * r244425;
        double r244427 = r244422 + r244426;
        return r244427;
}

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