Average Error: 0.0 → 0.0
Time: 11.7s
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 r10453112 = x;
        double r10453113 = y;
        double r10453114 = r10453112 * r10453113;
        double r10453115 = 1.0;
        double r10453116 = r10453115 - r10453112;
        double r10453117 = z;
        double r10453118 = r10453116 * r10453117;
        double r10453119 = r10453114 + r10453118;
        return r10453119;
}
↓
double f(double x, double y, double z) {
        double r10453120 = x;
        double r10453121 = y;
        double r10453122 = r10453120 * r10453121;
        double r10453123 = 1.0;
        double r10453124 = r10453123 - r10453120;
        double r10453125 = z;
        double r10453126 = r10453124 * r10453125;
        double r10453127 = r10453122 + r10453126;
        return r10453127;
}

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