Average Error: 0.0 → 0.0
Time: 9.6s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r5324893 = x;
        double r5324894 = y;
        double r5324895 = r5324893 + r5324894;
        double r5324896 = z;
        double r5324897 = 1.0;
        double r5324898 = r5324896 + r5324897;
        double r5324899 = r5324895 * r5324898;
        return r5324899;
}
↓
double f(double x, double y, double z) {
        double r5324900 = x;
        double r5324901 = y;
        double r5324902 = r5324900 + r5324901;
        double r5324903 = z;
        double r5324904 = 1.0;
        double r5324905 = r5324903 + r5324904;
        double r5324906 = r5324902 * r5324905;
        return r5324906;
}

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. Final simplification0.0

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

Reproduce

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