Average Error: 0.0 → 0.0
Time: 4.7s
Precision: 64
\[\left(1 - x\right) \cdot y + x \cdot z\]
↓
\[\left(1 - x\right) \cdot y + x \cdot z\]
\left(1 - x\right) \cdot y + x \cdot z
↓
\left(1 - x\right) \cdot y + x \cdot z
double f(double x, double y, double z) {
        double r788686 = 1.0;
        double r788687 = x;
        double r788688 = r788686 - r788687;
        double r788689 = y;
        double r788690 = r788688 * r788689;
        double r788691 = z;
        double r788692 = r788687 * r788691;
        double r788693 = r788690 + r788692;
        return r788693;
}
↓
double f(double x, double y, double z) {
        double r788694 = 1.0;
        double r788695 = x;
        double r788696 = r788694 - r788695;
        double r788697 = y;
        double r788698 = r788696 * r788697;
        double r788699 = z;
        double r788700 = r788695 * r788699;
        double r788701 = r788698 + r788700;
        return r788701;
}

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

Target

Original0.0
Target0.0
Herbie0.0
\[y - x \cdot \left(y - z\right)\]

Derivation

  1. Initial program 0.0

    \[\left(1 - x\right) \cdot y + x \cdot z\]

  2. Final simplification0.0

    \[\leadsto \left(1 - x\right) \cdot y + x \cdot z\]

Reproduce

herbie shell --seed 2020001 
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

  :herbie-target
  (- y (* x (- y z)))

  (+ (* (- 1 x) y) (* x z)))