Average Error: 0.0 → 0.0
Time: 5.8s
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 r25065628 = 2.0;
        double r25065629 = x;
        double r25065630 = r25065629 * r25065629;
        double r25065631 = y;
        double r25065632 = r25065629 * r25065631;
        double r25065633 = r25065630 + r25065632;
        double r25065634 = r25065628 * r25065633;
        return r25065634;
}

double f(double x, double y) {
        double r25065635 = 2.0;
        double r25065636 = x;
        double r25065637 = r25065635 * r25065636;
        double r25065638 = y;
        double r25065639 = r25065638 + r25065636;
        double r25065640 = r25065637 * r25065639;
        return r25065640;
}

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))))