Average Error: 0.0 → 0.0
Time: 2.7s
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 r31268 = x;
        double r31269 = y;
        double r31270 = r31268 + r31269;
        double r31271 = z;
        double r31272 = r31270 + r31271;
        return r31272;
}
↓
double f(double x, double y, double z) {
        double r31273 = x;
        double r31274 = y;
        double r31275 = r31273 + r31274;
        double r31276 = z;
        double r31277 = r31275 + r31276;
        return r31277;
}

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