Average Error: 0.0 → 0.0
Time: 476.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 r22785 = x;
        double r22786 = y;
        double r22787 = r22785 + r22786;
        double r22788 = z;
        double r22789 = r22787 + r22788;
        return r22789;
}
↓
double f(double x, double y, double z) {
        double r22790 = x;
        double r22791 = y;
        double r22792 = r22790 + r22791;
        double r22793 = z;
        double r22794 = r22792 + r22793;
        return r22794;
}

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