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 r623034 = x;
        double r623035 = y;
        double r623036 = r623034 * r623035;
        double r623037 = z;
        double r623038 = 1.0;
        double r623039 = r623038 - r623035;
        double r623040 = r623037 * r623039;
        double r623041 = r623036 + r623040;
        return r623041;
}
↓
double f(double x, double y, double z) {
        double r623042 = z;
        double r623043 = 1.0;
        double r623044 = r623042 * r623043;
        double r623045 = y;
        double r623046 = x;
        double r623047 = r623046 - r623042;
        double r623048 = r623045 * r623047;
        double r623049 = r623044 + r623048;
        return r623049;
}

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