Average Error: 0.0 → 0.0
Time: 9.3s
Precision: 64
\[x \cdot y + \left(1 - x\right) \cdot z\]
↓
\[x \cdot y + \left(1 - x\right) \cdot z\]
x \cdot y + \left(1 - x\right) \cdot z
↓
x \cdot y + \left(1 - x\right) \cdot z
double f(double x, double y, double z) {
        double r12627552 = x;
        double r12627553 = y;
        double r12627554 = r12627552 * r12627553;
        double r12627555 = 1.0;
        double r12627556 = r12627555 - r12627552;
        double r12627557 = z;
        double r12627558 = r12627556 * r12627557;
        double r12627559 = r12627554 + r12627558;
        return r12627559;
}
↓
double f(double x, double y, double z) {
        double r12627560 = x;
        double r12627561 = y;
        double r12627562 = r12627560 * r12627561;
        double r12627563 = 1.0;
        double r12627564 = r12627563 - r12627560;
        double r12627565 = z;
        double r12627566 = r12627564 * r12627565;
        double r12627567 = r12627562 + r12627566;
        return r12627567;
}

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 \cdot y + \left(1 - x\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + \left(1 - x\right) \cdot z\]

Reproduce

herbie shell --seed 2019172 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  (+ (* x y) (* (- 1.0 x) z)))