Average Error: 0.0 → 0.0
Time: 407.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 r50852 = x;
        double r50853 = y;
        double r50854 = r50852 + r50853;
        double r50855 = z;
        double r50856 = r50854 + r50855;
        return r50856;
}
↓
double f(double x, double y, double z) {
        double r50857 = x;
        double r50858 = y;
        double r50859 = r50857 + r50858;
        double r50860 = z;
        double r50861 = r50859 + r50860;
        return r50861;
}

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