Average Error: 0.0 → 0.0
Time: 1.9s
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 r767328 = x;
        double r767329 = y;
        double r767330 = r767328 * r767329;
        double r767331 = z;
        double r767332 = 1.0;
        double r767333 = r767332 - r767329;
        double r767334 = r767331 * r767333;
        double r767335 = r767330 + r767334;
        return r767335;
}

double f(double x, double y, double z) {
        double r767336 = x;
        double r767337 = y;
        double r767338 = r767336 * r767337;
        double r767339 = z;
        double r767340 = 1.0;
        double r767341 = r767340 - r767337;
        double r767342 = r767339 * r767341;
        double r767343 = r767338 + r767342;
        return r767343;
}

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