Average Error: 0.0 → 0.0
Time: 13.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 r11034010 = x;
        double r11034011 = y;
        double r11034012 = r11034010 * r11034011;
        double r11034013 = 1.0;
        double r11034014 = r11034013 - r11034010;
        double r11034015 = z;
        double r11034016 = r11034014 * r11034015;
        double r11034017 = r11034012 + r11034016;
        return r11034017;
}
↓
double f(double x, double y, double z) {
        double r11034018 = x;
        double r11034019 = y;
        double r11034020 = r11034018 * r11034019;
        double r11034021 = 1.0;
        double r11034022 = r11034021 - r11034018;
        double r11034023 = z;
        double r11034024 = r11034022 * r11034023;
        double r11034025 = r11034020 + r11034024;
        return r11034025;
}

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