Average Error: 0.0 → 0.0
Time: 3.6s
Precision: 64
\[x \cdot y + z \cdot \left(1 - y\right)\]
↓
\[z \cdot 1 + y \cdot \left(x - z\right)\]
x \cdot y + z \cdot \left(1 - y\right)
↓
z \cdot 1 + y \cdot \left(x - z\right)
double f(double x, double y, double z) {
        double r867219 = x;
        double r867220 = y;
        double r867221 = r867219 * r867220;
        double r867222 = z;
        double r867223 = 1.0;
        double r867224 = r867223 - r867220;
        double r867225 = r867222 * r867224;
        double r867226 = r867221 + r867225;
        return r867226;
}
↓
double f(double x, double y, double z) {
        double r867227 = z;
        double r867228 = 1.0;
        double r867229 = r867227 * r867228;
        double r867230 = y;
        double r867231 = x;
        double r867232 = r867231 - r867227;
        double r867233 = r867230 * r867232;
        double r867234 = r867229 + r867233;
        return r867234;
}

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. Taylor expanded around 0 0.0

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

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

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