Average Error: 0.0 → 0.0
Time: 6.9s
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 r50901 = x;
        double r50902 = y;
        double r50903 = r50901 + r50902;
        double r50904 = z;
        double r50905 = 1.0;
        double r50906 = r50904 + r50905;
        double r50907 = r50903 * r50906;
        return r50907;
}
↓
double f(double x, double y, double z) {
        double r50908 = x;
        double r50909 = y;
        double r50910 = r50908 + r50909;
        double r50911 = z;
        double r50912 = 1.0;
        double r50913 = r50911 + r50912;
        double r50914 = r50910 * r50913;
        return r50914;
}

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 2019297 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))