Average Error: 0.0 → 0.0
Time: 11.9s
Precision: 64
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
↓
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
x \cdot y + \left(1.0 - x\right) \cdot z
↓
x \cdot y + \left(1.0 - x\right) \cdot z
double f(double x, double y, double z) {
        double r13773848 = x;
        double r13773849 = y;
        double r13773850 = r13773848 * r13773849;
        double r13773851 = 1.0;
        double r13773852 = r13773851 - r13773848;
        double r13773853 = z;
        double r13773854 = r13773852 * r13773853;
        double r13773855 = r13773850 + r13773854;
        return r13773855;
}
↓
double f(double x, double y, double z) {
        double r13773856 = x;
        double r13773857 = y;
        double r13773858 = r13773856 * r13773857;
        double r13773859 = 1.0;
        double r13773860 = r13773859 - r13773856;
        double r13773861 = z;
        double r13773862 = r13773860 * r13773861;
        double r13773863 = r13773858 + r13773862;
        return r13773863;
}

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.0 - x\right) \cdot z\]

  2. Final simplification0.0

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

Reproduce

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