Average Error: 0.0 → 0.0
Time: 2.9s
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 r655305 = x;
        double r655306 = y;
        double r655307 = r655305 + r655306;
        double r655308 = r655307 * r655307;
        return r655308;
}
↓
double f(double x, double y) {
        double r655309 = x;
        double r655310 = y;
        double r655311 = r655309 + r655310;
        double r655312 = r655311 * r655311;
        return r655312;
}

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