Average Error: 0.0 → 0.0
Time: 374.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 r19722 = x;
        double r19723 = y;
        double r19724 = r19722 + r19723;
        double r19725 = z;
        double r19726 = r19724 + r19725;
        return r19726;
}
↓
double f(double x, double y, double z) {
        double r19727 = x;
        double r19728 = y;
        double r19729 = r19727 + r19728;
        double r19730 = z;
        double r19731 = r19729 + r19730;
        return r19731;
}

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