Average Error: 0.0 → 0.0
Time: 6.2s
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 r40587 = x;
        double r40588 = y;
        double r40589 = r40587 + r40588;
        double r40590 = 1.0;
        double r40591 = z;
        double r40592 = r40590 - r40591;
        double r40593 = r40589 * r40592;
        return r40593;
}
↓
double f(double x, double y, double z) {
        double r40594 = 1.0;
        double r40595 = x;
        double r40596 = y;
        double r40597 = r40595 + r40596;
        double r40598 = r40594 * r40597;
        double r40599 = z;
        double r40600 = -r40599;
        double r40601 = r40597 * r40600;
        double r40602 = r40598 + r40601;
        return r40602;
}

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