SynthBasics:moogVCF from YampaSynth-0.2

Percentage Accurate: 94.1% → 99.1%

Time: 7.6s

Alternatives: 9

Speedup: 0.3×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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: 94.1% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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: 99.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = 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]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(t - x), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], t$95$1, N[((-x) * z + N[(t * z + x), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 55.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 55.3%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 100.0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 100.0

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

   10. Applied rewrites 100.0%

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

   if -inf.0 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y))))) < 1e308

   1. Initial program 99.9%

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

   if 1e308 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y)))))

   1. Initial program 48.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 48.9%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 95.9

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

   7. Applied rewrites 95.9%

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

   8. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      2. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot x\right) \cdot z + t \cdot z\right) + x \]

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-*.f64 96.2

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

   10. Applied rewrites 96.2%

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

       1. lift-*.f64 N/A

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

       2. lift-fma.f64 N/A

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

       3. lift-neg.f64 N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x\right)\right) \cdot z + t \cdot z\right) + x \]

       4. distribute-lft-neg-out N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x \cdot z\right)\right) + t \cdot z\right) + x \]

       5. mul-1-neg N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       6. lower-+.f64 N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       7. associate-+l+ N/A

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

       8. associate-*r* N/A

          \[\leadsto \left(-1 \cdot x\right) \cdot z + \left(t \cdot z + x\right) \]

       9. lower-fma.f64 N/A

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

       10. mul-1-neg N/A

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

       11. lift-neg.f64 N/A

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

       12. lower-fma.f64 96.2

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

   12. Applied rewrites 96.2%

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

4. Final simplification 99.5%

   \[\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 -\infty:\\ \;\;\;\;\left(t - x\right) \cdot z\\ \mathbf{elif}\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \leq 10^{+308}:\\ \;\;\;\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, \mathsf{fma}\left(t, z, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, y, z, t)
	t_1 = Float64(tanh(Float64(t / y)) - tanh(Float64(x / y)))
	t_2 = Float64(x + Float64(Float64(y * z) * t_1))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(Float64(t - x) * z);
	elseif (t_2 <= 1e+308)
		tmp = fma(t_1, Float64(z * y), x);
	else
		tmp = fma(Float64(-x), z, fma(t, z, 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]}, Block[{t$95$2 = N[(x + N[(N[(y * z), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(t - x), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$2, 1e+308], N[(t$95$1 * N[(z * y), $MachinePrecision] + x), $MachinePrecision], N[((-x) * z + N[(t * z + x), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 55.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 55.3%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 100.0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 100.0

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

   10. Applied rewrites 100.0%

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

   if -inf.0 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y))))) < 1e308

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

   if 1e308 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y)))))

   1. Initial program 48.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 48.9%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 95.9

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

   7. Applied rewrites 95.9%

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

   8. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      2. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot x\right) \cdot z + t \cdot z\right) + x \]

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-*.f64 96.2

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

   10. Applied rewrites 96.2%

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

       1. lift-*.f64 N/A

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

       2. lift-fma.f64 N/A

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

       3. lift-neg.f64 N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x\right)\right) \cdot z + t \cdot z\right) + x \]

       4. distribute-lft-neg-out N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x \cdot z\right)\right) + t \cdot z\right) + x \]

       5. mul-1-neg N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       6. lower-+.f64 N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       7. associate-+l+ N/A

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

       8. associate-*r* N/A

          \[\leadsto \left(-1 \cdot x\right) \cdot z + \left(t \cdot z + x\right) \]

       9. lower-fma.f64 N/A

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

       10. mul-1-neg N/A

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

       11. lift-neg.f64 N/A

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

       12. lower-fma.f64 96.2

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

   12. Applied rewrites 96.2%

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

