Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
2 \cdot \left(x \cdot x + x \cdot y\right)
double f(double x, double y) {
        double r496110 = 2.0;
        double r496111 = x;
        double r496112 = r496111 * r496111;
        double r496113 = y;
        double r496114 = r496111 * r496113;
        double r496115 = r496112 + r496114;
        double r496116 = r496110 * r496115;
        return r496116;
}
↓
double f(double x, double y) {
        double r496117 = 2.0;
        double r496118 = x;
        double r496119 = r496118 * r496118;
        double r496120 = y;
        double r496121 = r496118 * r496120;
        double r496122 = r496119 + r496121;
        double r496123 = r496117 * r496122;
        return r496123;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2020081 
(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))))