Average Error: 0.0 → 0.0
Time: 1.4s
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 r817599 = x;
        double r817600 = y;
        double r817601 = r817599 * r817600;
        double r817602 = z;
        double r817603 = 1.0;
        double r817604 = r817603 - r817600;
        double r817605 = r817602 * r817604;
        double r817606 = r817601 + r817605;
        return r817606;
}
↓
double f(double x, double y, double z) {
        double r817607 = z;
        double r817608 = 1.0;
        double r817609 = r817607 * r817608;
        double r817610 = y;
        double r817611 = x;
        double r817612 = r817611 - r817607;
        double r817613 = r817610 * r817612;
        double r817614 = r817609 + r817613;
        return r817614;
}

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 2020057 
(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))))