Average Error: 0.0 → 0.0
Time: 10.8s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r2330646 = x;
        double r2330647 = y;
        double r2330648 = r2330646 + r2330647;
        double r2330649 = z;
        double r2330650 = 1.0;
        double r2330651 = r2330649 + r2330650;
        double r2330652 = r2330648 * r2330651;
        return r2330652;
}
↓
double f(double x, double y, double z) {
        double r2330653 = y;
        double r2330654 = x;
        double r2330655 = r2330653 + r2330654;
        double r2330656 = 1.0;
        double r2330657 = r2330655 * r2330656;
        double r2330658 = z;
        double r2330659 = r2330655 * r2330658;
        double r2330660 = r2330657 + r2330659;
        return r2330660;
}

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

  3. Applied distribute-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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