Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 94.1% → 100.0%

Time: 5.2s

Alternatives: 5

Speedup: 0.6×

• 43.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x \cdot x - y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (* x x) (* y y)))

C

double code(double x, double y) {
	return (x * x) - (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * x) - (y * y)
end function

Java

public static double code(double x, double y) {
	return (x * x) - (y * y);
}

Python

def code(x, y):
	return (x * x) - (y * y)

Julia

function code(x, y)
	return Float64(Float64(x * x) - Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * x) - (y * y);
end

Wolfram

code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]

Initial Program: 94.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot x - y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (* x x) (* y y)))

C

double code(double x, double y) {
	return (x * x) - (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * x) - (y * y)
end function

Java

public static double code(double x, double y) {
	return (x * x) - (y * y);
}

Python

def code(x, y):
	return (x * x) - (y * y)

Julia

function code(x, y)
	return Float64(Float64(x * x) - Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * x) - (y * y);
end

Wolfram

code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+82}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;{y}^{2} \cdot \mathsf{fma}\left(x, \frac{1}{y} \cdot \frac{x}{y}, -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 5e+82)
   (- (* x x) (* y y))
   (* (pow y 2.0) (fma x (* (/ 1.0 y) (/ x y)) -1.0))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+82) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = pow(y, 2.0) * fma(x, ((1.0 / y) * (x / y)), -1.0);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e+82)
		tmp = Float64(Float64(x * x) - Float64(y * y));
	else
		tmp = Float64((y ^ 2.0) * fma(x, Float64(Float64(1.0 / y) * Float64(x / y)), -1.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e+82], N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision], N[(N[Power[y, 2.0], $MachinePrecision] * N[(x * N[(N[(1.0 / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 5.00000000000000015e82

   1. Initial program 100.0%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing

   if 5.00000000000000015e82 < (*.f64 y y)

   1. Initial program 83.5%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 83.5%

      \[\leadsto \color{blue}{{y}^{2} \cdot \left(\frac{{x}^{2}}{{y}^{2}} - 1\right)} \]
   4. Step-by-step derivation

      1. unpow2 83.5%

         \[\leadsto {y}^{2} \cdot \left(\frac{\color{blue}{x \cdot x}}{{y}^{2}} - 1\right) \]

      2. associate-/l* 90.4%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{x \cdot \frac{x}{{y}^{2}}} - 1\right) \]

      3. fmm-def 90.4%

         \[\leadsto {y}^{2} \cdot \color{blue}{\mathsf{fma}\left(x, \frac{x}{{y}^{2}}, -1\right)} \]

      4. metadata-eval 90.4%

         \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \frac{x}{{y}^{2}}, \color{blue}{-1}\right) \]

   5. Simplified 90.4%

      \[\leadsto \color{blue}{{y}^{2} \cdot \mathsf{fma}\left(x, \frac{x}{{y}^{2}}, -1\right)} \]
   6. Step-by-step derivation

      1. *-un-lft-identity 90.4%

         \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \frac{\color{blue}{1 \cdot x}}{{y}^{2}}, -1\right) \]

      2. unpow2 90.4%

         \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \frac{1 \cdot x}{\color{blue}{y \cdot y}}, -1\right) \]

      3. times-frac 100.0%

         \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \color{blue}{\frac{1}{y} \cdot \frac{x}{y}}, -1\right) \]

   7. Applied egg-rr 100.0%

      \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \color{blue}{\frac{1}{y} \cdot \frac{x}{y}}, -1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+82}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;{y}^{2} \cdot \mathsf{fma}\left(x, \frac{1}{y} \cdot \frac{x}{y}, -1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 10^{+88}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;{y}^{2} \cdot \left(-1 + \frac{\frac{x}{y}}{\frac{y}{x}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 1e+88)
   (- (* x x) (* y y))
   (* (pow y 2.0) (+ -1.0 (/ (/ x y) (/ y x))))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1e+88) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = pow(y, 2.0) * (-1.0 + ((x / y) / (y / x)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 1d+88) then
        tmp = (x * x) - (y * y)
    else
        tmp = (y ** 2.0d0) * ((-1.0d0) + ((x / y) / (y / x)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1e+88) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = Math.pow(y, 2.0) * (-1.0 + ((x / y) / (y / x)));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 1e+88:
		tmp = (x * x) - (y * y)
	else:
		tmp = math.pow(y, 2.0) * (-1.0 + ((x / y) / (y / x)))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 1e+88)
		tmp = Float64(Float64(x * x) - Float64(y * y));
	else
		tmp = Float64((y ^ 2.0) * Float64(-1.0 + Float64(Float64(x / y) / Float64(y / x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 1e+88)
		tmp = (x * x) - (y * y);
	else
		tmp = (y ^ 2.0) * (-1.0 + ((x / y) / (y / x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 1e+88], N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision], N[(N[Power[y, 2.0], $MachinePrecision] * N[(-1.0 + N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 9.99999999999999959e87

   1. Initial program 100.0%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing

   if 9.99999999999999959e87 < (*.f64 y y)

   1. Initial program 83.3%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 83.3%

      \[\leadsto \color{blue}{{y}^{2} \cdot \left(\frac{{x}^{2}}{{y}^{2}} - 1\right)} \]
   4. Step-by-step derivation

      1. unpow2 83.3%

         \[\leadsto {y}^{2} \cdot \left(\frac{\color{blue}{x \cdot x}}{{y}^{2}} - 1\right) \]

      2. associate-/l* 90.4%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{x \cdot \frac{x}{{y}^{2}}} - 1\right) \]

      3. fmm-def 90.4%

         \[\leadsto {y}^{2} \cdot \color{blue}{\mathsf{fma}\left(x, \frac{x}{{y}^{2}}, -1\right)} \]

      4. metadata-eval 90.4%

         \[\leadsto {y}^{2} \cdot \mathsf{fma}\left(x, \frac{x}{{y}^{2}}, \color{blue}{-1}\right) \]

   5. Simplified 90.4%

      \[\leadsto \color{blue}{{y}^{2} \cdot \mathsf{fma}\left(x, \frac{x}{{y}^{2}}, -1\right)} \]
   6. Step-by-step derivation

      1. fma-undefine 90.4%

         \[\leadsto {y}^{2} \cdot \color{blue}{\left(x \cdot \frac{x}{{y}^{2}} + -1\right)} \]

      2. div-inv 90.4%

         \[\leadsto {y}^{2} \cdot \left(x \cdot \color{blue}{\left(x \cdot \frac{1}{{y}^{2}}\right)} + -1\right) \]

      3. associate-*r* 83.3%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \frac{1}{{y}^{2}}} + -1\right) \]

      4. pow2 83.3%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{{x}^{2}} \cdot \frac{1}{{y}^{2}} + -1\right) \]

      5. pow-flip 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot \color{blue}{{y}^{\left(-2\right)}} + -1\right) \]

      6. metadata-eval 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot {y}^{\color{blue}{-2}} + -1\right) \]

   7. Applied egg-rr 83.3%

      \[\leadsto {y}^{2} \cdot \color{blue}{\left({x}^{2} \cdot {y}^{-2} + -1\right)} \]
   8. Step-by-step derivation

      1. metadata-eval 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot {y}^{\color{blue}{\left(2 \cdot -1\right)}} + -1\right) \]

      2. pow-sqr 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot \color{blue}{\left({y}^{-1} \cdot {y}^{-1}\right)} + -1\right) \]

      3. inv-pow 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot \left(\color{blue}{\frac{1}{y}} \cdot {y}^{-1}\right) + -1\right) \]

      4. inv-pow 83.3%

         \[\leadsto {y}^{2} \cdot \left({x}^{2} \cdot \left(\frac{1}{y} \cdot \color{blue}{\frac{1}{y}}\right) + -1\right) \]

      5. unpow2 83.3%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{\left(x \cdot x\right)} \cdot \left(\frac{1}{y} \cdot \frac{1}{y}\right) + -1\right) \]

      6. swap-sqr 100.0%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{\left(x \cdot \frac{1}{y}\right) \cdot \left(x \cdot \frac{1}{y}\right)} + -1\right) \]

      7. div-inv 100.0%

         \[\leadsto {y}^{2} \cdot \left(\color{blue}{\frac{x}{y}} \cdot \left(x \cdot \frac{1}{y}\right) + -1\right) \]

      8. div-inv 100.0%

         \[\leadsto {y}^{2} \cdot \left(\frac{x}{y} \cdot \color{blue}{\frac{x}{y}} + -1\right) \]

      9. clear-num 100.0%

         \[\leadsto {y}^{2} \cdot \left(\frac{x}{y} \cdot \color{blue}{\frac{1}{\frac{y}{x}}} + -1\right) \]

      10. un-div-inv 100.0%

          \[\leadsto {y}^{2} \cdot \left(\color{blue}{\frac{\frac{x}{y}}{\frac{y}{x}}} + -1\right) \]

   9. Applied egg-rr 100.0%

      \[\leadsto {y}^{2} \cdot \left(\color{blue}{\frac{\frac{x}{y}}{\frac{y}{x}}} + -1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 10^{+88}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;{y}^{2} \cdot \left(-1 + \frac{\frac{x}{y}}{\frac{y}{x}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 10^{+199}:\\ \;\;\;\;\mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y + x\right) \cdot \left(y + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x 1e+199) (fma x x (* y (- y))) (* (+ y x) (+ y x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= 1e+199) {
		tmp = fma(x, x, (y * -y));
	} else {
		tmp = (y + x) * (y + x);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= 1e+199)
		tmp = fma(x, x, Float64(y * Float64(-y)));
	else
		tmp = Float64(Float64(y + x) * Float64(y + x));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, 1e+199], N[(x * x + N[(y * (-y)), $MachinePrecision]), $MachinePrecision], N[(N[(y + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.0000000000000001e199

   1. Initial program 93.9%

      \[x \cdot x - y \cdot y \]
   2. Step-by-step derivation

      1. sqr-neg 93.9%

         \[\leadsto x \cdot x - \color{blue}{\left(-y\right) \cdot \left(-y\right)} \]

      2. cancel-sign-sub 93.9%

         \[\leadsto \color{blue}{x \cdot x + y \cdot \left(-y\right)} \]

      3. fma-define 96.9%

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right)} \]

   3. Simplified 96.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right)} \]
   4. Add Preprocessing

   if 1.0000000000000001e199 < x

   1. Initial program 81.5%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x - y\right)} \]

      2. sub-neg 100.0%

         \[\leadsto \left(x + y\right) \cdot \color{blue}{\left(x + \left(-y\right)\right)} \]

      3. add-sqr-sqrt 59.3%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{-y} \cdot \sqrt{-y}}\right) \]

      4. sqrt-unprod 100.0%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{\left(-y\right) \cdot \left(-y\right)}}\right) \]

      5. sqr-neg 100.0%

         \[\leadsto \left(x + y\right) \cdot \left(x + \sqrt{\color{blue}{y \cdot y}}\right) \]

      6. sqrt-prod 40.7%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{y} \cdot \sqrt{y}}\right) \]

      7. add-sqr-sqrt 96.3%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{y}\right) \]

   4. Applied egg-rr 96.3%

      \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x + y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 10^{+199}:\\ \;\;\;\;\mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y + x\right) \cdot \left(y + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 95.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 10^{+149}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(y + x\right) \cdot \left(y + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x 1e+149) (- (* x x) (* y y)) (* (+ y x) (+ y x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= 1e+149) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = (y + x) * (y + x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= 1d+149) then
        tmp = (x * x) - (y * y)
    else
        tmp = (y + x) * (y + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= 1e+149) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = (y + x) * (y + x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= 1e+149:
		tmp = (x * x) - (y * y)
	else:
		tmp = (y + x) * (y + x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= 1e+149)
		tmp = Float64(Float64(x * x) - Float64(y * y));
	else
		tmp = Float64(Float64(y + x) * Float64(y + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 1e+149)
		tmp = (x * x) - (y * y);
	else
		tmp = (y + x) * (y + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, 1e+149], N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision], N[(N[(y + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.00000000000000005e149

   1. Initial program 95.4%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing

   if 1.00000000000000005e149 < x

   1. Initial program 75.7%

      \[x \cdot x - y \cdot y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x - y\right)} \]

      2. sub-neg 100.0%

         \[\leadsto \left(x + y\right) \cdot \color{blue}{\left(x + \left(-y\right)\right)} \]

      3. add-sqr-sqrt 64.9%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{-y} \cdot \sqrt{-y}}\right) \]

      4. sqrt-unprod 97.3%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{\left(-y\right) \cdot \left(-y\right)}}\right) \]

      5. sqr-neg 97.3%

         \[\leadsto \left(x + y\right) \cdot \left(x + \sqrt{\color{blue}{y \cdot y}}\right) \]

      6. sqrt-prod 32.4%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{y} \cdot \sqrt{y}}\right) \]

      7. add-sqr-sqrt 89.2%

         \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{y}\right) \]

   4. Applied egg-rr 89.2%

      \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x + y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 10^{+149}:\\ \;\;\;\;x \cdot x - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(y + x\right) \cdot \left(y + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 53.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(y + x\right) \cdot \left(y + x\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (+ y x) (+ y x)))

