Average Error: 0.0 → 0.0
Time: 18.5s
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 r129518 = x;
        double r129519 = y;
        double r129520 = r129519 - r129518;
        double r129521 = z;
        double r129522 = r129520 * r129521;
        double r129523 = r129518 + r129522;
        return r129523;
}
↓
double f(double x, double y, double z) {
        double r129524 = x;
        double r129525 = y;
        double r129526 = r129525 - r129524;
        double r129527 = z;
        double r129528 = r129526 * r129527;
        double r129529 = r129524 + r129528;
        return r129529;
}

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