Average Error: 0.0 → 0.0
Time: 898.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 r47773 = x;
        double r47774 = y;
        double r47775 = r47773 + r47774;
        double r47776 = z;
        double r47777 = r47775 + r47776;
        return r47777;
}
↓
double f(double x, double y, double z) {
        double r47778 = x;
        double r47779 = y;
        double r47780 = r47778 + r47779;
        double r47781 = z;
        double r47782 = r47780 + r47781;
        return r47782;
}

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