Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[x \cdot y + \left(z \cdot 1 + z \cdot \left(-y\right)\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
x \cdot y + \left(z \cdot 1 + z \cdot \left(-y\right)\right)
double f(double x, double y, double z) {
        double r483820 = x;
        double r483821 = y;
        double r483822 = r483820 * r483821;
        double r483823 = z;
        double r483824 = 1.0;
        double r483825 = r483824 - r483821;
        double r483826 = r483823 * r483825;
        double r483827 = r483822 + r483826;
        return r483827;
}
↓
double f(double x, double y, double z) {
        double r483828 = x;
        double r483829 = y;
        double r483830 = r483828 * r483829;
        double r483831 = z;
        double r483832 = 1.0;
        double r483833 = r483831 * r483832;
        double r483834 = -r483829;
        double r483835 = r483831 * r483834;
        double r483836 = r483833 + r483835;
        double r483837 = r483830 + r483836;
        return r483837;
}

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. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x \cdot y + z \cdot \color{blue}{\left(1 + \left(-y\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto x \cdot y + \color{blue}{\left(z \cdot 1 + z \cdot \left(-y\right)\right)}\]

  5. Final simplification0.0

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

Reproduce

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