Average Error: 0.0 → 0.0
Time: 9.0s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r1609804 = x;
        double r1609805 = y;
        double r1609806 = r1609804 + r1609805;
        double r1609807 = z;
        double r1609808 = 1.0;
        double r1609809 = r1609807 + r1609808;
        double r1609810 = r1609806 * r1609809;
        return r1609810;
}
↓
double f(double x, double y, double z) {
        double r1609811 = y;
        double r1609812 = x;
        double r1609813 = r1609811 + r1609812;
        double r1609814 = z;
        double r1609815 = 1.0;
        double r1609816 = r1609814 + r1609815;
        double r1609817 = r1609813 * r1609816;
        return r1609817;
}

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\right)\]

  2. Final simplification0.0

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

Reproduce

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