Average Error: 0.0 → 0.0
Time: 402.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 r26592 = x;
        double r26593 = y;
        double r26594 = r26592 + r26593;
        double r26595 = z;
        double r26596 = r26594 + r26595;
        return r26596;
}
↓
double f(double x, double y, double z) {
        double r26597 = x;
        double r26598 = y;
        double r26599 = r26597 + r26598;
        double r26600 = z;
        double r26601 = r26599 + r26600;
        return r26601;
}

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