Average Error: 0.0 → 0.0
Time: 429.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 r26257 = x;
        double r26258 = y;
        double r26259 = r26257 + r26258;
        double r26260 = z;
        double r26261 = r26259 + r26260;
        return r26261;
}
↓
double f(double x, double y, double z) {
        double r26262 = x;
        double r26263 = y;
        double r26264 = r26262 + r26263;
        double r26265 = z;
        double r26266 = r26264 + r26265;
        return r26266;
}

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