Average Error: 0.0 → 0.0
Time: 3.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 r291114 = x;
        double r291115 = y;
        double r291116 = r291114 * r291115;
        double r291117 = 1.0;
        double r291118 = r291117 - r291114;
        double r291119 = z;
        double r291120 = r291118 * r291119;
        double r291121 = r291116 + r291120;
        return r291121;
}
↓
double f(double x, double y, double z) {
        double r291122 = x;
        double r291123 = y;
        double r291124 = r291122 * r291123;
        double r291125 = 1.0;
        double r291126 = r291125 - r291122;
        double r291127 = z;
        double r291128 = r291126 * r291127;
        double r291129 = r291124 + r291128;
        return r291129;
}

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