Average Error: 0.0 → 0.0
Time: 1.3s
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 r27451 = x;
        double r27452 = y;
        double r27453 = r27451 + r27452;
        double r27454 = z;
        double r27455 = r27453 + r27454;
        return r27455;
}
↓
double f(double x, double y, double z) {
        double r27456 = x;
        double r27457 = y;
        double r27458 = r27456 + r27457;
        double r27459 = z;
        double r27460 = r27458 + r27459;
        return r27460;
}

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