Average Error: 0.0 → 0.0
Time: 404.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 r32093 = x;
        double r32094 = y;
        double r32095 = r32093 + r32094;
        double r32096 = z;
        double r32097 = r32095 + r32096;
        return r32097;
}
↓
double f(double x, double y, double z) {
        double r32098 = x;
        double r32099 = y;
        double r32100 = r32098 + r32099;
        double r32101 = z;
        double r32102 = r32100 + r32101;
        return r32102;
}

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