Average Error: 0.0 → 0.0
Time: 376.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 r17817 = x;
        double r17818 = y;
        double r17819 = r17817 + r17818;
        double r17820 = z;
        double r17821 = r17819 + r17820;
        return r17821;
}
↓
double f(double x, double y, double z) {
        double r17822 = x;
        double r17823 = y;
        double r17824 = r17822 + r17823;
        double r17825 = z;
        double r17826 = r17824 + r17825;
        return r17826;
}

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