Average Error: 0.0 → 0.0
Time: 414.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 r34499 = x;
        double r34500 = y;
        double r34501 = r34499 + r34500;
        double r34502 = z;
        double r34503 = r34501 + r34502;
        return r34503;
}
↓
double f(double x, double y, double z) {
        double r34504 = x;
        double r34505 = y;
        double r34506 = r34504 + r34505;
        double r34507 = z;
        double r34508 = r34506 + r34507;
        return r34508;
}

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