Average Error: 0.0 → 0.0
Time: 1.1s
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 r546505 = 2.0;
        double r546506 = x;
        double r546507 = r546506 * r546506;
        double r546508 = y;
        double r546509 = r546506 * r546508;
        double r546510 = r546507 - r546509;
        double r546511 = r546505 * r546510;
        return r546511;
}
↓
double f(double x, double y) {
        double r546512 = x;
        double r546513 = y;
        double r546514 = r546512 - r546513;
        double r546515 = r546512 * r546514;
        double r546516 = 2.0;
        double r546517 = r546515 * r546516;
        return r546517;
}

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2020081 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (* (* x 2) (- x y))

  (* 2 (- (* x x) (* x y))))