Average Error: 0.0 → 0.0
Time: 1.5s
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 r125637 = x;
        double r125638 = y;
        double r125639 = r125637 * r125638;
        double r125640 = 1.0;
        double r125641 = r125640 - r125637;
        double r125642 = z;
        double r125643 = r125641 * r125642;
        double r125644 = r125639 + r125643;
        return r125644;
}
↓
double f(double x, double y, double z) {
        double r125645 = x;
        double r125646 = y;
        double r125647 = r125645 * r125646;
        double r125648 = 1.0;
        double r125649 = r125648 - r125645;
        double r125650 = z;
        double r125651 = r125649 * r125650;
        double r125652 = r125647 + r125651;
        return r125652;
}

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