Average Error: 0.0 → 0.0
Time: 10.0s
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 r47784 = x;
        double r47785 = y;
        double r47786 = r47784 + r47785;
        double r47787 = z;
        double r47788 = 1.0;
        double r47789 = r47787 + r47788;
        double r47790 = r47786 * r47789;
        return r47790;
}
↓
double f(double x, double y, double z) {
        double r47791 = x;
        double r47792 = y;
        double r47793 = r47791 + r47792;
        double r47794 = z;
        double r47795 = r47793 * r47794;
        double r47796 = 1.0;
        double r47797 = r47796 * r47793;
        double r47798 = r47795 + r47797;
        return r47798;
}

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