Examples.Basics.ProofTests:f4 from sbv-4.4

Percentage Accurate: 93.3% → 100.0%

Time: 3.0s

Alternatives: 5

Speedup: 1.2×

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

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 8 \cdot 10^{+153}:\\ \;\;\;\;\mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;{y}^{2}\\ \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 8e+153) (fma y y (* x (+ x (* y 2.0)))) (pow y 2.0)))

C

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

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 8e+153)
		tmp = fma(y, y, Float64(x * Float64(x + Float64(y * 2.0))));
	else
		tmp = y ^ 2.0;
	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, 8e+153], N[(y * y + N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[y, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 8e153

   1. Initial program 95.8%

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

      1. +-commutative 95.8%

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

      2. fma-def 95.8%

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

      3. +-commutative 95.8%

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

      4. associate-*l* 95.8%

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

      5. distribute-lft-out 98.2%

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

   3. Applied egg-rr 98.2%

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

   if 8e153 < y

   1. Initial program 76.9%

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

   2. Taylor expanded in x around 0 100.0%

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

4. Final simplification 98.4%

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

Alternative 2: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 8 \cdot 10^{+153}:\\ \;\;\;\;x \cdot \left(x + y \cdot 2\right) + y \cdot y\\ \mathbf{else}:\\ \;\;\;\;{y}^{2}\\ \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 8e+153) (+ (* x (+ x (* y 2.0))) (* y y)) (pow y 2.0)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 8e+153) {
		tmp = (x * (x + (y * 2.0))) + (y * y);
	} else {
		tmp = pow(y, 2.0);
	}
	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 <= 8d+153) then
        tmp = (x * (x + (y * 2.0d0))) + (y * y)
    else
        tmp = y ** 2.0d0
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 8e+153) {
		tmp = (x * (x + (y * 2.0))) + (y * y);
	} else {
		tmp = Math.pow(y, 2.0);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 8e+153:
		tmp = (x * (x + (y * 2.0))) + (y * y)
	else:
		tmp = math.pow(y, 2.0)
	return tmp

Julia

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

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 8e+153)
		tmp = (x * (x + (y * 2.0))) + (y * y);
	else
		tmp = y ^ 2.0;
	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, 8e+153], N[(N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision], N[Power[y, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 8e153

   1. Initial program 95.8%

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

      1. +-commutative 95.8%

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

      2. associate-*l* 95.8%

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

      3. distribute-lft-out 98.1%

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

   3. Applied egg-rr 98.1%

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

   if 8e153 < y

   1. Initial program 76.9%

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

   2. Taylor expanded in x around 0 100.0%

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

4. Final simplification 98.4%

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

Alternative 3: 96.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

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 + (y * 2.0d0))) + (y * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.0%

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

   1. +-commutative 93.0%

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

   2. associate-*l* 93.0%

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

   3. distribute-lft-out 95.7%

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

3. Applied egg-rr 95.7%

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

4. Final simplification 95.7%

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

Alternative 4: 53.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

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 = (y * y) + (y * (x * 2.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(N[(y * y), $MachinePrecision] + N[(y * N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $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 0 52.1%

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

   1. associate-*r* 52.1%

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

   2. *-commutative 52.1%

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

   3. *-commutative 52.1%

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

   4. *-commutative 52.1%

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

4. Simplified 52.1%

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

5. Final simplification 52.1%

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

Alternative 5: 15.2% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

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 = y * (x * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y * N[(x * 2.0), $MachinePrecision]), $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 0 52.1%

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

   1. associate-*r* 52.1%

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

   2. *-commutative 52.1%

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

   3. *-commutative 52.1%

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

   4. *-commutative 52.1%

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

4. Simplified 52.1%

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

5. Taylor expanded in y around 0 15.6%

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

   1. *-commutative 15.6%

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

   2. *-commutative 15.6%

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

   3. associate-*r* 15.6%

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

   4. *-commutative 15.6%

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

7. Simplified 15.6%

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

8. Final simplification 15.6%

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

Developer target: 93.3% 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 2023334 
(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)))