Average Error: 0.0 → 0.0
Time: 7.2s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[\left(y + x\right) \cdot \left(y + x\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
\left(y + x\right) \cdot \left(y + x\right)
double f(double x, double y) {
        double r25350641 = x;
        double r25350642 = y;
        double r25350643 = r25350641 + r25350642;
        double r25350644 = r25350643 * r25350643;
        return r25350644;
}
↓
double f(double x, double y) {
        double r25350645 = y;
        double r25350646 = x;
        double r25350647 = r25350645 + r25350646;
        double r25350648 = r25350647 * r25350647;
        return r25350648;
}

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

Reproduce

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

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

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