Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[1 \cdot \left(x + y\right) + \left(-z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
1 \cdot \left(x + y\right) + \left(-z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r30418 = x;
        double r30419 = y;
        double r30420 = r30418 + r30419;
        double r30421 = 1.0;
        double r30422 = z;
        double r30423 = r30421 - r30422;
        double r30424 = r30420 * r30423;
        return r30424;
}
↓
double f(double x, double y, double z) {
        double r30425 = 1.0;
        double r30426 = x;
        double r30427 = y;
        double r30428 = r30426 + r30427;
        double r30429 = r30425 * r30428;
        double r30430 = z;
        double r30431 = -r30430;
        double r30432 = r30431 * r30428;
        double r30433 = r30429 + r30432;
        return r30433;
}

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

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

  7. Final simplification0.0

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

Reproduce

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