Average Error: 0.0 → 0.0
Time: 2.9s
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 r411263 = 2.0;
        double r411264 = x;
        double r411265 = r411264 * r411264;
        double r411266 = y;
        double r411267 = r411264 * r411266;
        double r411268 = r411265 + r411267;
        double r411269 = r411263 * r411268;
        return r411269;
}

double f(double x, double y) {
        double r411270 = x;
        double r411271 = y;
        double r411272 = r411270 + r411271;
        double r411273 = r411270 * r411272;
        double r411274 = 2.0;
        double r411275 = r411273 * r411274;
        return r411275;
}

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

Reproduce

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