Average Error: 0.0 → 0.0
Time: 6.3s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[x \cdot y + z \cdot \left(1 - y\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
x \cdot y + z \cdot \left(1 - y\right)
double f(double x, double y, double z) {
        double r556361 = x;
        double r556362 = y;
        double r556363 = r556361 * r556362;
        double r556364 = z;
        double r556365 = 1.0;
        double r556366 = r556365 - r556362;
        double r556367 = r556364 * r556366;
        double r556368 = r556363 + r556367;
        return r556368;
}
↓
double f(double x, double y, double z) {
        double r556369 = x;
        double r556370 = y;
        double r556371 = r556369 * r556370;
        double r556372 = z;
        double r556373 = 1.0;
        double r556374 = r556373 - r556370;
        double r556375 = r556372 * r556374;
        double r556376 = r556371 + r556375;
        return r556376;
}

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

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

Reproduce

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