Average Error: 0.0 → 0.0
Time: 791.0ms
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 r1642153 = x;
        double r1642154 = y;
        double r1642155 = r1642153 + r1642154;
        double r1642156 = z;
        double r1642157 = r1642155 + r1642156;
        return r1642157;
}

double f(double x, double y, double z) {
        double r1642158 = z;
        double r1642159 = y;
        double r1642160 = x;
        double r1642161 = r1642159 + r1642160;
        double r1642162 = r1642158 + r1642161;
        return r1642162;
}

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