Average Error: 0.0 → 0.0
Time: 384.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 r31392 = x;
        double r31393 = y;
        double r31394 = r31392 + r31393;
        double r31395 = z;
        double r31396 = r31394 + r31395;
        return r31396;
}
↓
double f(double x, double y, double z) {
        double r31397 = x;
        double r31398 = y;
        double r31399 = r31397 + r31398;
        double r31400 = z;
        double r31401 = r31399 + r31400;
        return r31401;
}

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