Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 94.2% → 97.1%

Time: 4.8s

Alternatives: 4

Speedup: 0.5×

• 43.0% 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.2% 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: 97.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.4%

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

   1. sqr-neg 93.4%

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

   2. cancel-sign-sub 93.4%

      \[\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
5. Add Preprocessing

Alternative 2: 74.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-58} \lor \neg \left(y \cdot y \leq 2 \cdot 10^{+65}\right) \land y \cdot y \leq 2 \cdot 10^{+238}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= (* y y) 5e-58) (and (not (<= (* y y) 2e+65)) (<= (* y y) 2e+238)))
   (* x x)
   (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if (((y * y) <= 5e-58) || (!((y * y) <= 2e+65) && ((y * y) <= 2e+238))) {
		tmp = x * x;
	} else {
		tmp = y * -y;
	}
	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) <= 5d-58) .or. (.not. ((y * y) <= 2d+65)) .and. ((y * y) <= 2d+238)) then
        tmp = x * x
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (((y * y) <= 5e-58) || (!((y * y) <= 2e+65) && ((y * y) <= 2e+238))) {
		tmp = x * x;
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((y * y) <= 5e-58) or (not ((y * y) <= 2e+65) and ((y * y) <= 2e+238)):
		tmp = x * x
	else:
		tmp = y * -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((Float64(y * y) <= 5e-58) || (!(Float64(y * y) <= 2e+65) && (Float64(y * y) <= 2e+238)))
		tmp = Float64(x * x);
	else
		tmp = Float64(y * Float64(-y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((y * y) <= 5e-58) || (~(((y * y) <= 2e+65)) && ((y * y) <= 2e+238)))
		tmp = x * x;
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[N[(y * y), $MachinePrecision], 5e-58], And[N[Not[LessEqual[N[(y * y), $MachinePrecision], 2e+65]], $MachinePrecision], LessEqual[N[(y * y), $MachinePrecision], 2e+238]]], N[(x * x), $MachinePrecision], N[(y * (-y)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 4.99999999999999977e-58 or 2e65 < (*.f64 y y) < 2.0000000000000001e238

   1. Initial program 100.0%

      \[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 45.8%

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

      4. sqrt-unprod 89.4%

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

      5. sqr-neg 89.4%

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

      6. sqrt-prod 43.5%

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

      7. add-sqr-sqrt 80.7%

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

   4. Applied egg-rr 80.7%

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

   5. Taylor expanded in x around inf 81.1%

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

   6. Taylor expanded in x around inf 81.3%

      \[\leadsto \color{blue}{x} \cdot x \]

   if 4.99999999999999977e-58 < (*.f64 y y) < 2e65 or 2.0000000000000001e238 < (*.f64 y y)

   1. Initial program 86.2%

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

   3. Taylor expanded in x around 0 83.4%

      \[\leadsto \color{blue}{-1 \cdot {y}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 83.4%

         \[\leadsto \color{blue}{-{y}^{2}} \]

   5. Simplified 83.4%

      \[\leadsto \color{blue}{-{y}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 83.4%

         \[\leadsto -\color{blue}{y \cdot y} \]

      2. distribute-lft-neg-in 83.4%

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

   7. Applied egg-rr 83.4%

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

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-58} \lor \neg \left(y \cdot y \leq 2 \cdot 10^{+65}\right) \land y \cdot y \leq 2 \cdot 10^{+238}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.0% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 4e+304) (- (* x x) (* y y)) (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 4e+304) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = y * -y;
	}
	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) <= 4d+304) then
        tmp = (x * x) - (y * y)
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 3.9999999999999998e304

   1. Initial program 100.0%

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

   if 3.9999999999999998e304 < (*.f64 y y)

   1. Initial program 76.4%

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

   3. Taylor expanded in x around 0 88.9%

      \[\leadsto \color{blue}{-1 \cdot {y}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 88.9%

         \[\leadsto \color{blue}{-{y}^{2}} \]

   5. Simplified 88.9%

      \[\leadsto \color{blue}{-{y}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 88.9%

         \[\leadsto -\color{blue}{y \cdot y} \]

      2. distribute-lft-neg-in 88.9%

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

   7. Applied egg-rr 88.9%

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

4. Final simplification 96.9%

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

Alternative 4: 53.9% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.4%

   \[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 45.6%

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

   4. sqrt-unprod 71.0%

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

   5. sqr-neg 71.0%

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

   6. sqrt-prod 27.2%

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

   7. add-sqr-sqrt 49.7%

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

4. Applied egg-rr 49.7%

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

5. Taylor expanded in x around inf 54.2%

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

6. Taylor expanded in x around inf 50.6%

   \[\leadsto \color{blue}{x} \cdot x \]
7. Add Preprocessing

Reproduce

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