Average Error: 0.0 → 0.0
Time: 9.9s
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 r52899 = x;
        double r52900 = y;
        double r52901 = r52899 + r52900;
        double r52902 = 1.0;
        double r52903 = z;
        double r52904 = r52902 - r52903;
        double r52905 = r52901 * r52904;
        return r52905;
}
↓
double f(double x, double y, double z) {
        double r52906 = x;
        double r52907 = y;
        double r52908 = r52906 + r52907;
        double r52909 = 1.0;
        double r52910 = r52908 * r52909;
        double r52911 = z;
        double r52912 = -r52911;
        double r52913 = r52908 * r52912;
        double r52914 = r52910 + r52913;
        return r52914;
}

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 2019235 +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)))