Average Error: 0.0 → 0.0
Time: 9.3s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(x \cdot x + x \cdot 2\right)\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(x \cdot x + x \cdot 2\right)
double f(double x, double y) {
        double r422068 = x;
        double r422069 = 2.0;
        double r422070 = r422068 * r422069;
        double r422071 = r422068 * r422068;
        double r422072 = r422070 + r422071;
        double r422073 = y;
        double r422074 = r422073 * r422073;
        double r422075 = r422072 + r422074;
        return r422075;
}
↓
double f(double x, double y) {
        double r422076 = y;
        double r422077 = r422076 * r422076;
        double r422078 = x;
        double r422079 = r422078 * r422078;
        double r422080 = 2.0;
        double r422081 = r422078 * r422080;
        double r422082 = r422079 + r422081;
        double r422083 = r422077 + r422082;
        return r422083;
}

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

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019174 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"

  :herbie-target
  (+ (* y y) (+ (* 2.0 x) (* x x)))

  (+ (+ (* x 2.0) (* x x)) (* y y)))