Average Error: 0.0 → 0.0
Time: 372.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 r5824 = x;
        double r5825 = y;
        double r5826 = r5824 + r5825;
        double r5827 = z;
        double r5828 = r5826 + r5827;
        return r5828;
}
↓
double f(double x, double y, double z) {
        double r5829 = x;
        double r5830 = y;
        double r5831 = r5829 + r5830;
        double r5832 = z;
        double r5833 = r5831 + r5832;
        return r5833;
}

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