Average Error: 0.0 → 0.0
Time: 527.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 r25797 = x;
        double r25798 = y;
        double r25799 = r25797 + r25798;
        double r25800 = z;
        double r25801 = r25799 + r25800;
        return r25801;
}
↓
double f(double x, double y, double z) {
        double r25802 = x;
        double r25803 = y;
        double r25804 = r25802 + r25803;
        double r25805 = z;
        double r25806 = r25804 + r25805;
        return r25806;
}

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