Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[\left(x + y\right) + z\]
\[z + \left(y + x\right)\]
\left(x + y\right) + z
z + \left(y + x\right)
double f(double x, double y, double z) {
        double r1121595 = x;
        double r1121596 = y;
        double r1121597 = r1121595 + r1121596;
        double r1121598 = z;
        double r1121599 = r1121597 + r1121598;
        return r1121599;
}

double f(double x, double y, double z) {
        double r1121600 = z;
        double r1121601 = y;
        double r1121602 = x;
        double r1121603 = r1121601 + r1121602;
        double r1121604 = r1121600 + r1121603;
        return r1121604;
}

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 z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019179 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))