Average Error: 0.0 → 0.0
Time: 681.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 r38654 = x;
        double r38655 = y;
        double r38656 = r38654 + r38655;
        double r38657 = z;
        double r38658 = r38656 + r38657;
        return r38658;
}
↓
double f(double x, double y, double z) {
        double r38659 = x;
        double r38660 = y;
        double r38661 = r38659 + r38660;
        double r38662 = z;
        double r38663 = r38661 + r38662;
        return r38663;
}

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