Average Error: 0.0 → 0.0
Time: 357.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 r30863 = x;
        double r30864 = y;
        double r30865 = r30863 + r30864;
        double r30866 = z;
        double r30867 = r30865 + r30866;
        return r30867;
}
↓
double f(double x, double y, double z) {
        double r30868 = x;
        double r30869 = y;
        double r30870 = r30868 + r30869;
        double r30871 = z;
        double r30872 = r30870 + r30871;
        return r30872;
}

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