Average Error: 0.0 → 0.0
Time: 1.2s
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 r19858 = x;
        double r19859 = y;
        double r19860 = r19858 + r19859;
        double r19861 = z;
        double r19862 = r19860 + r19861;
        return r19862;
}
↓
double f(double x, double y, double z) {
        double r19863 = x;
        double r19864 = y;
        double r19865 = r19863 + r19864;
        double r19866 = z;
        double r19867 = r19865 + r19866;
        return r19867;
}

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