Average Error: 0.0 → 0.0
Time: 359.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 r23109 = x;
        double r23110 = y;
        double r23111 = r23109 + r23110;
        double r23112 = z;
        double r23113 = r23111 + r23112;
        return r23113;
}
↓
double f(double x, double y, double z) {
        double r23114 = x;
        double r23115 = y;
        double r23116 = r23114 + r23115;
        double r23117 = z;
        double r23118 = r23116 + r23117;
        return r23118;
}

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