Average Error: 0.0 → 0.0
Time: 6.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 r10069101 = x;
        double r10069102 = y;
        double r10069103 = r10069101 * r10069102;
        double r10069104 = 1.0;
        double r10069105 = r10069104 - r10069101;
        double r10069106 = z;
        double r10069107 = r10069105 * r10069106;
        double r10069108 = r10069103 + r10069107;
        return r10069108;
}
↓
double f(double x, double y, double z) {
        double r10069109 = x;
        double r10069110 = y;
        double r10069111 = r10069109 * r10069110;
        double r10069112 = 1.0;
        double r10069113 = r10069112 - r10069109;
        double r10069114 = z;
        double r10069115 = r10069113 * r10069114;
        double r10069116 = r10069111 + r10069115;
        return r10069116;
}

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