Average Error: 0.0 → 0.0
Time: 12.3s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1.0\right)\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot \left(z + 1.0\right)
double f(double x, double y, double z) {
        double r2699401 = x;
        double r2699402 = y;
        double r2699403 = r2699401 + r2699402;
        double r2699404 = z;
        double r2699405 = 1.0;
        double r2699406 = r2699404 + r2699405;
        double r2699407 = r2699403 * r2699406;
        return r2699407;
}
↓
double f(double x, double y, double z) {
        double r2699408 = y;
        double r2699409 = x;
        double r2699410 = r2699408 + r2699409;
        double r2699411 = z;
        double r2699412 = 1.0;
        double r2699413 = r2699411 + r2699412;
        double r2699414 = r2699410 * r2699413;
        return r2699414;
}

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

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1.0\right)\]

Reproduce

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