Average Error: 0.0 → 0.0
Time: 1.4s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[x \cdot y + z \cdot \left(1 - y\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
x \cdot y + z \cdot \left(1 - y\right)
double f(double x, double y, double z) {
        double r662756 = x;
        double r662757 = y;
        double r662758 = r662756 * r662757;
        double r662759 = z;
        double r662760 = 1.0;
        double r662761 = r662760 - r662757;
        double r662762 = r662759 * r662761;
        double r662763 = r662758 + r662762;
        return r662763;
}
↓
double f(double x, double y, double z) {
        double r662764 = x;
        double r662765 = y;
        double r662766 = r662764 * r662765;
        double r662767 = z;
        double r662768 = 1.0;
        double r662769 = r662768 - r662765;
        double r662770 = r662767 * r662769;
        double r662771 = r662766 + r662770;
        return r662771;
}

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
\[z - \left(z - x\right) \cdot y\]

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020018 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3"
  :precision binary64

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

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