Average Error: 0.0 → 0.0
Time: 7.0s
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 r29656 = x;
        double r29657 = y;
        double r29658 = r29656 + r29657;
        double r29659 = z;
        double r29660 = r29658 + r29659;
        return r29660;
}
↓
double f(double x, double y, double z) {
        double r29661 = x;
        double r29662 = y;
        double r29663 = r29661 + r29662;
        double r29664 = z;
        double r29665 = r29663 + r29664;
        return r29665;
}

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