Average Error: 0.0 → 0.0
Time: 2.8s
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 r35111 = x;
        double r35112 = y;
        double r35113 = r35111 + r35112;
        double r35114 = z;
        double r35115 = 1.0;
        double r35116 = r35114 + r35115;
        double r35117 = r35113 * r35116;
        return r35117;
}
↓
double f(double x, double y, double z) {
        double r35118 = x;
        double r35119 = y;
        double r35120 = r35118 + r35119;
        double r35121 = z;
        double r35122 = r35120 * r35121;
        double r35123 = 1.0;
        double r35124 = r35123 * r35120;
        double r35125 = r35122 + r35124;
        return r35125;
}

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