Average Error: 0.0 → 0.0
Time: 361.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 r33509 = x;
        double r33510 = y;
        double r33511 = r33509 + r33510;
        double r33512 = z;
        double r33513 = r33511 + r33512;
        return r33513;
}
↓
double f(double x, double y, double z) {
        double r33514 = x;
        double r33515 = y;
        double r33516 = r33514 + r33515;
        double r33517 = z;
        double r33518 = r33516 + r33517;
        return r33518;
}

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