Average Error: 0.0 → 0.0
Time: 5.1s
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 r5134394 = x;
        double r5134395 = y;
        double r5134396 = r5134394 * r5134395;
        double r5134397 = 1.0;
        double r5134398 = r5134397 - r5134394;
        double r5134399 = z;
        double r5134400 = r5134398 * r5134399;
        double r5134401 = r5134396 + r5134400;
        return r5134401;
}
↓
double f(double x, double y, double z) {
        double r5134402 = x;
        double r5134403 = y;
        double r5134404 = r5134402 * r5134403;
        double r5134405 = 1.0;
        double r5134406 = r5134405 - r5134402;
        double r5134407 = z;
        double r5134408 = r5134406 * r5134407;
        double r5134409 = r5134404 + r5134408;
        return r5134409;
}

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