Average Error: 0.0 → 0.0
Time: 2.0s
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 r139849 = x;
        double r139850 = y;
        double r139851 = r139849 * r139850;
        double r139852 = 1.0;
        double r139853 = r139852 - r139849;
        double r139854 = z;
        double r139855 = r139853 * r139854;
        double r139856 = r139851 + r139855;
        return r139856;
}
↓
double f(double x, double y, double z) {
        double r139857 = x;
        double r139858 = y;
        double r139859 = r139857 * r139858;
        double r139860 = 1.0;
        double r139861 = r139860 - r139857;
        double r139862 = z;
        double r139863 = r139861 * r139862;
        double r139864 = r139859 + r139863;
        return r139864;
}

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