Average Error: 0.0 → 0.0
Time: 366.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 r22752 = x;
        double r22753 = y;
        double r22754 = r22752 + r22753;
        double r22755 = z;
        double r22756 = r22754 + r22755;
        return r22756;
}
↓
double f(double x, double y, double z) {
        double r22757 = x;
        double r22758 = y;
        double r22759 = r22757 + r22758;
        double r22760 = z;
        double r22761 = r22759 + r22760;
        return r22761;
}

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