Average Error: 0.0 → 0.0
Time: 591.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 r44770 = x;
        double r44771 = y;
        double r44772 = r44770 + r44771;
        double r44773 = z;
        double r44774 = r44772 + r44773;
        return r44774;
}
↓
double f(double x, double y, double z) {
        double r44775 = x;
        double r44776 = y;
        double r44777 = r44775 + r44776;
        double r44778 = z;
        double r44779 = r44777 + r44778;
        return r44779;
}

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