Average Error: 0.0 → 0.0
Time: 3.1s
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 r261970 = x;
        double r261971 = y;
        double r261972 = r261970 * r261971;
        double r261973 = 1.0;
        double r261974 = r261973 - r261970;
        double r261975 = z;
        double r261976 = r261974 * r261975;
        double r261977 = r261972 + r261976;
        return r261977;
}
↓
double f(double x, double y, double z) {
        double r261978 = x;
        double r261979 = y;
        double r261980 = r261978 * r261979;
        double r261981 = 1.0;
        double r261982 = r261981 - r261978;
        double r261983 = z;
        double r261984 = r261982 * r261983;
        double r261985 = r261980 + r261984;
        return r261985;
}

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