Average Error: 0.0 → 0.0
Time: 8.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 r2120710 = x;
        double r2120711 = y;
        double r2120712 = r2120710 + r2120711;
        double r2120713 = z;
        double r2120714 = 1.0;
        double r2120715 = r2120713 + r2120714;
        double r2120716 = r2120712 * r2120715;
        return r2120716;
}
↓
double f(double x, double y, double z) {
        double r2120717 = y;
        double r2120718 = x;
        double r2120719 = r2120717 + r2120718;
        double r2120720 = 1.0;
        double r2120721 = r2120719 * r2120720;
        double r2120722 = z;
        double r2120723 = r2120719 * r2120722;
        double r2120724 = r2120721 + r2120723;
        return r2120724;
}

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