Average Error: 0.0 → 0.0
Time: 884.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 r33756 = x;
        double r33757 = y;
        double r33758 = r33756 + r33757;
        double r33759 = z;
        double r33760 = r33758 + r33759;
        return r33760;
}
↓
double f(double x, double y, double z) {
        double r33761 = x;
        double r33762 = y;
        double r33763 = r33761 + r33762;
        double r33764 = z;
        double r33765 = r33763 + r33764;
        return r33765;
}

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