Average Error: 0.0 → 0.0
Time: 6.4s
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 r295122 = x;
        double r295123 = y;
        double r295124 = r295122 * r295123;
        double r295125 = 1.0;
        double r295126 = r295125 - r295122;
        double r295127 = z;
        double r295128 = r295126 * r295127;
        double r295129 = r295124 + r295128;
        return r295129;
}
↓
double f(double x, double y, double z) {
        double r295130 = x;
        double r295131 = y;
        double r295132 = r295130 * r295131;
        double r295133 = 1.0;
        double r295134 = r295133 - r295130;
        double r295135 = z;
        double r295136 = r295134 * r295135;
        double r295137 = r295132 + r295136;
        return r295137;
}

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)))