Linear.Quaternion:$c/ from linear-1.19.1.3, D

Percentage Accurate: 68.7% → 100.0%

Time: 3.0s

Alternatives: 3

Speedup: 3.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.2%

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

   1. associate-+l- 71.5%

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

   2. +-inverses 97.2%

      \[\leadsto \left(x \cdot y - \color{blue}{0}\right) - y \cdot z \]

   3. associate--l- 97.2%

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

   4. *-commutative 97.2%

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

   5. +-lft-identity 97.2%

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

   6. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto y \cdot \left(x - z\right) \]

Alternative 2: 76.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{-90}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 3 \cdot 10^{-56} \lor \neg \left(x \leq 1.26 \cdot 10^{+39}\right) \land x \leq 5 \cdot 10^{+66}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.9e-90)
   (* y x)
   (if (or (<= x 3e-56) (and (not (<= x 1.26e+39)) (<= x 5e+66)))
     (* y (- z))
     (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.9e-90) {
		tmp = y * x;
	} else if ((x <= 3e-56) || (!(x <= 1.26e+39) && (x <= 5e+66))) {
		tmp = y * -z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-2.9d-90)) then
        tmp = y * x
    else if ((x <= 3d-56) .or. (.not. (x <= 1.26d+39)) .and. (x <= 5d+66)) then
        tmp = y * -z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.9e-90) {
		tmp = y * x;
	} else if ((x <= 3e-56) || (!(x <= 1.26e+39) && (x <= 5e+66))) {
		tmp = y * -z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -2.9e-90:
		tmp = y * x
	elif (x <= 3e-56) or (not (x <= 1.26e+39) and (x <= 5e+66)):
		tmp = y * -z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.9e-90)
		tmp = Float64(y * x);
	elseif ((x <= 3e-56) || (!(x <= 1.26e+39) && (x <= 5e+66)))
		tmp = Float64(y * Float64(-z));
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.9e-90)
		tmp = y * x;
	elseif ((x <= 3e-56) || (~((x <= 1.26e+39)) && (x <= 5e+66)))
		tmp = y * -z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.9e-90], N[(y * x), $MachinePrecision], If[Or[LessEqual[x, 3e-56], And[N[Not[LessEqual[x, 1.26e+39]], $MachinePrecision], LessEqual[x, 5e+66]]], N[(y * (-z)), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.89999999999999983e-90 or 2.99999999999999989e-56 < x < 1.26000000000000001e39 or 4.99999999999999991e66 < x

   1. Initial program 63.8%

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

      1. associate-+l- 70.4%

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

      2. +-inverses 96.3%

         \[\leadsto \left(x \cdot y - \color{blue}{0}\right) - y \cdot z \]

      3. associate--l- 96.3%

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

      4. *-commutative 96.3%

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

      5. +-lft-identity 96.3%

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

      6. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 77.5%

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

   if -2.89999999999999983e-90 < x < 2.99999999999999989e-56 or 1.26000000000000001e39 < x < 4.99999999999999991e66

   1. Initial program 64.9%

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

      1. associate-+l- 73.4%

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

      2. +-inverses 98.9%

         \[\leadsto \left(x \cdot y - \color{blue}{0}\right) - y \cdot z \]

      3. associate--l- 98.9%

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

      4. *-commutative 98.9%

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

      5. +-lft-identity 98.9%

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

      6. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 89.4%

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

      1. associate-*r* 89.4%

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

      2. neg-mul-1 89.4%

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

      3. *-commutative 89.4%

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

   6. Simplified 89.4%

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

4. Final simplification 81.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{-90}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 3 \cdot 10^{-56} \lor \neg \left(x \leq 1.26 \cdot 10^{+39}\right) \land x \leq 5 \cdot 10^{+66}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 3: 54.0% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.2%

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

   1. associate-+l- 71.5%

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

   2. +-inverses 97.2%

      \[\leadsto \left(x \cdot y - \color{blue}{0}\right) - y \cdot z \]

   3. associate--l- 97.2%

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

   4. *-commutative 97.2%

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

   5. +-lft-identity 97.2%

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

   6. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around inf 56.0%

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

5. Final simplification 56.0%

   \[\leadsto y \cdot x \]

Developer target: 100.0% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023207 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, D"
  :precision binary64

  :herbie-target
  (* (- x z) y)

  (- (+ (- (* x y) (* y y)) (* y y)) (* y z)))