Average Error: 0.0 → 0.0
Time: 366.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 r21789 = x;
        double r21790 = y;
        double r21791 = r21789 + r21790;
        double r21792 = z;
        double r21793 = r21791 + r21792;
        return r21793;
}
↓
double f(double x, double y, double z) {
        double r21794 = x;
        double r21795 = y;
        double r21796 = r21794 + r21795;
        double r21797 = z;
        double r21798 = r21796 + r21797;
        return r21798;
}

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