Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 93.5% → 98.2%

Time: 3.8s

Alternatives: 4

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: 93.5% 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: 98.2% accurate, 0.1× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= x_m 1.2e+196) (fma x_m x_m (* y (- y))) (* (+ x_m y) (+ x_m y))))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if (x_m <= 1.2e+196) {
		tmp = fma(x_m, x_m, (y * -y));
	} else {
		tmp = (x_m + y) * (x_m + y);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (x_m <= 1.2e+196)
		tmp = fma(x_m, x_m, Float64(y * Float64(-y)));
	else
		tmp = Float64(Float64(x_m + y) * Float64(x_m + y));
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[x$95$m, 1.2e+196], N[(x$95$m * x$95$m + N[(y * (-y)), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m + y), $MachinePrecision] * N[(x$95$m + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.2e196

   1. Initial program 95.3%

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

      1. sqr-neg 95.3%

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

      2. cancel-sign-sub 95.3%

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

      3. fma-define 97.4%

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

   3. Simplified 97.4%

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

   if 1.2e196 < x

   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 39.1%

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

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

      7. add-sqr-sqrt 100.0%

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

   4. Applied egg-rr 100.0%

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

Alternative 2: 77.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 2 \cdot 10^{-84}:\\ \;\;\;\;\left(x\_m + y\right) \cdot \left(x\_m + y\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= (* y y) 2e-84) (* (+ x_m y) (+ x_m y)) (* y (- y))))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if ((y * y) <= 2e-84) {
		tmp = (x_m + y) * (x_m + y);
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 2d-84) then
        tmp = (x_m + y) * (x_m + y)
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	double tmp;
	if ((y * y) <= 2e-84) {
		tmp = (x_m + y) * (x_m + y);
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	tmp = 0
	if (y * y) <= 2e-84:
		tmp = (x_m + y) * (x_m + y)
	else:
		tmp = y * -y
	return tmp

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (Float64(y * y) <= 2e-84)
		tmp = Float64(Float64(x_m + y) * Float64(x_m + y));
	else
		tmp = Float64(y * Float64(-y));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y)
	tmp = 0.0;
	if ((y * y) <= 2e-84)
		tmp = (x_m + y) * (x_m + y);
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 2e-84], N[(N[(x$95$m + y), $MachinePrecision] * N[(x$95$m + y), $MachinePrecision]), $MachinePrecision], N[(y * (-y)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 2.0000000000000001e-84

   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 44.7%

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

      4. sqrt-unprod 98.3%

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

      5. sqr-neg 98.3%

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

      6. sqrt-prod 53.5%

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

      7. add-sqr-sqrt 96.8%

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

   4. Applied egg-rr 96.8%

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

   if 2.0000000000000001e-84 < (*.f64 y y)

   1. Initial program 92.3%

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

   3. Taylor expanded in x around 0 78.7%

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

      1. mul-1-neg 78.7%

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

   5. Simplified 78.7%

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

      1. unpow2 78.7%

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

   7. Applied egg-rr 78.7%

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

4. Final simplification 86.8%

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

Alternative 3: 97.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1.35 \cdot 10^{+154}:\\ \;\;\;\;x\_m \cdot x\_m - y \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(x\_m + y\right) \cdot \left(x\_m + y\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= x_m 1.35e+154) (- (* x_m x_m) (* y y)) (* (+ x_m y) (+ x_m y))))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if (x_m <= 1.35e+154) {
		tmp = (x_m * x_m) - (y * y);
	} else {
		tmp = (x_m + y) * (x_m + y);
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x_m <= 1.35d+154) then
        tmp = (x_m * x_m) - (y * y)
    else
        tmp = (x_m + y) * (x_m + y)
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	double tmp;
	if (x_m <= 1.35e+154) {
		tmp = (x_m * x_m) - (y * y);
	} else {
		tmp = (x_m + y) * (x_m + y);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	tmp = 0
	if x_m <= 1.35e+154:
		tmp = (x_m * x_m) - (y * y)
	else:
		tmp = (x_m + y) * (x_m + y)
	return tmp

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (x_m <= 1.35e+154)
		tmp = Float64(Float64(x_m * x_m) - Float64(y * y));
	else
		tmp = Float64(Float64(x_m + y) * Float64(x_m + y));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y)
	tmp = 0.0;
	if (x_m <= 1.35e+154)
		tmp = (x_m * x_m) - (y * y);
	else
		tmp = (x_m + y) * (x_m + y);
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[x$95$m, 1.35e+154], N[(N[(x$95$m * x$95$m), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m + y), $MachinePrecision] * N[(x$95$m + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.35000000000000003e154

   1. Initial program 95.7%

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

   if 1.35000000000000003e154 < x

   1. Initial program 96.2%

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

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

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

      7. add-sqr-sqrt 96.2%

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

   4. Applied egg-rr 96.2%

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

Alternative 4: 53.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ y \cdot \left(-y\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (* y (- y)))

C

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

Fortran

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

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	return y * -y;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	return y * -y

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := N[(y * (-y)), $MachinePrecision]

Derivation

1. Initial program 95.7%

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

3. Taylor expanded in x around 0 51.9%

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

   1. mul-1-neg 51.9%

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

5. Simplified 51.9%

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

   1. unpow2 51.9%

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

7. Applied egg-rr 51.9%

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

8. Final simplification 51.9%

   \[\leadsto y \cdot \left(-y\right) \]
9. Add Preprocessing

Reproduce

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