Average Error: 0.0 → 0.0
Time: 1.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 r231928 = x;
        double r231929 = y;
        double r231930 = r231928 * r231929;
        double r231931 = 1.0;
        double r231932 = r231931 - r231928;
        double r231933 = z;
        double r231934 = r231932 * r231933;
        double r231935 = r231930 + r231934;
        return r231935;
}
↓
double f(double x, double y, double z) {
        double r231936 = x;
        double r231937 = y;
        double r231938 = r231936 * r231937;
        double r231939 = 1.0;
        double r231940 = r231939 - r231936;
        double r231941 = z;
        double r231942 = r231940 * r231941;
        double r231943 = r231938 + r231942;
        return r231943;
}

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