Average Error: 0.0 → 0.0
Time: 7.8s
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 r46617 = x;
        double r46618 = y;
        double r46619 = r46617 + r46618;
        double r46620 = 1.0;
        double r46621 = z;
        double r46622 = r46620 - r46621;
        double r46623 = r46619 * r46622;
        return r46623;
}
↓
double f(double x, double y, double z) {
        double r46624 = 1.0;
        double r46625 = x;
        double r46626 = y;
        double r46627 = r46625 + r46626;
        double r46628 = r46624 * r46627;
        double r46629 = z;
        double r46630 = -r46629;
        double r46631 = r46627 * r46630;
        double r46632 = r46628 + r46631;
        return r46632;
}

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