Average Error: 0.0 → 0.0
Time: 1.7s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(x \cdot \left(x + y\right)\right) \cdot 2\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(x \cdot \left(x + y\right)\right) \cdot 2
double f(double x, double y) {
        double r563657 = 2.0;
        double r563658 = x;
        double r563659 = r563658 * r563658;
        double r563660 = y;
        double r563661 = r563658 * r563660;
        double r563662 = r563659 + r563661;
        double r563663 = r563657 * r563662;
        return r563663;
}
↓
double f(double x, double y) {
        double r563664 = x;
        double r563665 = y;
        double r563666 = r563664 + r563665;
        double r563667 = r563664 * r563666;
        double r563668 = 2.0;
        double r563669 = r563667 * r563668;
        return r563669;
}

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
\[\left(x \cdot 2\right) \cdot \left(x + y\right)\]

Derivation

  1. Initial program 0.0

    \[2 \cdot \left(x \cdot x + x \cdot y\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(x \cdot \left(x + y\right)\right) \cdot 2}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2020047 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, B"
  :precision binary64

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

  (* 2 (+ (* x x) (* x y))))