Average Error: 0.0 → 0.0
Time: 12.9s
Precision: 64
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
↓
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
x \cdot y + \left(1.0 - x\right) \cdot z
↓
x \cdot y + \left(1.0 - x\right) \cdot z
double f(double x, double y, double z) {
        double r10955081 = x;
        double r10955082 = y;
        double r10955083 = r10955081 * r10955082;
        double r10955084 = 1.0;
        double r10955085 = r10955084 - r10955081;
        double r10955086 = z;
        double r10955087 = r10955085 * r10955086;
        double r10955088 = r10955083 + r10955087;
        return r10955088;
}
↓
double f(double x, double y, double z) {
        double r10955089 = x;
        double r10955090 = y;
        double r10955091 = r10955089 * r10955090;
        double r10955092 = 1.0;
        double r10955093 = r10955092 - r10955089;
        double r10955094 = z;
        double r10955095 = r10955093 * r10955094;
        double r10955096 = r10955091 + r10955095;
        return r10955096;
}

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.0 - x\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + \left(1.0 - x\right) \cdot z\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  (+ (* x y) (* (- 1.0 x) z)))