Average Error: 0.0 → 0.0
Time: 2.6s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(x + y\right) \cdot \left(2 \cdot x\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(x + y\right) \cdot \left(2 \cdot x\right)
double f(double x, double y) {
        double r445505 = 2.0;
        double r445506 = x;
        double r445507 = r445506 * r445506;
        double r445508 = y;
        double r445509 = r445506 * r445508;
        double r445510 = r445507 + r445509;
        double r445511 = r445505 * r445510;
        return r445511;
}
↓
double f(double x, double y) {
        double r445512 = x;
        double r445513 = y;
        double r445514 = r445512 + r445513;
        double r445515 = 2.0;
        double r445516 = r445515 * r445512;
        double r445517 = r445514 * r445516;
        return r445517;
}

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

  3. Final simplification0.0

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

Reproduce

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

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

  (* 2.0 (+ (* x x) (* x y))))