Average Error: 0.0 → 0.0
Time: 15.0s
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 r1478830 = x;
        double r1478831 = y;
        double r1478832 = r1478830 + r1478831;
        double r1478833 = z;
        double r1478834 = 1.0;
        double r1478835 = r1478833 + r1478834;
        double r1478836 = r1478832 * r1478835;
        return r1478836;
}
↓
double f(double x, double y, double z) {
        double r1478837 = y;
        double r1478838 = x;
        double r1478839 = r1478837 + r1478838;
        double r1478840 = z;
        double r1478841 = 1.0;
        double r1478842 = r1478840 + r1478841;
        double r1478843 = r1478839 * r1478842;
        return r1478843;
}

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 2019165 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))