Average Error: 0.0 → 0.0
Time: 1.7s
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 r50047 = x;
        double r50048 = y;
        double r50049 = r50047 + r50048;
        double r50050 = z;
        double r50051 = r50049 + r50050;
        return r50051;
}
↓
double f(double x, double y, double z) {
        double r50052 = x;
        double r50053 = y;
        double r50054 = r50052 + r50053;
        double r50055 = z;
        double r50056 = r50054 + r50055;
        return r50056;
}

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