Average Error: 0.0 → 0.0
Time: 8.7s
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 r205838 = x;
        double r205839 = y;
        double r205840 = r205838 * r205839;
        double r205841 = 1.0;
        double r205842 = r205841 - r205838;
        double r205843 = z;
        double r205844 = r205842 * r205843;
        double r205845 = r205840 + r205844;
        return r205845;
}
↓
double f(double x, double y, double z) {
        double r205846 = x;
        double r205847 = y;
        double r205848 = r205846 * r205847;
        double r205849 = 1.0;
        double r205850 = r205849 - r205846;
        double r205851 = z;
        double r205852 = r205850 * r205851;
        double r205853 = r205848 + r205852;
        return r205853;
}

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 2019350 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  :precision binary64
  (+ (* x y) (* (- 1 x) z)))