Average Error: 0.0 → 0.0
Time: 967.0ms
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 r672280 = x;
        double r672281 = y;
        double r672282 = r672280 * r672281;
        double r672283 = z;
        double r672284 = 1.0;
        double r672285 = r672284 - r672281;
        double r672286 = r672283 * r672285;
        double r672287 = r672282 + r672286;
        return r672287;
}
↓
double f(double x, double y, double z) {
        double r672288 = z;
        double r672289 = 1.0;
        double r672290 = r672288 * r672289;
        double r672291 = y;
        double r672292 = x;
        double r672293 = r672292 - r672288;
        double r672294 = r672291 * r672293;
        double r672295 = r672290 + r672294;
        return r672295;
}

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