Average Error: 0.0 → 0.0
Time: 6.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 r535230 = x;
        double r535231 = y;
        double r535232 = r535230 * r535231;
        double r535233 = z;
        double r535234 = 1.0;
        double r535235 = r535234 - r535231;
        double r535236 = r535233 * r535235;
        double r535237 = r535232 + r535236;
        return r535237;
}
↓
double f(double x, double y, double z) {
        double r535238 = z;
        double r535239 = 1.0;
        double r535240 = r535238 * r535239;
        double r535241 = y;
        double r535242 = x;
        double r535243 = r535242 - r535238;
        double r535244 = r535241 * r535243;
        double r535245 = r535240 + r535244;
        return r535245;
}

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