Examples.Basics.ProofTests:f4 from sbv-4.4

Percentage Accurate: 93.6% → 99.8%

Time: 2.9s

Alternatives: 5

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 93.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.1× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 9e+139) (fma y y (* x (+ x (* y 2.0)))) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 9e+139) {
		tmp = fma(y, y, (x * (x + (y * 2.0))));
	} else {
		tmp = y * y;
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 9e+139)
		tmp = fma(y, y, Float64(x * Float64(x + Float64(y * 2.0))));
	else
		tmp = Float64(y * y);
	end
	return tmp
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 9e+139], N[(y * y + N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 8.9999999999999999e139

   1. Initial program 94.4%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
   2. Step-by-step derivation

      1. +-commutative 94.4%

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

      2. fma-def 94.4%

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

      3. associate-*l* 94.4%

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

      4. distribute-lft-out 98.6%

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

   3. Applied egg-rr 98.6%

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

   if 8.9999999999999999e139 < y

   1. Initial program 86.0%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around 0 93.7%

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

      1. unpow2 93.7%

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

   4. Simplified 93.7%

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

4. Final simplification 97.8%

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

Alternative 2: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 9 \cdot 10^{+139}:\\ \;\;\;\;x \cdot \left(x + y \cdot 2\right) + y \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 9e+139) (+ (* x (+ x (* y 2.0))) (* y y)) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 9e+139) {
		tmp = (x * (x + (y * 2.0))) + (y * y);
	} else {
		tmp = y * y;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 9d+139) then
        tmp = (x * (x + (y * 2.0d0))) + (y * y)
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 9e+139) {
		tmp = (x * (x + (y * 2.0))) + (y * y);
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 9e+139:
		tmp = (x * (x + (y * 2.0))) + (y * y)
	else:
		tmp = y * y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 9e+139)
		tmp = Float64(Float64(x * Float64(x + Float64(y * 2.0))) + Float64(y * y));
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 9e+139)
		tmp = (x * (x + (y * 2.0))) + (y * y);
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 9e+139], N[(N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 8.9999999999999999e139

   1. Initial program 94.4%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
   2. Step-by-step derivation

      1. associate-+l+ 94.4%

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

      2. fma-def 94.4%

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

      3. distribute-rgt-out 95.8%

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

   3. Simplified 95.8%

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

      1. fma-udef 95.8%

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

      2. distribute-rgt-in 94.4%

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

      3. associate-+l+ 94.4%

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

      4. +-commutative 94.4%

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

      5. associate-*l* 94.4%

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

      6. distribute-lft-out 98.6%

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

   5. Applied egg-rr 98.6%

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

   if 8.9999999999999999e139 < y

   1. Initial program 86.0%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around 0 93.7%

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

      1. unpow2 93.7%

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

   4. Simplified 93.7%

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

4. Final simplification 97.8%

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

Alternative 3: 87.4% accurate, 1.2× speedup

Math

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

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= x -2.9e-47) (* x x) (+ (* y y) (* y (+ x x)))))

C

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

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-2.9d-47)) then
        tmp = x * x
    else
        tmp = (y * y) + (y * (x + x))
    end if
    code = tmp
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -2.9e-47:
		tmp = x * x
	else:
		tmp = (y * y) + (y * (x + x))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -2.9e-47)
		tmp = Float64(x * x);
	else
		tmp = Float64(Float64(y * y) + Float64(y * Float64(x + x)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.9e-47)
		tmp = x * x;
	else
		tmp = (y * y) + (y * (x + x));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -2.9e-47], N[(x * x), $MachinePrecision], N[(N[(y * y), $MachinePrecision] + N[(y * N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.9e-47

   1. Initial program 89.6%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around inf 74.2%

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

      1. unpow2 74.2%

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

   4. Simplified 74.2%

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

   if -2.9e-47 < x

   1. Initial program 94.4%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around 0 63.5%

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

      1. associate-*r* 63.5%

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

      2. *-commutative 63.5%

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

      3. associate-*r* 63.5%

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

      4. count-2 63.5%

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

   4. Simplified 63.5%

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

4. Final simplification 66.7%

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

Alternative 4: 87.2% accurate, 2.6× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{-45}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (if (<= x -1.35e-45) (* x x) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -1.35e-45) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.35d-45)) then
        tmp = x * x
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -1.35e-45:
		tmp = x * x
	else:
		tmp = y * y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -1.35e-45)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.35e-45)
		tmp = x * x;
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -1.35e-45], N[(x * x), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.34999999999999992e-45

   1. Initial program 89.6%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around inf 74.2%

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

      1. unpow2 74.2%

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

   4. Simplified 74.2%

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

   if -1.34999999999999992e-45 < x

   1. Initial program 94.4%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

   2. Taylor expanded in x around 0 65.0%

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

      1. unpow2 65.0%

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

   4. Simplified 65.0%

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

4. Final simplification 67.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{-45}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 5: 57.1% accurate, 4.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ x \cdot x \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (* x x))

C

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

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * x
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	return x * x

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(x * x)
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = x * x;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(x * x), $MachinePrecision]

Derivation

1. Initial program 93.0%

   \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]

2. Taylor expanded in x around inf 57.2%

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

   1. unpow2 57.2%

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

4. Simplified 57.2%

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

5. Final simplification 57.2%

   \[\leadsto x \cdot x \]

Developer target: 93.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023181 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

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

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