C

double code(double x, double y) {
	return (y + x) * (y + x);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (y + x) * (y + x)
end function

Java

public static double code(double x, double y) {
	return (y + x) * (y + x);
}

Python

def code(x, y):
	return (y + x) * (y + x)

Julia

function code(x, y)
	return Float64(Float64(y + x) * Float64(y + x))
end

MATLAB

function tmp = code(x, y)
	tmp = (y + x) * (y + x);
end

Wolfram

code[x_, y_] := N[(N[(y + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.6%

   \[x \cdot x - y \cdot y \]
2. Add Preprocessing
3. Step-by-step derivation

   1. difference-of-squares 100.0%

      \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x - y\right)} \]

   2. sub-neg 100.0%

      \[\leadsto \left(x + y\right) \cdot \color{blue}{\left(x + \left(-y\right)\right)} \]

   3. add-sqr-sqrt 49.9%

      \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{-y} \cdot \sqrt{-y}}\right) \]

   4. sqrt-unprod 73.1%

      \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{\left(-y\right) \cdot \left(-y\right)}}\right) \]

   5. sqr-neg 73.1%

      \[\leadsto \left(x + y\right) \cdot \left(x + \sqrt{\color{blue}{y \cdot y}}\right) \]

   6. sqrt-prod 25.5%

      \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{\sqrt{y} \cdot \sqrt{y}}\right) \]

   7. add-sqr-sqrt 54.1%

      \[\leadsto \left(x + y\right) \cdot \left(x + \color{blue}{y}\right) \]

4. Applied egg-rr 54.1%

   \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x + y\right)} \]

5. Final simplification 54.1%

   \[\leadsto \left(y + x\right) \cdot \left(y + x\right) \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024115 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))