Average Error: 0.0 → 0.0
Time: 718.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 r29054 = x;
        double r29055 = y;
        double r29056 = r29054 + r29055;
        double r29057 = z;
        double r29058 = r29056 + r29057;
        return r29058;
}
↓
double f(double x, double y, double z) {
        double r29059 = x;
        double r29060 = y;
        double r29061 = r29059 + r29060;
        double r29062 = z;
        double r29063 = r29061 + r29062;
        return r29063;
}

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