Average Error: 0.0 → 0.0
Time: 382.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 r28555 = x;
        double r28556 = y;
        double r28557 = r28555 + r28556;
        double r28558 = z;
        double r28559 = r28557 + r28558;
        return r28559;
}
↓
double f(double x, double y, double z) {
        double r28560 = x;
        double r28561 = y;
        double r28562 = r28560 + r28561;
        double r28563 = z;
        double r28564 = r28562 + r28563;
        return r28564;
}

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