Average Error: 0.0 → 0.0
Time: 1.2s
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 r45462 = x;
        double r45463 = y;
        double r45464 = r45462 + r45463;
        double r45465 = z;
        double r45466 = r45464 + r45465;
        return r45466;
}
↓
double f(double x, double y, double z) {
        double r45467 = x;
        double r45468 = y;
        double r45469 = r45467 + r45468;
        double r45470 = z;
        double r45471 = r45469 + r45470;
        return r45471;
}

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