Average Error: 0.0 → 0.0
Time: 3.4s
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 r311955 = x;
        double r311956 = y;
        double r311957 = r311955 * r311956;
        double r311958 = 1.0;
        double r311959 = r311958 - r311955;
        double r311960 = z;
        double r311961 = r311959 * r311960;
        double r311962 = r311957 + r311961;
        return r311962;
}
↓
double f(double x, double y, double z) {
        double r311963 = x;
        double r311964 = y;
        double r311965 = r311963 * r311964;
        double r311966 = 1.0;
        double r311967 = r311966 - r311963;
        double r311968 = z;
        double r311969 = r311967 * r311968;
        double r311970 = r311965 + r311969;
        return r311970;
}

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