Average Error: 0.0 → 0.0
Time: 730.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 r29501 = x;
        double r29502 = y;
        double r29503 = r29501 + r29502;
        double r29504 = z;
        double r29505 = r29503 + r29504;
        return r29505;
}
↓
double f(double x, double y, double z) {
        double r29506 = x;
        double r29507 = y;
        double r29508 = r29506 + r29507;
        double r29509 = z;
        double r29510 = r29508 + r29509;
        return r29510;
}

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