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

Percentage Accurate: 68.7% → 100.0%

Time: 4.1s

Alternatives: 3

Speedup: 3.0×

• 20.7% 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 71.6%

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

   1. associate-+l- 77.7%

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

   2. *-commutative 77.7%

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

   3. +-inverses 97.2%

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

   4. --rgt-identity 97.2%

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

   5. 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. Add Preprocessing
5. Add Preprocessing

Alternative 2: 76.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+95} \lor \neg \left(x \leq 1.278 \cdot 10^{+18}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.6e+95) (not (<= x 1.278e+18))) (* y x) (* z (- y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.6e+95) || !(x <= 1.278e+18)) {
		tmp = y * x;
	} else {
		tmp = z * -y;
	}
	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.6d+95)) .or. (.not. (x <= 1.278d+18))) then
        tmp = y * x
    else
        tmp = z * -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.6e+95) || !(x <= 1.278e+18)) {
		tmp = y * x;
	} else {
		tmp = z * -y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.6e+95) or not (x <= 1.278e+18):
		tmp = y * x
	else:
		tmp = z * -y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.6e+95) || !(x <= 1.278e+18))
		tmp = Float64(y * x);
	else
		tmp = Float64(z * Float64(-y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.6e+95) || ~((x <= 1.278e+18)))
		tmp = y * x;
	else
		tmp = z * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.6e+95], N[Not[LessEqual[x, 1.278e+18]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(z * (-y)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.5999999999999999e95 or 1.278e18 < x

   1. Initial program 71.3%

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

      1. associate-+l- 74.5%

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

      2. *-commutative 74.5%

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

      3. +-inverses 93.6%

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

      4. --rgt-identity 93.6%

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

      5. 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. Add Preprocessing

   5. Taylor expanded in x around inf 84.8%

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

      1. *-commutative 84.8%

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

   7. Simplified 84.8%

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

   if -2.5999999999999999e95 < x < 1.278e18

   1. Initial program 71.7%

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

      1. associate-+l- 79.6%

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

      2. *-commutative 79.6%

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

      3. +-inverses 99.4%

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

      4. --rgt-identity 99.4%

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

      5. 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. Add Preprocessing

   5. Taylor expanded in x around 0 80.4%

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

      1. mul-1-neg 80.4%

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

      2. distribute-rgt-neg-out 80.4%

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

   7. Simplified 80.4%

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

4. Final simplification 82.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+95} \lor \neg \left(x \leq 1.278 \cdot 10^{+18}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 53.7% 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 71.6%

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

   1. associate-+l- 77.7%

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

   2. *-commutative 77.7%

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

   3. +-inverses 97.2%

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

   4. --rgt-identity 97.2%

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

   5. 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. Add Preprocessing

5. Taylor expanded in x around inf 49.1%

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

   1. *-commutative 49.1%

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

7. Simplified 49.1%

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

Developer Target 1: 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 2024157 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, D"
  :precision binary64

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

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