Average Error: 0.0 → 0.0
Time: 528.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 r41529 = x;
        double r41530 = y;
        double r41531 = r41529 + r41530;
        double r41532 = z;
        double r41533 = r41531 + r41532;
        return r41533;
}
↓
double f(double x, double y, double z) {
        double r41534 = x;
        double r41535 = y;
        double r41536 = r41534 + r41535;
        double r41537 = z;
        double r41538 = r41536 + r41537;
        return r41538;
}

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