Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 93.9% → 100.0%

Time: 6.4s

Alternatives: 3

Speedup: 1.0×

• 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: 93.9% 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, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.3%

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

   1. pow2 95.3%

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

   2. metadata-eval 95.3%

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

   3. metadata-eval 95.3%

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

   4. pow-pow 68.7%

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

   5. metadata-eval 68.7%

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

4. Applied egg-rr 68.7%

   \[\leadsto x \cdot x - \color{blue}{{\left({y}^{6}\right)}^{0.3333333333333333}} \]
5. Step-by-step derivation

   1. unpow1/3 69.2%

      \[\leadsto x \cdot x - \color{blue}{\sqrt[3]{{y}^{6}}} \]

6. Simplified 69.2%

   \[\leadsto x \cdot x - \color{blue}{\sqrt[3]{{y}^{6}}} \]
7. Step-by-step derivation

   1. pow1/3 68.7%

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

   2. pow-pow 95.3%

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

   3. metadata-eval 95.3%

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

   4. unpow2 95.3%

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

   5. difference-of-squares 100.0%

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

   6. +-commutative 100.0%

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

8. Applied egg-rr 100.0%

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

Alternative 2: 78.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= (* x x) 0.2) (* y (- y)) (* x x)))

C

double code(double x, double y) {
	double tmp;
	if ((x * x) <= 0.2) {
		tmp = y * -y;
	} else {
		tmp = x * 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 * x) <= 0.2d0) then
        tmp = y * -y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (x * x) <= 0.2:
		tmp = y * -y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(x * x) <= 0.2)
		tmp = Float64(y * Float64(-y));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x * x) <= 0.2)
		tmp = y * -y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 0.20000000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 87.6%

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

      1. neg-mul-1 87.6%

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

   5. Simplified 87.6%

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

      1. unpow2 87.6%

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

      2. distribute-lft-neg-in 87.6%

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

   7. Applied egg-rr 87.6%

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

   if 0.20000000000000001 < (*.f64 x x)

   1. Initial program 89.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 42.6%

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

      4. sqrt-unprod 88.7%

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

      5. sqr-neg 88.7%

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

      6. sqrt-prod 49.6%

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

      7. add-sqr-sqrt 84.4%

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

   4. Applied egg-rr 84.4%

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

   5. Taylor expanded in x around inf 89.0%

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

   6. Taylor expanded in x around inf 84.4%

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

4. Final simplification 86.1%

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

Alternative 3: 53.6% 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 95.3%

   \[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.4%

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

   4. sqrt-unprod 72.3%

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

   5. sqr-neg 72.3%

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

   6. sqrt-prod 29.3%

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

   7. add-sqr-sqrt 50.4%

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

4. Applied egg-rr 50.4%

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

5. Taylor expanded in x around inf 53.5%

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

6. Taylor expanded in x around inf 51.1%

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

Reproduce

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