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 r614183 = x;
        double r614184 = y;
        double r614185 = r614183 * r614184;
        double r614186 = z;
        double r614187 = 1.0;
        double r614188 = r614187 - r614184;
        double r614189 = r614186 * r614188;
        double r614190 = r614185 + r614189;
        return r614190;
}
↓
double f(double x, double y, double z) {
        double r614191 = z;
        double r614192 = 1.0;
        double r614193 = r614191 * r614192;
        double r614194 = y;
        double r614195 = x;
        double r614196 = r614195 - r614191;
        double r614197 = r614194 * r614196;
        double r614198 = r614193 + r614197;
        return r614198;
}

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