Average Error: 0.0 → 0.0
Time: 1.2s
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 r773125 = x;
        double r773126 = y;
        double r773127 = r773125 * r773126;
        double r773128 = z;
        double r773129 = 1.0;
        double r773130 = r773129 - r773126;
        double r773131 = r773128 * r773130;
        double r773132 = r773127 + r773131;
        return r773132;
}
↓
double f(double x, double y, double z) {
        double r773133 = z;
        double r773134 = 1.0;
        double r773135 = r773133 * r773134;
        double r773136 = y;
        double r773137 = x;
        double r773138 = r773137 - r773133;
        double r773139 = r773136 * r773138;
        double r773140 = r773135 + r773139;
        return r773140;
}

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