Average Error: 0.0 → 0.0
Time: 809.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 r30733 = x;
        double r30734 = y;
        double r30735 = r30733 + r30734;
        double r30736 = z;
        double r30737 = r30735 + r30736;
        return r30737;
}
↓
double f(double x, double y, double z) {
        double r30738 = x;
        double r30739 = y;
        double r30740 = r30738 + r30739;
        double r30741 = z;
        double r30742 = r30740 + r30741;
        return r30742;
}

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