Average Error: 0.0 → 0.0
Time: 6.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[1 \cdot \left(x + y\right) + \left(x + y\right) \cdot \left(-z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
1 \cdot \left(x + y\right) + \left(x + y\right) \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r31468 = x;
        double r31469 = y;
        double r31470 = r31468 + r31469;
        double r31471 = 1.0;
        double r31472 = z;
        double r31473 = r31471 - r31472;
        double r31474 = r31470 * r31473;
        return r31474;
}
↓
double f(double x, double y, double z) {
        double r31475 = 1.0;
        double r31476 = x;
        double r31477 = y;
        double r31478 = r31476 + r31477;
        double r31479 = r31475 * r31478;
        double r31480 = z;
        double r31481 = -r31480;
        double r31482 = r31478 * r31481;
        double r31483 = r31479 + r31482;
        return r31483;
}

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. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020047 +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)))