Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B

Percentage Accurate: 100.0% → 100.0%

Time: 6.7s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + ((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 = x + ((y - x) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + ((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 = x + ((y - x) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. fma-define 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y - x, z, x\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 60.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(-z\right)\\ \mathbf{if}\;z \leq -2.2 \cdot 10^{+162}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq -1.12 \cdot 10^{-48}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq 1.85 \cdot 10^{-104}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{+127}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- z))))
   (if (<= z -2.2e+162)
     t_0
     (if (<= z -1.12e-48)
       (* y z)
       (if (<= z 1.85e-104) x (if (<= z 2.1e+127) (* y z) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = x * -z;
	double tmp;
	if (z <= -2.2e+162) {
		tmp = t_0;
	} else if (z <= -1.12e-48) {
		tmp = y * z;
	} else if (z <= 1.85e-104) {
		tmp = x;
	} else if (z <= 2.1e+127) {
		tmp = y * z;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x * -z
    if (z <= (-2.2d+162)) then
        tmp = t_0
    else if (z <= (-1.12d-48)) then
        tmp = y * z
    else if (z <= 1.85d-104) then
        tmp = x
    else if (z <= 2.1d+127) then
        tmp = y * z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * -z;
	double tmp;
	if (z <= -2.2e+162) {
		tmp = t_0;
	} else if (z <= -1.12e-48) {
		tmp = y * z;
	} else if (z <= 1.85e-104) {
		tmp = x;
	} else if (z <= 2.1e+127) {
		tmp = y * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * -z
	tmp = 0
	if z <= -2.2e+162:
		tmp = t_0
	elif z <= -1.12e-48:
		tmp = y * z
	elif z <= 1.85e-104:
		tmp = x
	elif z <= 2.1e+127:
		tmp = y * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(-z))
	tmp = 0.0
	if (z <= -2.2e+162)
		tmp = t_0;
	elseif (z <= -1.12e-48)
		tmp = Float64(y * z);
	elseif (z <= 1.85e-104)
		tmp = x;
	elseif (z <= 2.1e+127)
		tmp = Float64(y * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * -z;
	tmp = 0.0;
	if (z <= -2.2e+162)
		tmp = t_0;
	elseif (z <= -1.12e-48)
		tmp = y * z;
	elseif (z <= 1.85e-104)
		tmp = x;
	elseif (z <= 2.1e+127)
		tmp = y * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * (-z)), $MachinePrecision]}, If[LessEqual[z, -2.2e+162], t$95$0, If[LessEqual[z, -1.12e-48], N[(y * z), $MachinePrecision], If[LessEqual[z, 1.85e-104], x, If[LessEqual[z, 2.1e+127], N[(y * z), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.2000000000000002e162 or 2.09999999999999992e127 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 66.0%

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

      1. mul-1-neg 66.0%

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

      2. unsub-neg 66.0%

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

   5. Simplified 66.0%

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

   6. Taylor expanded in z around inf 66.0%

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

      1. mul-1-neg 66.0%

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

      2. *-commutative 66.0%

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

      3. distribute-rgt-neg-in 66.0%

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

   8. Simplified 66.0%

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

   if -2.2000000000000002e162 < z < -1.11999999999999999e-48 or 1.85e-104 < z < 2.09999999999999992e127

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 96.9%

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

   4. Taylor expanded in y around inf 62.0%

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

      1. *-commutative 62.0%

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

   6. Simplified 62.0%

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

   if -1.11999999999999999e-48 < z < 1.85e-104

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 78.7%

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

4. Final simplification 69.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+162}:\\ \;\;\;\;x \cdot \left(-z\right)\\ \mathbf{elif}\;z \leq -1.12 \cdot 10^{-48}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq 1.85 \cdot 10^{-104}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{+127}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \lor \neg \left(z \leq 1\right):\\ \;\;\;\;\left(y - x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.0) (not (<= z 1.0))) (* (- y x) z) (+ x (* y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = (y - x) * z;
	} else {
		tmp = x + (y * z);
	}
	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 ((z <= (-1.0d0)) .or. (.not. (z <= 1.0d0))) then
        tmp = (y - x) * z
    else
        tmp = x + (y * z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = (y - x) * z
	else:
		tmp = x + (y * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(Float64(y - x) * z);
	else
		tmp = Float64(x + Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = (y - x) * z;
	else
		tmp = x + (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 100.0%

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

   4. Taylor expanded in z around inf 99.5%

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

   if -1 < z < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 97.6%

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

      1. *-commutative 97.6%

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

   5. Simplified 97.6%

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

4. Final simplification 98.6%

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

Alternative 4: 84.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.0135 \lor \neg \left(z \leq 1.8 \cdot 10^{-104}\right):\\ \;\;\;\;\left(y - x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.0135) (not (<= z 1.8e-104))) (* (- y x) z) (* x (- 1.0 z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.0135) || !(z <= 1.8e-104)) {
		tmp = (y - x) * z;
	} else {
		tmp = x * (1.0 - z);
	}
	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 ((z <= (-0.0135d0)) .or. (.not. (z <= 1.8d-104))) then
        tmp = (y - x) * z
    else
        tmp = x * (1.0d0 - z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.0135) || !(z <= 1.8e-104)) {
		tmp = (y - x) * z;
	} else {
		tmp = x * (1.0 - z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -0.0135) or not (z <= 1.8e-104):
		tmp = (y - x) * z
	else:
		tmp = x * (1.0 - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.0135) || !(z <= 1.8e-104))
		tmp = Float64(Float64(y - x) * z);
	else
		tmp = Float64(x * Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -0.0135) || ~((z <= 1.8e-104)))
		tmp = (y - x) * z;
	else
		tmp = x * (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.0135], N[Not[LessEqual[z, 1.8e-104]], $MachinePrecision]], N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -0.0134999999999999998 or 1.7999999999999999e-104 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 98.8%

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

   4. Taylor expanded in z around inf 93.3%

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

   if -0.0134999999999999998 < z < 1.7999999999999999e-104

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 77.8%

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

      1. mul-1-neg 77.8%

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

      2. unsub-neg 77.8%

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

   5. Simplified 77.8%

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

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.0135 \lor \neg \left(z \leq 1.8 \cdot 10^{-104}\right):\\ \;\;\;\;\left(y - x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-124} \lor \neg \left(x \leq 7 \cdot 10^{-90}\right):\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.1e-124) (not (<= x 7e-90))) (* x (- 1.0 z)) (* y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.1e-124) || !(x <= 7e-90)) {
		tmp = x * (1.0 - z);
	} else {
		tmp = y * z;
	}
	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.1d-124)) .or. (.not. (x <= 7d-90))) then
        tmp = x * (1.0d0 - z)
    else
        tmp = y * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.1e-124) || !(x <= 7e-90)) {
		tmp = x * (1.0 - z);
	} else {
		tmp = y * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.1e-124) or not (x <= 7e-90):
		tmp = x * (1.0 - z)
	else:
		tmp = y * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.1e-124) || !(x <= 7e-90))
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = Float64(y * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.1e-124) || ~((x <= 7e-90)))
		tmp = x * (1.0 - z);
	else
		tmp = y * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.1e-124], N[Not[LessEqual[x, 7e-90]], $MachinePrecision]], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(y * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.1000000000000001e-124 or 6.9999999999999997e-90 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 79.1%

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

      1. mul-1-neg 79.1%

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

      2. unsub-neg 79.1%

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

   5. Simplified 79.1%

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

   if -2.1000000000000001e-124 < x < 6.9999999999999997e-90

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 99.9%

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

   4. Taylor expanded in y around inf 80.2%

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

      1. *-commutative 80.2%

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

   6. Simplified 80.2%

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

4. Final simplification 79.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-124} \lor \neg \left(x \leq 7 \cdot 10^{-90}\right):\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 60.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7.8 \cdot 10^{-28} \lor \neg \left(z \leq 1.85 \cdot 10^{-104}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -7.8e-28) (not (<= z 1.85e-104))) (* y z) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -7.8e-28) || !(z <= 1.85e-104)) {
		tmp = y * z;
	} else {
		tmp = 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 ((z <= (-7.8d-28)) .or. (.not. (z <= 1.85d-104))) then
        tmp = y * z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -7.8e-28) || !(z <= 1.85e-104)) {
		tmp = y * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -7.8e-28) or not (z <= 1.85e-104):
		tmp = y * z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -7.8e-28) || !(z <= 1.85e-104))
		tmp = Float64(y * z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -7.8e-28) || ~((z <= 1.85e-104)))
		tmp = y * z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -7.8e-28], N[Not[LessEqual[z, 1.85e-104]], $MachinePrecision]], N[(y * z), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -7.79999999999999998e-28 or 1.85e-104 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 98.3%

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

   4. Taylor expanded in y around inf 52.5%

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

      1. *-commutative 52.5%

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

   6. Simplified 52.5%

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

   if -7.79999999999999998e-28 < z < 1.85e-104

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 78.7%

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

4. Final simplification 62.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7.8 \cdot 10^{-28} \lor \neg \left(z \leq 1.85 \cdot 10^{-104}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + ((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 = x + ((y - x) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 8: 35.6% accurate, 7.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return 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 = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in z around 0 34.3%

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

Reproduce

herbie shell --seed 2024137 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))