Average Error: 0.0 → 0.0
Time: 5.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r33707 = x;
        double r33708 = y;
        double r33709 = r33707 + r33708;
        double r33710 = z;
        double r33711 = 1.0;
        double r33712 = r33710 + r33711;
        double r33713 = r33709 * r33712;
        return r33713;
}
↓
double f(double x, double y, double z) {
        double r33714 = x;
        double r33715 = y;
        double r33716 = r33714 + r33715;
        double r33717 = z;
        double r33718 = r33716 * r33717;
        double r33719 = 1.0;
        double r33720 = r33719 * r33716;
        double r33721 = r33718 + r33720;
        return r33721;
}

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. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

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