Examples.Basics.BasicTests:f1 from sbv-4.4

Percentage Accurate: 100.0% → 100.0%

Time: 2.6s

Alternatives: 3

Speedup: 1.0×

• 43.9% 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: 66.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= x 2.5e-43) (* y (- 0.0 y)) (* x x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= 2.5e-43) {
		tmp = y * (0.0 - 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 <= 2.5d-43) then
        tmp = y * (0.0d0 - y)
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if x <= 2.5e-43:
		tmp = y * (0.0 - y)
	else:
		tmp = x * x
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[LessEqual[x, 2.5e-43], N[(y * N[(0.0 - y), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2.50000000000000009e-43

   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}{-1 \cdot {y}^{2}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left({y}^{2}\right) \]

      2. neg-sub0 N/A

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

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(0, \color{blue}{\left({y}^{2}\right)}\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{\_.f64}\left(0, \left(y \cdot \color{blue}{y}\right)\right) \]

      5. *-lowering-*.f64 67.1%

         \[\leadsto \mathsf{\_.f64}\left(0, \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   5. Simplified 67.1%

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

      1. sub0-neg N/A

         \[\leadsto \mathsf{neg}\left(y \cdot y\right) \]

      2. neg-lowering-neg.f64 N/A

         \[\leadsto \mathsf{neg.f64}\left(\left(y \cdot y\right)\right) \]

      3. *-lowering-*.f64 67.1%

         \[\leadsto \mathsf{neg.f64}\left(\mathsf{*.f64}\left(y, y\right)\right) \]

   7. Applied egg-rr 67.1%

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

   if 2.50000000000000009e-43 < x

   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. unpow2 N/A

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

      2. *-lowering-*.f64 78.5%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{x}\right) \]

   5. Simplified 78.5%

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

4. Final simplification 70.4%

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

Alternative 3: 53.0% 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 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. unpow2 N/A

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

   2. *-lowering-*.f64 49.5%

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{x}\right) \]

5. Simplified 49.5%

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

Reproduce

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