Average Error: 0.0 → 0.0
Time: 375.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 r44774 = x;
        double r44775 = y;
        double r44776 = r44774 + r44775;
        double r44777 = z;
        double r44778 = r44776 + r44777;
        return r44778;
}
↓
double f(double x, double y, double z) {
        double r44779 = x;
        double r44780 = y;
        double r44781 = r44779 + r44780;
        double r44782 = z;
        double r44783 = r44781 + r44782;
        return r44783;
}

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