Average Error: 0.0 → 0.0
Time: 469.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 r39057 = x;
        double r39058 = y;
        double r39059 = r39057 + r39058;
        double r39060 = z;
        double r39061 = r39059 + r39060;
        return r39061;
}
↓
double f(double x, double y, double z) {
        double r39062 = x;
        double r39063 = y;
        double r39064 = r39062 + r39063;
        double r39065 = z;
        double r39066 = r39064 + r39065;
        return r39066;
}

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