Average Error: 0.0 → 0.0
Time: 369.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 r32876 = x;
        double r32877 = y;
        double r32878 = r32876 + r32877;
        double r32879 = z;
        double r32880 = r32878 + r32879;
        return r32880;
}
↓
double f(double x, double y, double z) {
        double r32881 = x;
        double r32882 = y;
        double r32883 = r32881 + r32882;
        double r32884 = z;
        double r32885 = r32883 + r32884;
        return r32885;
}

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