Average Error: 0.0 → 0.0
Time: 13.0s
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 r11915973 = x;
        double r11915974 = y;
        double r11915975 = r11915973 * r11915974;
        double r11915976 = 1.0;
        double r11915977 = r11915976 - r11915973;
        double r11915978 = z;
        double r11915979 = r11915977 * r11915978;
        double r11915980 = r11915975 + r11915979;
        return r11915980;
}
↓
double f(double x, double y, double z) {
        double r11915981 = x;
        double r11915982 = y;
        double r11915983 = r11915981 * r11915982;
        double r11915984 = 1.0;
        double r11915985 = r11915984 - r11915981;
        double r11915986 = z;
        double r11915987 = r11915985 * r11915986;
        double r11915988 = r11915983 + r11915987;
        return r11915988;
}

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