Linear.V3:cross from linear-1.19.1.3

Percentage Accurate: 99.1% → 99.5%

Time: 2.2s

Alternatives: 4

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, y, z \cdot \left(-t\right)\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma x y (* z (- t))))

C

double code(double x, double y, double z, double t) {
	return fma(x, y, (z * -t));
}

Julia

function code(x, y, z, t)
	return fma(x, y, Float64(z * Float64(-t)))
end

Wolfram

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

Derivation

1. Initial program 99.2%

   \[x \cdot y - z \cdot t \]
2. Step-by-step derivation

   1. fma-neg 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, -z \cdot t\right)} \]

   2. distribute-rgt-neg-in 100.0%

      \[\leadsto \mathsf{fma}\left(x, y, \color{blue}{z \cdot \left(-t\right)}\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, z \cdot \left(-t\right)\right)} \]

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x, y, z \cdot \left(-t\right)\right) \]

Alternative 2: 67.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3.1 \cdot 10^{+77} \lor \neg \left(t \leq 1.15 \cdot 10^{+39} \lor \neg \left(t \leq 1.3 \cdot 10^{+135}\right) \land t \leq 8.2 \cdot 10^{+144}\right):\\ \;\;\;\;z \cdot \left(-t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -3.1e+77)
         (not
          (or (<= t 1.15e+39) (and (not (<= t 1.3e+135)) (<= t 8.2e+144)))))
   (* z (- t))
   (* x y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -3.1e+77) || !((t <= 1.15e+39) || (!(t <= 1.3e+135) && (t <= 8.2e+144)))) {
		tmp = z * -t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-3.1d+77)) .or. (.not. (t <= 1.15d+39) .or. (.not. (t <= 1.3d+135)) .and. (t <= 8.2d+144))) then
        tmp = z * -t
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -3.1e+77) || !((t <= 1.15e+39) || (!(t <= 1.3e+135) && (t <= 8.2e+144)))) {
		tmp = z * -t;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -3.1e+77) or not ((t <= 1.15e+39) or (not (t <= 1.3e+135) and (t <= 8.2e+144))):
		tmp = z * -t
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -3.1e+77) || !((t <= 1.15e+39) || (!(t <= 1.3e+135) && (t <= 8.2e+144))))
		tmp = Float64(z * Float64(-t));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -3.1e+77) || ~(((t <= 1.15e+39) || (~((t <= 1.3e+135)) && (t <= 8.2e+144)))))
		tmp = z * -t;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -3.1e+77], N[Not[Or[LessEqual[t, 1.15e+39], And[N[Not[LessEqual[t, 1.3e+135]], $MachinePrecision], LessEqual[t, 8.2e+144]]]], $MachinePrecision]], N[(z * (-t)), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.09999999999999999e77 or 1.15000000000000006e39 < t < 1.3e135 or 8.20000000000000002e144 < t

   1. Initial program 98.0%

      \[x \cdot y - z \cdot t \]

   2. Taylor expanded in x around 0 73.5%

      \[\leadsto \color{blue}{-1 \cdot \left(t \cdot z\right)} \]
   3. Step-by-step derivation

      1. associate-*r* 73.5%

         \[\leadsto \color{blue}{\left(-1 \cdot t\right) \cdot z} \]

      2. neg-mul-1 73.5%

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

      3. *-commutative 73.5%

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

   4. Simplified 73.5%

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

   if -3.09999999999999999e77 < t < 1.15000000000000006e39 or 1.3e135 < t < 8.20000000000000002e144

   1. Initial program 100.0%

      \[x \cdot y - z \cdot t \]

   2. Taylor expanded in x around inf 68.4%

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

4. Final simplification 70.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.1 \cdot 10^{+77} \lor \neg \left(t \leq 1.15 \cdot 10^{+39} \lor \neg \left(t \leq 1.3 \cdot 10^{+135}\right) \land t \leq 8.2 \cdot 10^{+144}\right):\\ \;\;\;\;z \cdot \left(-t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 3: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot y - z \cdot t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (x * y) - (z * t)

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.2%

   \[x \cdot y - z \cdot t \]

2. Final simplification 99.2%

   \[\leadsto x \cdot y - z \cdot t \]

Alternative 4: 51.1% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* x y))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return x * y

Julia

function code(x, y, z, t)
	return Float64(x * y)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

   \[x \cdot y - z \cdot t \]

2. Taylor expanded in x around inf 52.6%

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

3. Final simplification 52.6%

   \[\leadsto x \cdot y \]

Reproduce

herbie shell --seed 2023257 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))