Average Error: 0.0 → 0.0
Time: 2.5s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[\left(1 - y\right) \cdot z + x \cdot y\]
x \cdot y + z \cdot \left(1 - y\right)
↓
\left(1 - y\right) \cdot z + x \cdot y
double f(double x, double y, double z) {
        double r438225 = x;
        double r438226 = y;
        double r438227 = r438225 * r438226;
        double r438228 = z;
        double r438229 = 1.0;
        double r438230 = r438229 - r438226;
        double r438231 = r438228 * r438230;
        double r438232 = r438227 + r438231;
        return r438232;
}
↓
double f(double x, double y, double z) {
        double r438233 = 1.0;
        double r438234 = y;
        double r438235 = r438233 - r438234;
        double r438236 = z;
        double r438237 = r438235 * r438236;
        double r438238 = x;
        double r438239 = r438238 * r438234;
        double r438240 = r438237 + r438239;
        return r438240;
}

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 \left(1 - y\right) \cdot z + x \cdot y\]

Reproduce

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