Average Error: 0.0 → 0.0
Time: 2.7s
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 r5184 = x;
        double r5185 = y;
        double r5186 = r5184 + r5185;
        double r5187 = z;
        double r5188 = 1.0;
        double r5189 = r5187 + r5188;
        double r5190 = r5186 * r5189;
        return r5190;
}
↓
double f(double x, double y, double z) {
        double r5191 = x;
        double r5192 = y;
        double r5193 = r5191 + r5192;
        double r5194 = z;
        double r5195 = r5193 * r5194;
        double r5196 = 1.0;
        double r5197 = r5196 * r5193;
        double r5198 = r5195 + r5197;
        return r5198;
}

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)))