Average Error: 0.0 → 0.0
Time: 371.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 r28785 = x;
        double r28786 = y;
        double r28787 = r28785 + r28786;
        double r28788 = z;
        double r28789 = r28787 + r28788;
        return r28789;
}
↓
double f(double x, double y, double z) {
        double r28790 = x;
        double r28791 = y;
        double r28792 = r28790 + r28791;
        double r28793 = z;
        double r28794 = r28792 + r28793;
        return r28794;
}

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