Average Error: 0.0 → 0.0
Time: 9.0s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot \left(-z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r31245 = x;
        double r31246 = y;
        double r31247 = r31245 + r31246;
        double r31248 = 1.0;
        double r31249 = z;
        double r31250 = r31248 - r31249;
        double r31251 = r31247 * r31250;
        return r31251;
}
↓
double f(double x, double y, double z) {
        double r31252 = x;
        double r31253 = y;
        double r31254 = r31252 + r31253;
        double r31255 = 1.0;
        double r31256 = r31254 * r31255;
        double r31257 = z;
        double r31258 = -r31257;
        double r31259 = r31254 * r31258;
        double r31260 = r31256 + r31259;
        return r31260;
}

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

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(1 - z\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019208 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))