Average Error: 0.0 → 0.0
Time: 736.0ms
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 r30832 = x;
        double r30833 = y;
        double r30834 = r30832 + r30833;
        double r30835 = z;
        double r30836 = r30834 + r30835;
        return r30836;
}
↓
double f(double x, double y, double z) {
        double r30837 = x;
        double r30838 = y;
        double r30839 = r30837 + r30838;
        double r30840 = z;
        double r30841 = r30839 + r30840;
        return r30841;
}

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 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))