Average Error: 0.0 → 0.0
Time: 774.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 r32804 = x;
        double r32805 = y;
        double r32806 = r32804 + r32805;
        double r32807 = z;
        double r32808 = r32806 + r32807;
        return r32808;
}
↓
double f(double x, double y, double z) {
        double r32809 = x;
        double r32810 = y;
        double r32811 = r32809 + r32810;
        double r32812 = z;
        double r32813 = r32811 + r32812;
        return r32813;
}

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