Average Error: 0.0 → 0.0
Time: 430.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 r28832 = x;
        double r28833 = y;
        double r28834 = r28832 + r28833;
        double r28835 = z;
        double r28836 = r28834 + r28835;
        return r28836;
}
↓
double f(double x, double y, double z) {
        double r28837 = x;
        double r28838 = y;
        double r28839 = r28837 + r28838;
        double r28840 = z;
        double r28841 = r28839 + r28840;
        return r28841;
}

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