Average Error: 0.0 → 0.0
Time: 2.7s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[z \cdot 1 + y \cdot \left(x - z\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
z \cdot 1 + y \cdot \left(x - z\right)
double f(double x, double y, double z) {
        double r644784 = x;
        double r644785 = y;
        double r644786 = r644784 * r644785;
        double r644787 = z;
        double r644788 = 1.0;
        double r644789 = r644788 - r644785;
        double r644790 = r644787 * r644789;
        double r644791 = r644786 + r644790;
        return r644791;
}
↓
double f(double x, double y, double z) {
        double r644792 = z;
        double r644793 = 1.0;
        double r644794 = r644792 * r644793;
        double r644795 = y;
        double r644796 = x;
        double r644797 = r644796 - r644792;
        double r644798 = r644795 * r644797;
        double r644799 = r644794 + r644798;
        return r644799;
}

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. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{\left(1 \cdot z + x \cdot y\right) - z \cdot y}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{z \cdot 1 + y \cdot \left(x - z\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020001 
(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))))