Average Error: 0.0 → 0.0
Time: 444.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 r13834 = x;
        double r13835 = y;
        double r13836 = r13834 + r13835;
        double r13837 = z;
        double r13838 = r13836 + r13837;
        return r13838;
}
↓
double f(double x, double y, double z) {
        double r13839 = x;
        double r13840 = y;
        double r13841 = r13839 + r13840;
        double r13842 = z;
        double r13843 = r13841 + r13842;
        return r13843;
}

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