SynthBasics:moogVCF from YampaSynth-0.2

Percentage Accurate: 93.5% → 97.8%

Time: 8.8s

Alternatives: 11

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z, double t) {
	return x + ((y * z) * (Math.tanh((t / y)) - Math.tanh((x / y))));
}

Python

def code(x, y, z, t):
	return x + ((y * z) * (math.tanh((t / y)) - math.tanh((x / y))))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 93.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z, double t) {
	return x + ((y * z) * (Math.tanh((t / y)) - Math.tanh((x / y))));
}

Python

def code(x, y, z, t):
	return x + ((y * z) * (math.tanh((t / y)) - math.tanh((x / y))))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\\ \mathbf{if}\;x + \left(y \cdot z\right) \cdot t_1 \leq 10^{+287}:\\ \;\;\;\;\mathsf{fma}\left(z, y \cdot t_1, x\right)\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \left(t - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (tanh (/ t y)) (tanh (/ x y)))))
   (if (<= (+ x (* (* y z) t_1)) 1e+287)
     (fma z (* y t_1) x)
     (+ x (* z (- t x))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = tanh((t / y)) - tanh((x / y));
	double tmp;
	if ((x + ((y * z) * t_1)) <= 1e+287) {
		tmp = fma(z, (y * t_1), x);
	} else {
		tmp = x + (z * (t - x));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(tanh(Float64(t / y)) - tanh(Float64(x / y)))
	tmp = 0.0
	if (Float64(x + Float64(Float64(y * z) * t_1)) <= 1e+287)
		tmp = fma(z, Float64(y * t_1), x);
	else
		tmp = Float64(x + Float64(z * Float64(t - x)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Tanh[N[(t / y), $MachinePrecision]], $MachinePrecision] - N[Tanh[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x + N[(N[(y * z), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], 1e+287], N[(z * N[(y * t$95$1), $MachinePrecision] + x), $MachinePrecision], N[(x + N[(z * N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y))))) < 1.0000000000000001e287

   1. Initial program 97.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]
   2. Step-by-step derivation

      1. +-commutative 97.1%

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

      2. *-commutative 97.1%

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

      3. associate-*l* 99.1%

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

      4. fma-def 99.2%

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

   3. Simplified 99.2%

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

   if 1.0000000000000001e287 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y)))))

   1. Initial program 49.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 96.1%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \leq 10^{+287}:\\ \;\;\;\;\mathsf{fma}\left(z, y \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \left(t - x\right)\\ \end{array} \]

