Average Error: 0.0 → 0.0
Time: 6.6s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r41796 = x;
        double r41797 = y;
        double r41798 = r41796 + r41797;
        double r41799 = z;
        double r41800 = 1.0;
        double r41801 = r41799 + r41800;
        double r41802 = r41798 * r41801;
        return r41802;
}
↓
double f(double x, double y, double z) {
        double r41803 = x;
        double r41804 = y;
        double r41805 = r41803 + r41804;
        double r41806 = 1.0;
        double r41807 = r41805 * r41806;
        double r41808 = z;
        double r41809 = r41805 * r41808;
        double r41810 = r41807 + r41809;
        return r41810;
}

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 \color{blue}{z \cdot \left(x + y\right)} + \left(x + y\right) \cdot 1\]

  5. Final simplification0.0

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

Reproduce

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