Average Error: 0.0 → 0.0
Time: 6.6s
Precision: 64
\[2.0 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(2.0 \cdot x\right) \cdot \left(y + x\right)\]
2.0 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(2.0 \cdot x\right) \cdot \left(y + x\right)
double f(double x, double y) {
        double r18184204 = 2.0;
        double r18184205 = x;
        double r18184206 = r18184205 * r18184205;
        double r18184207 = y;
        double r18184208 = r18184205 * r18184207;
        double r18184209 = r18184206 + r18184208;
        double r18184210 = r18184204 * r18184209;
        return r18184210;
}
↓
double f(double x, double y) {
        double r18184211 = 2.0;
        double r18184212 = x;
        double r18184213 = r18184211 * r18184212;
        double r18184214 = y;
        double r18184215 = r18184214 + r18184212;
        double r18184216 = r18184213 * r18184215;
        return r18184216;
}

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

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(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))))