Average Error: 0.0 → 0.0
Time: 3.3s
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 r291088 = x;
        double r291089 = y;
        double r291090 = r291088 * r291089;
        double r291091 = 1.0;
        double r291092 = r291091 - r291088;
        double r291093 = z;
        double r291094 = r291092 * r291093;
        double r291095 = r291090 + r291094;
        return r291095;
}
↓
double f(double x, double y, double z) {
        double r291096 = x;
        double r291097 = y;
        double r291098 = r291096 * r291097;
        double r291099 = 1.0;
        double r291100 = r291099 - r291096;
        double r291101 = z;
        double r291102 = r291100 * r291101;
        double r291103 = r291098 + r291102;
        return r291103;
}

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