Average Error: 0.0 → 0.0
Time: 352.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 r24860 = x;
        double r24861 = y;
        double r24862 = r24860 + r24861;
        double r24863 = z;
        double r24864 = r24862 + r24863;
        return r24864;
}
↓
double f(double x, double y, double z) {
        double r24865 = x;
        double r24866 = y;
        double r24867 = r24865 + r24866;
        double r24868 = z;
        double r24869 = r24867 + r24868;
        return r24869;
}

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