Average Error: 0.0 → 0.0
Time: 9.3s
Precision: 64
\[x \cdot y + z \cdot \left(1.0 - y\right)\]
↓
\[x \cdot y + z \cdot \left(1.0 - y\right)\]
x \cdot y + z \cdot \left(1.0 - y\right)
↓
x \cdot y + z \cdot \left(1.0 - y\right)
double f(double x, double y, double z) {
        double r27852703 = x;
        double r27852704 = y;
        double r27852705 = r27852703 * r27852704;
        double r27852706 = z;
        double r27852707 = 1.0;
        double r27852708 = r27852707 - r27852704;
        double r27852709 = r27852706 * r27852708;
        double r27852710 = r27852705 + r27852709;
        return r27852710;
}
↓
double f(double x, double y, double z) {
        double r27852711 = x;
        double r27852712 = y;
        double r27852713 = r27852711 * r27852712;
        double r27852714 = z;
        double r27852715 = 1.0;
        double r27852716 = r27852715 - r27852712;
        double r27852717 = r27852714 * r27852716;
        double r27852718 = r27852713 + r27852717;
        return r27852718;
}

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.0 - y\right)\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3"

  :herbie-target
  (- z (* (- z x) y))

  (+ (* x y) (* z (- 1.0 y))))