Average Error: 0.0 → 0.0
Time: 1.7s
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 r702360 = x;
        double r702361 = y;
        double r702362 = r702360 * r702361;
        double r702363 = z;
        double r702364 = 1.0;
        double r702365 = r702364 - r702361;
        double r702366 = r702363 * r702365;
        double r702367 = r702362 + r702366;
        return r702367;
}
↓
double f(double x, double y, double z) {
        double r702368 = x;
        double r702369 = y;
        double r702370 = r702368 * r702369;
        double r702371 = z;
        double r702372 = 1.0;
        double r702373 = r702372 - r702369;
        double r702374 = r702371 * r702373;
        double r702375 = r702370 + r702374;
        return r702375;
}

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