Average Error: 0.0 → 0.0
Time: 1.9s
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 r460122 = x;
        double r460123 = y;
        double r460124 = r460122 * r460123;
        double r460125 = z;
        double r460126 = 1.0;
        double r460127 = r460126 - r460123;
        double r460128 = r460125 * r460127;
        double r460129 = r460124 + r460128;
        return r460129;
}

double f(double x, double y, double z) {
        double r460130 = z;
        double r460131 = 1.0;
        double r460132 = y;
        double r460133 = r460131 - r460132;
        double r460134 = r460130 * r460133;
        double r460135 = x;
        double r460136 = r460135 * r460132;
        double r460137 = r460134 + r460136;
        return r460137;
}

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-lft-in0.0

    \[\leadsto x \cdot y + \color{blue}{\left(z \cdot 1 + z \cdot \left(-y\right)\right)}\]
  5. Applied associate-+r+0.0

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

    \[\leadsto \color{blue}{\left(x \cdot y + 1 \cdot z\right)} + z \cdot \left(-y\right)\]
  7. Final simplification0.0

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

Reproduce

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