Average Error: 0.0 → 0.0
Time: 9.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 r145066 = x;
        double r145067 = y;
        double r145068 = r145066 * r145067;
        double r145069 = 1.0;
        double r145070 = r145069 - r145066;
        double r145071 = z;
        double r145072 = r145070 * r145071;
        double r145073 = r145068 + r145072;
        return r145073;
}
↓
double f(double x, double y, double z) {
        double r145074 = x;
        double r145075 = y;
        double r145076 = r145074 * r145075;
        double r145077 = 1.0;
        double r145078 = r145077 - r145074;
        double r145079 = z;
        double r145080 = r145078 * r145079;
        double r145081 = r145076 + r145080;
        return r145081;
}

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