Alternative 2: 95.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.6 \cdot 10^{+186}:\\ \;\;\;\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot t - x \cdot \left(z + -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 7.6e+186)
   (+ x (* (* y z) (- (tanh (/ t y)) (tanh (/ x y)))))
   (- (* z t) (* x (+ z -1.0)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 7.6e+186) {
		tmp = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	} else {
		tmp = (z * t) - (x * (z + -1.0));
	}
	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 (y <= 7.6d+186) then
        tmp = x + ((y * z) * (tanh((t / y)) - tanh((x / y))))
    else
        tmp = (z * t) - (x * (z + (-1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 7.6e+186) {
		tmp = x + ((y * z) * (Math.tanh((t / y)) - Math.tanh((x / y))));
	} else {
		tmp = (z * t) - (x * (z + -1.0));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 7.6e+186:
		tmp = x + ((y * z) * (math.tanh((t / y)) - math.tanh((x / y))))
	else:
		tmp = (z * t) - (x * (z + -1.0))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 7.6e+186)
		tmp = Float64(x + Float64(Float64(y * z) * Float64(tanh(Float64(t / y)) - tanh(Float64(x / y)))));
	else
		tmp = Float64(Float64(z * t) - Float64(x * Float64(z + -1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 7.6e+186)
		tmp = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	else
		tmp = (z * t) - (x * (z + -1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 7.6e+186], N[(x + N[(N[(y * z), $MachinePrecision] * N[(N[Tanh[N[(t / y), $MachinePrecision]], $MachinePrecision] - N[Tanh[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z * t), $MachinePrecision] - N[(x * N[(z + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 7.5999999999999996e186

   1. Initial program 94.9%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   if 7.5999999999999996e186 < y

   1. Initial program 69.3%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 99.9%

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

   3. Taylor expanded in x around -inf 99.9%

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

      1. +-commutative 99.9%

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

      2. mul-1-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. *-commutative 99.9%

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

      5. sub-neg 99.9%

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

      6. metadata-eval 99.9%

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

   5. Simplified 99.9%

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

4. Final simplification 95.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 7.6 \cdot 10^{+186}:\\ \;\;\;\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot t - x \cdot \left(z + -1\right)\\ \end{array} \]

Alternative 3: 83.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.8 \cdot 10^{+75}:\\ \;\;\;\;\mathsf{fma}\left(z, y \cdot \tanh \left(\frac{t}{y}\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 2.8e+75) (fma z (* y (tanh (/ t y))) x) (fma z (- t x) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 2.8e+75) {
		tmp = fma(z, (y * tanh((t / y))), x);
	} else {
		tmp = fma(z, (t - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 2.8e+75)
		tmp = fma(z, Float64(y * tanh(Float64(t / y))), x);
	else
		tmp = fma(z, Float64(t - x), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 2.8e+75], N[(z * N[(y * N[Tanh[N[(t / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(z * N[(t - x), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.80000000000000012e75

   1. Initial program 94.8%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]
   2. Step-by-step derivation

      1. +-commutative 94.8%

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

      2. *-commutative 94.8%

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

      3. associate-*l* 97.2%

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

      4. fma-def 97.2%

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

   3. Simplified 97.2%

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

   4. Taylor expanded in x around 0 25.9%

      \[\leadsto \mathsf{fma}\left(z, y \cdot \color{blue}{\left(\frac{e^{\frac{t}{y}}}{e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}} - \frac{1}{e^{\frac{t}{y}} \cdot \left(e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}\right)}\right)}, x\right) \]
   5. Step-by-step derivation

      1. associate-/r* 25.7%

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

      2. rec-exp 25.7%

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

      3. div-sub 25.7%

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

      4. rec-exp 25.7%

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

      5. tanh-def-a 80.0%

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

   6. Simplified 79.2%

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

   if 2.80000000000000012e75 < y

   1. Initial program 82.3%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 94.4%

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

      1. +-commutative 94.4%

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

      2. fma-def 94.5%

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

   4. Simplified 94.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, t - x, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.8 \cdot 10^{+75}:\\ \;\;\;\;\mathsf{fma}\left(z, y \cdot \tanh \left(\frac{t}{y}\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \]

Alternative 4: 82.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 6.2 \cdot 10^{+73}:\\ \;\;\;\;x + \left(y \cdot z\right) \cdot \tanh \left(\frac{t}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 6.2e+73) (+ x (* (* y z) (tanh (/ t y)))) (fma z (- t x) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 6.2e+73) {
		tmp = x + ((y * z) * tanh((t / y)));
	} else {
		tmp = fma(z, (t - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 6.2e+73)
		tmp = Float64(x + Float64(Float64(y * z) * tanh(Float64(t / y))));
	else
		tmp = fma(z, Float64(t - x), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 6.2e+73], N[(x + N[(N[(y * z), $MachinePrecision] * N[Tanh[N[(t / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(t - x), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 6.1999999999999999e73

   1. Initial program 94.8%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around 0 25.7%

      \[\leadsto x + \left(y \cdot z\right) \cdot \color{blue}{\left(\frac{e^{\frac{t}{y}}}{e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}} - \frac{1}{e^{\frac{t}{y}} \cdot \left(e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}\right)}\right)} \]
   3. Step-by-step derivation

      1. associate-/r* 25.7%

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

      2. rec-exp 25.7%

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

      3. div-sub 25.7%

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

      4. rec-exp 25.7%

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

      5. tanh-def-a 80.0%

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

   4. Simplified 80.0%

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

   if 6.1999999999999999e73 < y

   1. Initial program 82.3%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 94.4%

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

      1. +-commutative 94.4%

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

      2. fma-def 94.5%

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

   4. Simplified 94.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, t - x, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 6.2 \cdot 10^{+73}:\\ \;\;\;\;x + \left(y \cdot z\right) \cdot \tanh \left(\frac{t}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \]

Alternative 5: 69.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.8 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 1.8e+37) x (fma z (- t x) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.8e+37) {
		tmp = x;
	} else {
		tmp = fma(z, (t - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 1.8e+37)
		tmp = x;
	else
		tmp = fma(z, Float64(t - x), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.79999999999999999e37

   1. Initial program 94.6%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 68.2%

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

   if 1.79999999999999999e37 < y

   1. Initial program 85.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 88.8%

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

      1. +-commutative 88.8%

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

      2. fma-def 88.9%

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

   4. Simplified 88.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, t - x, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.8 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t - x, x\right)\\ \end{array} \]

Alternative 6: 64.3% accurate, 23.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.22 \cdot 10^{+38}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{+223}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(t - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 1.22e+38) x (if (<= y 2.6e+223) (* x (- 1.0 z)) (* z (- t x)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.22e+38) {
		tmp = x;
	} else if (y <= 2.6e+223) {
		tmp = x * (1.0 - z);
	} else {
		tmp = z * (t - x);
	}
	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 (y <= 1.22d+38) then
        tmp = x
    else if (y <= 2.6d+223) then
        tmp = x * (1.0d0 - z)
    else
        tmp = z * (t - x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.22e+38) {
		tmp = x;
	} else if (y <= 2.6e+223) {
		tmp = x * (1.0 - z);
	} else {
		tmp = z * (t - x);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 1.22e+38:
		tmp = x
	elif y <= 2.6e+223:
		tmp = x * (1.0 - z)
	else:
		tmp = z * (t - x)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 1.22e+38)
		tmp = x;
	elseif (y <= 2.6e+223)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = Float64(z * Float64(t - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 1.22e+38)
		tmp = x;
	elseif (y <= 2.6e+223)
		tmp = x * (1.0 - z);
	else
		tmp = z * (t - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 1.22e+38], x, If[LessEqual[y, 2.6e+223], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(z * N[(t - x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 1.22e38

   1. Initial program 94.6%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 67.9%

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

   if 1.22e38 < y < 2.6000000000000002e223

   1. Initial program 95.4%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 84.6%

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

   3. Taylor expanded in x around inf 64.5%

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

      1. mul-1-neg 64.5%

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

      2. unsub-neg 64.5%

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

   5. Simplified 64.5%

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

   if 2.6000000000000002e223 < y

   1. Initial program 55.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 99.8%

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

   3. Taylor expanded in z around inf 82.1%

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

4. Final simplification 68.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.22 \cdot 10^{+38}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{+223}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(t - x\right)\\ \end{array} \]

Alternative 7: 64.9% accurate, 23.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.65 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{+239}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 3.65e+37) x (if (<= y 1.2e+239) (* x (- 1.0 z)) (+ x (* z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 3.65e+37) {
		tmp = x;
	} else if (y <= 1.2e+239) {
		tmp = x * (1.0 - z);
	} else {
		tmp = x + (z * t);
	}
	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 (y <= 3.65d+37) then
        tmp = x
    else if (y <= 1.2d+239) then
        tmp = x * (1.0d0 - z)
    else
        tmp = x + (z * t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 3.65e+37) {
		tmp = x;
	} else if (y <= 1.2e+239) {
		tmp = x * (1.0 - z);
	} else {
		tmp = x + (z * t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 3.65e+37:
		tmp = x
	elif y <= 1.2e+239:
		tmp = x * (1.0 - z)
	else:
		tmp = x + (z * t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 3.65e+37)
		tmp = x;
	elseif (y <= 1.2e+239)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = Float64(x + Float64(z * t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 3.65e+37)
		tmp = x;
	elseif (y <= 1.2e+239)
		tmp = x * (1.0 - z);
	else
		tmp = x + (z * t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 3.65e+37], x, If[LessEqual[y, 1.2e+239], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(x + N[(z * t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 3.65000000000000019e37

   1. Initial program 94.6%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 67.9%

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

   if 3.65000000000000019e37 < y < 1.2e239

   1. Initial program 95.4%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 84.6%

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

   3. Taylor expanded in x around inf 64.5%

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

      1. mul-1-neg 64.5%

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

      2. unsub-neg 64.5%

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

   5. Simplified 64.5%

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

   if 1.2e239 < y

   1. Initial program 55.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around 0 23.7%

      \[\leadsto x + \left(y \cdot z\right) \cdot \color{blue}{\left(\frac{e^{\frac{t}{y}}}{e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}} - \frac{1}{e^{\frac{t}{y}} \cdot \left(e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}\right)}\right)} \]
   3. Step-by-step derivation

      1. associate-/r* 23.7%

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

      2. rec-exp 23.7%

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

      3. div-sub 23.7%

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

      4. rec-exp 23.7%

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

      5. tanh-def-a 53.9%

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

   4. Simplified 53.9%

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

   5. Taylor expanded in y around inf 71.6%

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

      1. +-commutative 71.6%

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

      2. *-commutative 71.6%

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

   7. Simplified 71.6%

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

4. Final simplification 67.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 3.65 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{+239}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot t\\ \end{array} \]

Alternative 8: 69.8% accurate, 23.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.8 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \left(t - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 1.8e+37) x (+ x (* z (- t x)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.8e+37) {
		tmp = x;
	} else {
		tmp = x + (z * (t - x));
	}
	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 (y <= 1.8d+37) then
        tmp = x
    else
        tmp = x + (z * (t - x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.8e+37) {
		tmp = x;
	} else {
		tmp = x + (z * (t - x));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 1.8e+37:
		tmp = x
	else:
		tmp = x + (z * (t - x))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 1.8e+37)
		tmp = x;
	else
		tmp = Float64(x + Float64(z * Float64(t - x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 1.8e+37)
		tmp = x;
	else
		tmp = x + (z * (t - x));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.79999999999999999e37

   1. Initial program 94.6%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 68.2%

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

   if 1.79999999999999999e37 < y

   1. Initial program 85.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 88.8%

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

4. Final simplification 72.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.8 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \left(t - x\right)\\ \end{array} \]

Alternative 9: 64.2% accurate, 30.2× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 4.2e+37) x (* x (- 1.0 z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4.2e+37) {
		tmp = x;
	} else {
		tmp = x * (1.0 - z);
	}
	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 (y <= 4.2d+37) then
        tmp = x
    else
        tmp = x * (1.0d0 - z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4.2e+37) {
		tmp = x;
	} else {
		tmp = x * (1.0 - z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 4.2e+37:
		tmp = x
	else:
		tmp = x * (1.0 - z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 4.2e+37)
		tmp = x;
	else
		tmp = Float64(x * Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 4.2e+37)
		tmp = x;
	else
		tmp = x * (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 4.2e+37], x, N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 4.2000000000000002e37

   1. Initial program 94.6%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 67.9%

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

   if 4.2000000000000002e37 < y

   1. Initial program 84.8%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 88.6%

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

   3. Taylor expanded in x around inf 60.4%

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

      1. mul-1-neg 60.4%

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

      2. unsub-neg 60.4%

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

   5. Simplified 60.4%

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

4. Final simplification 66.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4.2 \cdot 10^{+37}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \end{array} \]

Alternative 10: 61.0% accurate, 42.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.82 \cdot 10^{+239}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;z \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 1.82e+239) x (* z t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.82e+239) {
		tmp = x;
	} else {
		tmp = z * t;
	}
	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 (y <= 1.82d+239) then
        tmp = x
    else
        tmp = z * t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.82e+239) {
		tmp = x;
	} else {
		tmp = z * t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 1.82e+239:
		tmp = x
	else:
		tmp = z * t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 1.82e+239)
		tmp = x;
	else
		tmp = Float64(z * t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 1.82e+239)
		tmp = x;
	else
		tmp = z * t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 1.82e+239], x, N[(z * t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.82000000000000008e239

   1. Initial program 94.7%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in x around inf 64.2%

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

   if 1.82000000000000008e239 < y

   1. Initial program 55.1%

      \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

   2. Taylor expanded in y around inf 99.8%

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

   3. Taylor expanded in x around -inf 99.9%

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

      1. +-commutative 99.9%

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

      2. mul-1-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. *-commutative 99.9%

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

      5. sub-neg 99.9%

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

      6. metadata-eval 99.9%

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

   5. Simplified 99.9%

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

   6. Taylor expanded in t around inf 53.5%

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

      1. *-commutative 53.5%

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

   8. Simplified 53.5%

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

4. Final simplification 63.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.82 \cdot 10^{+239}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;z \cdot t\\ \end{array} \]

Alternative 11: 60.7% accurate, 213.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := x

Derivation

1. Initial program 92.4%

   \[x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \]

2. Taylor expanded in x around inf 61.4%

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

3. Final simplification 61.4%

   \[\leadsto x \]

Developer target: 96.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z, double t) {
	return x + (y * (z * (Math.tanh((t / y)) - Math.tanh((x / y)))));
}

Python

def code(x, y, z, t):
	return x + (y * (z * (math.tanh((t / y)) - math.tanh((x / y)))))

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023318 
(FPCore (x y z t)
  :name "SynthBasics:moogVCF from YampaSynth-0.2"
  :precision binary64

  :herbie-target
  (+ x (* y (* z (- (tanh (/ t y)) (tanh (/ x y))))))

  (+ x (* (* y z) (- (tanh (/ t y)) (tanh (/ x y))))))