Average Error: 0.0 → 0.0
Time: 8.1s
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 r46363 = x;
        double r46364 = y;
        double r46365 = r46363 + r46364;
        double r46366 = 1.0;
        double r46367 = z;
        double r46368 = r46366 - r46367;
        double r46369 = r46365 * r46368;
        return r46369;
}
↓
double f(double x, double y, double z) {
        double r46370 = x;
        double r46371 = y;
        double r46372 = r46370 + r46371;
        double r46373 = 1.0;
        double r46374 = r46372 * r46373;
        double r46375 = z;
        double r46376 = -r46375;
        double r46377 = r46372 * r46376;
        double r46378 = r46374 + r46377;
        return r46378;
}

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