Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(x + y\right) + z\]
\left(x + y\right) + z
↓
\left(x + y\right) + z
double f(double x, double y, double z) {
        double r30767 = x;
        double r30768 = y;
        double r30769 = r30767 + r30768;
        double r30770 = z;
        double r30771 = r30769 + r30770;
        return r30771;
}
↓
double f(double x, double y, double z) {
        double r30772 = x;
        double r30773 = y;
        double r30774 = r30772 + r30773;
        double r30775 = z;
        double r30776 = r30774 + r30775;
        return r30776;
}

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) + z\]

  2. Final simplification0.0

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

Reproduce

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