4. Final simplification 99.5%

   \[\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 -\infty:\\ \;\;\;\;\left(t - x\right) \cdot z\\ \mathbf{elif}\;x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \leq 10^{+308}:\\ \;\;\;\;\mathsf{fma}\left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right), z \cdot y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, \mathsf{fma}\left(t, z, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 71.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+295} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+304}\right):\\ \;\;\;\;\left(t - x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ x (* (* y z) (- (tanh (/ t y)) (tanh (/ x y)))))))
   (if (or (<= t_1 -2e+295) (not (<= t_1 5e+304))) (* (- t x) z) x)))

C

double code(double x, double y, double z, double t) {
	double t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	double tmp;
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304)) {
		tmp = (t - x) * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))))
    if ((t_1 <= (-2d+295)) .or. (.not. (t_1 <= 5d+304))) then
        tmp = (t - x) * z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x + ((y * z) * (Math.tanh((t / y)) - Math.tanh((x / y))));
	double tmp;
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304)) {
		tmp = (t - x) * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x + ((y * z) * (math.tanh((t / y)) - math.tanh((x / y))))
	tmp = 0
	if (t_1 <= -2e+295) or not (t_1 <= 5e+304):
		tmp = (t - x) * z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x + Float64(Float64(y * z) * Float64(tanh(Float64(t / y)) - tanh(Float64(x / y)))))
	tmp = 0.0
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304))
		tmp = Float64(Float64(t - x) * z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	tmp = 0.0;
	if ((t_1 <= -2e+295) || ~((t_1 <= 5e+304)))
		tmp = (t - x) * z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = 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]}, If[Or[LessEqual[t$95$1, -2e+295], N[Not[LessEqual[t$95$1, 5e+304]], $MachinePrecision]], N[(N[(t - x), $MachinePrecision] * z), $MachinePrecision], x]]

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))))) < -2e295 or 4.9999999999999997e304 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y)))))

   1. Initial program 53.8%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 53.8%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 94.1

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

   7. Applied rewrites 94.1%

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

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 94.1

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

   10. Applied rewrites 94.1%

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

   if -2e295 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y))))) < 4.9999999999999997e304

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 74.5%

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

4. Final simplification 78.0%

   \[\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 -2 \cdot 10^{+295} \lor \neg \left(x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \leq 5 \cdot 10^{+304}\right):\\ \;\;\;\;\left(t - x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 65.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+295} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+304}\right):\\ \;\;\;\;t \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ x (* (* y z) (- (tanh (/ t y)) (tanh (/ x y)))))))
   (if (or (<= t_1 -2e+295) (not (<= t_1 5e+304))) (* t z) x)))

C

double code(double x, double y, double z, double t) {
	double t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	double tmp;
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304)) {
		tmp = t * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))))
    if ((t_1 <= (-2d+295)) .or. (.not. (t_1 <= 5d+304))) then
        tmp = t * z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x + ((y * z) * (Math.tanh((t / y)) - Math.tanh((x / y))));
	double tmp;
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304)) {
		tmp = t * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x + ((y * z) * (math.tanh((t / y)) - math.tanh((x / y))))
	tmp = 0
	if (t_1 <= -2e+295) or not (t_1 <= 5e+304):
		tmp = t * z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x + Float64(Float64(y * z) * Float64(tanh(Float64(t / y)) - tanh(Float64(x / y)))))
	tmp = 0.0
	if ((t_1 <= -2e+295) || !(t_1 <= 5e+304))
		tmp = Float64(t * z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x + ((y * z) * (tanh((t / y)) - tanh((x / y))));
	tmp = 0.0;
	if ((t_1 <= -2e+295) || ~((t_1 <= 5e+304)))
		tmp = t * z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = 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]}, If[Or[LessEqual[t$95$1, -2e+295], N[Not[LessEqual[t$95$1, 5e+304]], $MachinePrecision]], N[(t * z), $MachinePrecision], x]]

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))))) < -2e295 or 4.9999999999999997e304 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y)))))

   1. Initial program 53.8%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 53.8%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 94.1

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

   7. Applied rewrites 94.1%

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

   8. Taylor expanded in x around 0

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

      1. lower-*.f64 53.4

         \[\leadsto t \cdot z \]

   10. Applied rewrites 53.4%

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

   if -2e295 < (+.f64 x (*.f64 (*.f64 y z) (-.f64 (tanh.f64 (/.f64 t y)) (tanh.f64 (/.f64 x y))))) < 4.9999999999999997e304

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 74.5%

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

