Average Error: 0.0 → 0.0
Time: 475.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 r32785 = x;
        double r32786 = y;
        double r32787 = r32785 + r32786;
        double r32788 = z;
        double r32789 = r32787 + r32788;
        return r32789;
}
↓
double f(double x, double y, double z) {
        double r32790 = x;
        double r32791 = y;
        double r32792 = r32790 + r32791;
        double r32793 = z;
        double r32794 = r32792 + r32793;
        return r32794;
}

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