Average Error: 0.0 → 0.0
Time: 9.5s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r47822 = x;
        double r47823 = y;
        double r47824 = r47822 + r47823;
        double r47825 = z;
        double r47826 = 1.0;
        double r47827 = r47825 + r47826;
        double r47828 = r47824 * r47827;
        return r47828;
}
↓
double f(double x, double y, double z) {
        double r47829 = x;
        double r47830 = y;
        double r47831 = r47829 + r47830;
        double r47832 = z;
        double r47833 = r47831 * r47832;
        double r47834 = 1.0;
        double r47835 = r47834 * r47831;
        double r47836 = r47833 + r47835;
        return r47836;
}

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(z + 1\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))