4. Final simplification 70.7%

   \[\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 -2 \cdot 10^{+295} \lor \neg \left(x + \left(y \cdot z\right) \cdot \left(\tanh \left(\frac{t}{y}\right) - \tanh \left(\frac{x}{y}\right)\right) \leq 5 \cdot 10^{+304}\right):\\ \;\;\;\;t \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.1e+154)
   (fma (- t x) z x)
   (if (<= y 1.65e+81)
     (fma (* z y) (tanh (/ t y)) x)
     (fma (- x) z (fma t z x)))))

C

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.1e+154)
		tmp = fma(Float64(t - x), z, x);
	elseif (y <= 1.65e+81)
		tmp = fma(Float64(z * y), tanh(Float64(t / y)), x);
	else
		tmp = fma(Float64(-x), z, fma(t, z, x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -2.09999999999999994e154

   1. Initial program 75.1%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 92.5

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

   5. Applied rewrites 92.5%

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

   if -2.09999999999999994e154 < y < 1.65e81

   1. Initial program 98.2%

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

   3. Taylor expanded in x around 0

      \[\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)} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\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{\frac{1}{e^{\frac{t}{y}}}}{\color{blue}{e^{\frac{t}{y}} + \frac{1}{e^{\frac{t}{y}}}}}\right) \]

      2. div-sub N/A

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

      3. rec-exp N/A

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

      4. rec-exp N/A

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

      5. tanh-def-a N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 89.5

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

   5. Applied rewrites 89.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 89.5

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 89.5

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

   7. Applied rewrites 89.5%

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

   if 1.65e81 < y

   1. Initial program 84.1%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 84.1%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 97.9

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

   7. Applied rewrites 97.9%

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

   8. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      2. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot x\right) \cdot z + t \cdot z\right) + x \]

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-*.f64 97.9

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

   10. Applied rewrites 97.9%

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

       1. lift-*.f64 N/A

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

       2. lift-fma.f64 N/A

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

       3. lift-neg.f64 N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x\right)\right) \cdot z + t \cdot z\right) + x \]

       4. distribute-lft-neg-out N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x \cdot z\right)\right) + t \cdot z\right) + x \]

       5. mul-1-neg N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       6. lower-+.f64 N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       7. associate-+l+ N/A

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

       8. associate-*r* N/A

          \[\leadsto \left(-1 \cdot x\right) \cdot z + \left(t \cdot z + x\right) \]

       9. lower-fma.f64 N/A

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

       10. mul-1-neg N/A

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

       11. lift-neg.f64 N/A

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

       12. lower-fma.f64 97.9

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

   12. Applied rewrites 97.9%

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

