Average Error: 0.0 → 0.0
Time: 1.3s
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 r23421 = x;
        double r23422 = y;
        double r23423 = r23421 + r23422;
        double r23424 = z;
        double r23425 = r23423 + r23424;
        return r23425;
}
↓
double f(double x, double y, double z) {
        double r23426 = x;
        double r23427 = y;
        double r23428 = r23426 + r23427;
        double r23429 = z;
        double r23430 = r23428 + r23429;
        return r23430;
}

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