Average Error: 0.0 → 0.0
Time: 12.8s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
\[y \cdot y + \left(2 + x\right) \cdot x\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
y \cdot y + \left(2 + x\right) \cdot x
double f(double x, double y) {
        double r6986142 = x;
        double r6986143 = 2.0;
        double r6986144 = r6986142 * r6986143;
        double r6986145 = r6986142 * r6986142;
        double r6986146 = r6986144 + r6986145;
        double r6986147 = y;
        double r6986148 = r6986147 * r6986147;
        double r6986149 = r6986146 + r6986148;
        return r6986149;
}

double f(double x, double y) {
        double r6986150 = y;
        double r6986151 = r6986150 * r6986150;
        double r6986152 = 2.0;
        double r6986153 = x;
        double r6986154 = r6986152 + r6986153;
        double r6986155 = r6986154 * r6986153;
        double r6986156 = r6986151 + r6986155;
        return r6986156;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y \cdot y + x \cdot \left(2 + x\right)}\]
  3. Final simplification0.0

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

Reproduce

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