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 r587746 = x;
        double r587747 = y;
        double r587748 = r587746 * r587747;
        double r587749 = z;
        double r587750 = 1.0;
        double r587751 = r587750 - r587747;
        double r587752 = r587749 * r587751;
        double r587753 = r587748 + r587752;
        return r587753;
}

double f(double x, double y, double z) {
        double r587754 = x;
        double r587755 = y;
        double r587756 = r587754 * r587755;
        double r587757 = z;
        double r587758 = 1.0;
        double r587759 = r587758 - r587755;
        double r587760 = r587757 * r587759;
        double r587761 = r587756 + r587760;
        return r587761;
}

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