Average Error: 0.0 → 0.0
Time: 13.0s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[z \cdot \left(1 - y\right) + x \cdot y\]
x \cdot y + z \cdot \left(1 - y\right)
↓
z \cdot \left(1 - y\right) + x \cdot y
double f(double x, double y, double z) {
        double r440991 = x;
        double r440992 = y;
        double r440993 = r440991 * r440992;
        double r440994 = z;
        double r440995 = 1.0;
        double r440996 = r440995 - r440992;
        double r440997 = r440994 * r440996;
        double r440998 = r440993 + r440997;
        return r440998;
}
↓
double f(double x, double y, double z) {
        double r440999 = z;
        double r441000 = 1.0;
        double r441001 = y;
        double r441002 = r441000 - r441001;
        double r441003 = r440999 * r441002;
        double r441004 = x;
        double r441005 = r441004 * r441001;
        double r441006 = r441003 + r441005;
        return r441006;
}

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. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x \cdot y + z \cdot \color{blue}{\left(1 + \left(-y\right)\right)}\]

  4. Applied distribute-rgt-in0.0

    \[\leadsto x \cdot y + \color{blue}{\left(1 \cdot z + \left(-y\right) \cdot z\right)}\]

  5. Applied associate-+r+0.0

    \[\leadsto \color{blue}{\left(x \cdot y + 1 \cdot z\right) + \left(-y\right) \cdot z}\]

  6. Final simplification0.0

    \[\leadsto z \cdot \left(1 - y\right) + x \cdot y\]

Reproduce

herbie shell --seed 2019291 
(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))))