Average Error: 0.0 → 0.0
Time: 381.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 r23730 = x;
        double r23731 = y;
        double r23732 = r23730 + r23731;
        double r23733 = z;
        double r23734 = r23732 + r23733;
        return r23734;
}
↓
double f(double x, double y, double z) {
        double r23735 = x;
        double r23736 = y;
        double r23737 = r23735 + r23736;
        double r23738 = z;
        double r23739 = r23737 + r23738;
        return r23739;
}

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