Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r2161800 = x;
        double r2161801 = y;
        double r2161802 = r2161800 + r2161801;
        double r2161803 = z;
        double r2161804 = 1.0;
        double r2161805 = r2161803 + r2161804;
        double r2161806 = r2161802 * r2161805;
        return r2161806;
}
↓
double f(double x, double y, double z) {
        double r2161807 = y;
        double r2161808 = x;
        double r2161809 = r2161807 + r2161808;
        double r2161810 = 1.0;
        double r2161811 = r2161809 * r2161810;
        double r2161812 = z;
        double r2161813 = r2161809 * r2161812;
        double r2161814 = r2161811 + r2161813;
        return r2161814;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{\left(x + y\right) \cdot z + \left(x + y\right) \cdot 1}\]

  4. Final simplification0.0

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

Reproduce

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