Average Error: 0.0 → 0.0
Time: 809.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 r40766 = x;
        double r40767 = y;
        double r40768 = r40766 + r40767;
        double r40769 = z;
        double r40770 = r40768 + r40769;
        return r40770;
}
↓
double f(double x, double y, double z) {
        double r40771 = x;
        double r40772 = y;
        double r40773 = r40771 + r40772;
        double r40774 = z;
        double r40775 = r40773 + r40774;
        return r40775;
}

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