Average Error: 0.0 → 0.0
Time: 32.5s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[1 \cdot x + x \cdot y\]
x \cdot \left(y + 1\right)
↓
1 \cdot x + x \cdot y
double f(double x, double y) {
        double r38251947 = x;
        double r38251948 = y;
        double r38251949 = 1.0;
        double r38251950 = r38251948 + r38251949;
        double r38251951 = r38251947 * r38251950;
        return r38251951;
}
↓
double f(double x, double y) {
        double r38251952 = 1.0;
        double r38251953 = x;
        double r38251954 = r38251952 * r38251953;
        double r38251955 = y;
        double r38251956 = r38251953 * r38251955;
        double r38251957 = r38251954 + r38251956;
        return r38251957;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x + x \cdot y\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + 1\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{y \cdot x + 1 \cdot x}\]

  4. Final simplification0.0

    \[\leadsto 1 \cdot x + x \cdot y\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"

  :herbie-target
  (+ x (* x y))

  (* x (+ y 1.0)))