Average Error: 0.0 → 0.0
Time: 360.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 r28615 = x;
        double r28616 = y;
        double r28617 = r28615 + r28616;
        double r28618 = z;
        double r28619 = r28617 + r28618;
        return r28619;
}
↓
double f(double x, double y, double z) {
        double r28620 = x;
        double r28621 = y;
        double r28622 = r28620 + r28621;
        double r28623 = z;
        double r28624 = r28622 + r28623;
        return r28624;
}

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