Average Error: 0.0 → 0.0
Time: 9.7s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[\left(x + y\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
\left(x + y\right) \cdot \left(x + y\right)
double f(double x, double y) {
        double r713221 = x;
        double r713222 = y;
        double r713223 = r713221 + r713222;
        double r713224 = r713223 * r713223;
        return r713224;
}
↓
double f(double x, double y) {
        double r713225 = x;
        double r713226 = y;
        double r713227 = r713225 + r713226;
        double r713228 = r713227 * r713227;
        return r713228;
}

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

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020018 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f3 from sbv-4.4"
  :precision binary64

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

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