Average Error: 0.0 → 0.0
Time: 10.3s
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 r32891 = x;
        double r32892 = y;
        double r32893 = r32891 + r32892;
        double r32894 = z;
        double r32895 = 1.0;
        double r32896 = r32894 + r32895;
        double r32897 = r32893 * r32896;
        return r32897;
}
↓
double f(double x, double y, double z) {
        double r32898 = x;
        double r32899 = y;
        double r32900 = r32898 + r32899;
        double r32901 = z;
        double r32902 = r32900 * r32901;
        double r32903 = 1.0;
        double r32904 = r32903 * r32900;
        double r32905 = r32902 + r32904;
        return r32905;
}

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