Average Error: 0.0 → 0.0
Time: 367.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 r31510 = x;
        double r31511 = y;
        double r31512 = r31510 + r31511;
        double r31513 = z;
        double r31514 = r31512 + r31513;
        return r31514;
}
↓
double f(double x, double y, double z) {
        double r31515 = x;
        double r31516 = y;
        double r31517 = r31515 + r31516;
        double r31518 = z;
        double r31519 = r31517 + r31518;
        return r31519;
}

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