Average Error: 0.0 → 0.0
Time: 425.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 r27904 = x;
        double r27905 = y;
        double r27906 = r27904 + r27905;
        double r27907 = z;
        double r27908 = r27906 + r27907;
        return r27908;
}
↓
double f(double x, double y, double z) {
        double r27909 = x;
        double r27910 = y;
        double r27911 = r27909 + r27910;
        double r27912 = z;
        double r27913 = r27911 + r27912;
        return r27913;
}

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