Average Error: 0.0 → 0.0
Time: 374.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 r23330 = x;
        double r23331 = y;
        double r23332 = r23330 + r23331;
        double r23333 = z;
        double r23334 = r23332 + r23333;
        return r23334;
}
↓
double f(double x, double y, double z) {
        double r23335 = x;
        double r23336 = y;
        double r23337 = r23335 + r23336;
        double r23338 = z;
        double r23339 = r23337 + r23338;
        return r23339;
}

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