4. Final simplification 91.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{+154}:\\ \;\;\;\;\mathsf{fma}\left(t - x, z, x\right)\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{+81}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot y, \tanh \left(\frac{t}{y}\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, \mathsf{fma}\left(t, z, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 77.7% accurate, 8.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2400.0)
   (fma (- t x) z x)
   (if (<= y 3.5e-6) x (fma (- x) z (fma t z x)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2400.0) {
		tmp = fma((t - x), z, x);
	} else if (y <= 3.5e-6) {
		tmp = x;
	} else {
		tmp = fma(-x, z, fma(t, z, x));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2400.0)
		tmp = fma(Float64(t - x), z, x);
	elseif (y <= 3.5e-6)
		tmp = x;
	else
		tmp = fma(Float64(-x), z, fma(t, z, x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -2400

   1. Initial program 82.4%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 78.9

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

   5. Applied rewrites 78.9%

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

   if -2400 < y < 3.49999999999999995e-6

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 81.5%

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

   if 3.49999999999999995e-6 < y

   1. Initial program 87.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 87.2%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 91.1

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

   7. Applied rewrites 91.1%

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

   8. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      2. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot x\right) \cdot z + t \cdot z\right) + x \]

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-*.f64 91.1

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

   10. Applied rewrites 91.1%

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

       1. lift-*.f64 N/A

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

       2. lift-fma.f64 N/A

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

       3. lift-neg.f64 N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x\right)\right) \cdot z + t \cdot z\right) + x \]

       4. distribute-lft-neg-out N/A

          \[\leadsto \left(\left(\mathsf{neg}\left(x \cdot z\right)\right) + t \cdot z\right) + x \]

       5. mul-1-neg N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       6. lower-+.f64 N/A

          \[\leadsto \left(-1 \cdot \left(x \cdot z\right) + t \cdot z\right) + x \]

       7. associate-+l+ N/A

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

       8. associate-*r* N/A

          \[\leadsto \left(-1 \cdot x\right) \cdot z + \left(t \cdot z + x\right) \]

       9. lower-fma.f64 N/A

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

       10. mul-1-neg N/A

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

       11. lift-neg.f64 N/A

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

       12. lower-fma.f64 91.1

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

   12. Applied rewrites 91.1%

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

4. Final simplification 83.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2400:\\ \;\;\;\;\mathsf{fma}\left(t - x, z, x\right)\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, \mathsf{fma}\left(t, z, x\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 77.8% accurate, 10.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2400 \lor \neg \left(y \leq 3.5 \cdot 10^{-6}\right):\\ \;\;\;\;\mathsf{fma}\left(t - x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -2400.0) (not (<= y 3.5e-6))) (fma (- t x) z x) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2400.0) || !(y <= 3.5e-6)) {
		tmp = fma((t - x), z, x);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -2400.0) || !(y <= 3.5e-6))
		tmp = fma(Float64(t - x), z, x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -2400.0], N[Not[LessEqual[y, 3.5e-6]], $MachinePrecision]], N[(N[(t - x), $MachinePrecision] * z + x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -2400 or 3.49999999999999995e-6 < y

   1. Initial program 84.5%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 84.2

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

   5. Applied rewrites 84.2%

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

   if -2400 < y < 3.49999999999999995e-6

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 81.5%

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

4. Final simplification 83.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2400 \lor \neg \left(y \leq 3.5 \cdot 10^{-6}\right):\\ \;\;\;\;\mathsf{fma}\left(t - x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 71.2% accurate, 12.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -5.5e+27) (not (<= y 165000000.0))) (fma t z x) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -5.5e+27) || !(y <= 165000000.0)) {
		tmp = fma(t, z, x);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -5.5e+27) || !(y <= 165000000.0))
		tmp = fma(t, z, x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -5.5e+27], N[Not[LessEqual[y, 165000000.0]], $MachinePrecision]], N[(t * z + x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -5.49999999999999966e27 or 1.65e8 < y

   1. Initial program 83.2%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-tanh.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lift-tanh.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 83.2%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 85.8

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

   7. Applied rewrites 85.8%

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

   8. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(t, z, x\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 69.8%

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

   if -5.49999999999999966e27 < y < 1.65e8

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 80.1%

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

4. Final simplification 74.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.5 \cdot 10^{+27} \lor \neg \left(y \leq 165000000\right):\\ \;\;\;\;\mathsf{fma}\left(t, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 60.6% accurate, 239.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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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 91.6%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 62.1%

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

Developer Target 1: 97.3% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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 2025043 
(FPCore (x y z t)
  :name "SynthBasics:moogVCF from YampaSynth-0.2"
  :precision binary64

  :alt
  (! :herbie-platform default (+ x (* y (* z (- (tanh (/ t y)) (tanh (/ x y)))))))

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