Average Error: 0.0 → 0.0
Time: 391.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 r25883 = x;
        double r25884 = y;
        double r25885 = r25883 + r25884;
        double r25886 = z;
        double r25887 = r25885 + r25886;
        return r25887;
}
↓
double f(double x, double y, double z) {
        double r25888 = x;
        double r25889 = y;
        double r25890 = r25888 + r25889;
        double r25891 = z;
        double r25892 = r25890 + r25891;
        return r25892;
}

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