Average Error: 0.0 → 0.0
Time: 423.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 r30238 = x;
        double r30239 = y;
        double r30240 = r30238 + r30239;
        double r30241 = z;
        double r30242 = r30240 + r30241;
        return r30242;
}
↓
double f(double x, double y, double z) {
        double r30243 = x;
        double r30244 = y;
        double r30245 = r30243 + r30244;
        double r30246 = z;
        double r30247 = r30245 + r30246;
        return r30247;
}

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