Average Error: 0.0 → 0.0
Time: 447.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 r24554 = x;
        double r24555 = y;
        double r24556 = r24554 + r24555;
        double r24557 = z;
        double r24558 = r24556 + r24557;
        return r24558;
}
↓
double f(double x, double y, double z) {
        double r24559 = x;
        double r24560 = y;
        double r24561 = r24559 + r24560;
        double r24562 = z;
        double r24563 = r24561 + r24562;
        return r24563;
}

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