Average Error: 0.0 → 0.0
Time: 446.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 r38049 = x;
        double r38050 = y;
        double r38051 = r38049 + r38050;
        double r38052 = z;
        double r38053 = r38051 + r38052;
        return r38053;
}
↓
double f(double x, double y, double z) {
        double r38054 = x;
        double r38055 = y;
        double r38056 = r38054 + r38055;
        double r38057 = z;
        double r38058 = r38056 + r38057;
        return r38058;
}

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