Examples.Basics.BasicTests:f3 from sbv-4.4

Percentage Accurate: 100.0% → 100.0%

Time: 7.4s

Alternatives: 5

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(x + y\right) \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 57.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x + y) <= (-4d-159)) then
        tmp = x * (x + y)
    else
        tmp = y * (x + y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -3.99999999999999995e-159

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 49.2%

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

   if -3.99999999999999995e-159 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 61.7%

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

4. Final simplification 55.8%

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

Alternative 3: 57.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -3.99999999999999995e-159

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 49.2%

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

   if -3.99999999999999995e-159 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{y}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 61.0

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

   5. Simplified 61.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 61.0

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

   7. Applied egg-rr 61.0%

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

4. Final simplification 55.4%

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

Alternative 4: 57.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -4 \cdot 10^{-159}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -3.99999999999999995e-159

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{x}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 47.6

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

   5. Simplified 47.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 47.6

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

   7. Applied egg-rr 47.6%

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

   if -3.99999999999999995e-159 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{y}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 61.0

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

   5. Simplified 61.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 61.0

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

   7. Applied egg-rr 61.0%

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

Alternative 5: 57.9% accurate, 2.0× 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 100.0%

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

3. Taylor expanded in x around inf

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

   1. +-rgt-identity N/A

      \[\leadsto \color{blue}{{x}^{2} + 0} \]

   2. unpow2 N/A

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

   3. accelerator-lowering-fma.f64 56.6

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

5. Simplified 56.6%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
6. Step-by-step derivation

   1. +-rgt-identity N/A

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

   2. *-lowering-*.f64 56.6

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

7. Applied egg-rr 56.6%

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

Developer Target 1: 93.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (+ (* x x) (+ (* y y) (* 2 (* y x)))))

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