Average Error: 0.0 → 0.0
Time: 2.4s
Precision: 64
\[\left(1 - x\right) \cdot y + x \cdot z\]
↓
\[\left(1 - x\right) \cdot y + x \cdot z\]
\left(1 - x\right) \cdot y + x \cdot z
↓
\left(1 - x\right) \cdot y + x \cdot z
double f(double x, double y, double z) {
        double r496125 = 1.0;
        double r496126 = x;
        double r496127 = r496125 - r496126;
        double r496128 = y;
        double r496129 = r496127 * r496128;
        double r496130 = z;
        double r496131 = r496126 * r496130;
        double r496132 = r496129 + r496131;
        return r496132;
}
↓
double f(double x, double y, double z) {
        double r496133 = 1.0;
        double r496134 = x;
        double r496135 = r496133 - r496134;
        double r496136 = y;
        double r496137 = r496135 * r496136;
        double r496138 = z;
        double r496139 = r496134 * r496138;
        double r496140 = r496137 + r496139;
        return r496140;
}

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

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

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

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