Average Error: 0.0 → 0.0
Time: 10.3s
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 r453433 = x;
        double r453434 = y;
        double r453435 = r453433 * r453434;
        double r453436 = z;
        double r453437 = 1.0;
        double r453438 = r453437 - r453434;
        double r453439 = r453436 * r453438;
        double r453440 = r453435 + r453439;
        return r453440;
}
↓
double f(double x, double y, double z) {
        double r453441 = x;
        double r453442 = y;
        double r453443 = r453441 * r453442;
        double r453444 = z;
        double r453445 = 1.0;
        double r453446 = r453445 - r453442;
        double r453447 = r453444 * r453446;
        double r453448 = r453443 + r453447;
        return r453448;
}

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