Average Error: 0.0 → 0.0
Time: 14.9s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[x \cdot y + \left(z \cdot 1 + z \cdot \left(-y\right)\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
x \cdot y + \left(z \cdot 1 + z \cdot \left(-y\right)\right)
double f(double x, double y, double z) {
        double r472388 = x;
        double r472389 = y;
        double r472390 = r472388 * r472389;
        double r472391 = z;
        double r472392 = 1.0;
        double r472393 = r472392 - r472389;
        double r472394 = r472391 * r472393;
        double r472395 = r472390 + r472394;
        return r472395;
}
↓
double f(double x, double y, double z) {
        double r472396 = x;
        double r472397 = y;
        double r472398 = r472396 * r472397;
        double r472399 = z;
        double r472400 = 1.0;
        double r472401 = r472399 * r472400;
        double r472402 = -r472397;
        double r472403 = r472399 * r472402;
        double r472404 = r472401 + r472403;
        double r472405 = r472398 + r472404;
        return r472405;
}

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. Final simplification0.0

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

Reproduce

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