Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B

Percentage Accurate: 98.1% → 98.1%

Time: 3.4s

Alternatives: 10

Speedup: 1.0×

Specification

Math

\[x + y \cdot \frac{z - t}{a - t} \]

FPCore

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

C

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

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, a)
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), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.1% accurate, 1.0× speedup

Math

\[x + y \cdot \frac{z - t}{a - t} \]

FPCore

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

C

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

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, a)
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), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 95.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (/ z (- a t)) y x)))
   (if (<= t_1 -1000000000000.0)
     t_2
     (if (<= t_1 5e-34)
       (+ x (* y (/ (- z t) a)))
       (if (<= t_1 1.0002) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= -1000000000000.0) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = x + (y * ((z - t) / a));
	} else if (t_1 <= 1.0002) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= -1000000000000.0)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = Float64(x + Float64(y * Float64(Float64(z - t) / a)));
	elseif (t_1 <= 1.0002)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -1000000000000.0], t$95$2, If[LessEqual[t$95$1, 5e-34], N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1.0002], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -1e12 or 1.0002 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in z around inf

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto x + y \cdot \frac{z}{\color{blue}{a - t}} \]

      2. lower--.f64 76.6%

         \[\leadsto x + y \cdot \frac{z}{a - \color{blue}{t}} \]

   4. Applied rewrites 76.6%

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + y \cdot \frac{z}{a - t}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \frac{z}{a - t} + x} \]

      3. add-flip N/A

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

      4. sub-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. remove-double-neg N/A

         \[\leadsto \frac{z}{a - t} \cdot y + \color{blue}{x} \]

      8. lower-fma.f64 76.6%

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

   6. Applied rewrites 76.6%

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

   if -1e12 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around 0

      \[\leadsto x + y \cdot \frac{z - t}{\color{blue}{a}} \]
   3. Step-by-step derivation

   4. Applied rewrites 61.2%

      \[\leadsto x + y \cdot \frac{z - t}{\color{blue}{a}} \]

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.0002

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

      \[\leadsto \color{blue}{x + y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 95.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (/ z (- a t)) y x)))
   (if (<= t_1 -1000000000000.0)
     t_2
     (if (<= t_1 5e-34)
       (fma (/ y a) (- z t) x)
       (if (<= t_1 1.0002) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= -1000000000000.0) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = fma((y / a), (z - t), x);
	} else if (t_1 <= 1.0002) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= -1000000000000.0)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = fma(Float64(y / a), Float64(z - t), x);
	elseif (t_1 <= 1.0002)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -1000000000000.0], t$95$2, If[LessEqual[t$95$1, 5e-34], N[(N[(y / a), $MachinePrecision] * N[(z - t), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 1.0002], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -1e12 or 1.0002 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in z around inf

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto x + y \cdot \frac{z}{\color{blue}{a - t}} \]

      2. lower--.f64 76.6%

         \[\leadsto x + y \cdot \frac{z}{a - \color{blue}{t}} \]

   4. Applied rewrites 76.6%

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + y \cdot \frac{z}{a - t}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \frac{z}{a - t} + x} \]

      3. add-flip N/A

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

      4. sub-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. remove-double-neg N/A

         \[\leadsto \frac{z}{a - t} \cdot y + \color{blue}{x} \]

      8. lower-fma.f64 76.6%

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

   6. Applied rewrites 76.6%

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

   if -1e12 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around 0

      \[\leadsto x + y \cdot \frac{z - t}{\color{blue}{a}} \]
   3. Step-by-step derivation

   4. Applied rewrites 61.2%

      \[\leadsto x + y \cdot \frac{z - t}{\color{blue}{a}} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + y \cdot \frac{z - t}{a}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{a} + x} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{a}} + x \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\frac{z - t}{a} \cdot y} + x \]

      5. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{z - t}{a}} \cdot y + x \]

      6. mult-flip N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. mult-flip N/A

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

      12. lower-/.f64 62.1%

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

   6. Applied rewrites 62.1%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.0002

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

      \[\leadsto \color{blue}{x + y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 95.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 (fma (/ y (- t a)) (- t z) x))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{x + y \cdot \frac{z - t}{a - t}} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{a - t} + x} \]

   3. lift-*.f64 N/A

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{a - t}} + x \]

   4. lift-/.f64 N/A

      \[\leadsto y \cdot \color{blue}{\frac{z - t}{a - t}} + x \]

   5. mult-flip N/A

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

   6. *-commutative N/A

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

   7. associate-*r* N/A

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

   8. remove-double-neg N/A

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

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

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

   10. mult-flip-rev N/A

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

   11. frac-2neg-rev N/A

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

   12. remove-double-neg N/A

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

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

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

   14. distribute-rgt-neg-in N/A

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

   15. lower-fma.f64 N/A

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

3. Applied rewrites 95.8%

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

Alternative 4: 91.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (/ z (- a t)) y x)))
   (if (<= t_1 5e-34) t_2 (if (<= t_1 1.0002) (+ x y) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= 5e-34) {
		tmp = t_2;
	} else if (t_1 <= 1.0002) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= 5e-34)
		tmp = t_2;
	elseif (t_1 <= 1.0002)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, 5e-34], t$95$2, If[LessEqual[t$95$1, 1.0002], N[(x + y), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34 or 1.0002 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in z around inf

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto x + y \cdot \frac{z}{\color{blue}{a - t}} \]

      2. lower--.f64 76.6%

         \[\leadsto x + y \cdot \frac{z}{a - \color{blue}{t}} \]

   4. Applied rewrites 76.6%

      \[\leadsto x + y \cdot \color{blue}{\frac{z}{a - t}} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + y \cdot \frac{z}{a - t}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \frac{z}{a - t} + x} \]

      3. add-flip N/A

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

      4. sub-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. remove-double-neg N/A

         \[\leadsto \frac{z}{a - t} \cdot y + \color{blue}{x} \]

      8. lower-fma.f64 76.6%

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

   6. Applied rewrites 76.6%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.0002

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

      \[\leadsto \color{blue}{x + y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 80.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 5e-34)
     (fma (/ z a) y x)
     (if (<= t_1 50000000.0) (+ x y) (/ (* y z) (- a t))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= 5e-34) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 50000000.0) {
		tmp = x + y;
	} else {
		tmp = (y * z) / (a - t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= 5e-34)
		tmp = fma(Float64(z / a), y, x);
	elseif (t_1 <= 50000000.0)
		tmp = Float64(x + y);
	else
		tmp = Float64(Float64(y * z) / Float64(a - t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 61.7%

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

   4. Applied rewrites 61.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 61.7%

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

   6. Applied rewrites 61.7%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5e7

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

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

   if 5e7 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{y \cdot z}{a - t}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 27.3%

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

   4. Applied rewrites 27.3%

      \[\leadsto \color{blue}{\frac{y \cdot z}{a - t}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 79.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (/ z a) y x)))
   (if (<= t_1 5e-34) t_2 (if (<= t_1 5000.0) (+ x y) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((z / a), y, x);
	double tmp;
	if (t_1 <= 5e-34) {
		tmp = t_2;
	} else if (t_1 <= 5000.0) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(z / a), y, x)
	tmp = 0.0
	if (t_1 <= 5e-34)
		tmp = t_2;
	elseif (t_1 <= 5000.0)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, 5e-34], t$95$2, If[LessEqual[t$95$1, 5000.0], N[(x + y), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34 or 5e3 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 61.7%

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

   4. Applied rewrites 61.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 61.7%

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

   6. Applied rewrites 61.7%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5e3

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

      \[\leadsto \color{blue}{x + y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 65.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 10^{-111}:\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- a t)) 1e-111) (* 1.0 x) (+ x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 1e-111) {
		tmp = 1.0 * x;
	} else {
		tmp = x + y;
	}
	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, a)
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), intent (in) :: a
    real(8) :: tmp
    if (((z - t) / (a - t)) <= 1d-111) then
        tmp = 1.0d0 * x
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (a - t)) <= 1e-111:
		tmp = 1.0 * x
	else:
		tmp = x + y
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision], 1e-111], N[(1.0 * x), $MachinePrecision], N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 1.00000000000000009e-111

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

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

      1. lift-+.f64 N/A

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

      2. sum-to-mult N/A

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

      3. lower-unsound-*.f64 N/A

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

      4. lower-unsound-+.f64 N/A

         \[\leadsto \left(1 + \frac{y}{x}\right) \cdot x \]

      5. lower-unsound-/.f64 57.0%

         \[\leadsto \left(1 + \frac{y}{x}\right) \cdot x \]

   6. Applied rewrites 57.0%

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

   7. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   8. Step-by-step derivation

   9. Applied rewrites 49.9%

      \[\leadsto 1 \cdot x \]

   if 1.00000000000000009e-111 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]

   2. Taylor expanded in t around inf

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

      1. lower-+.f64 59.5%

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

   4. Applied rewrites 59.5%

      \[\leadsto \color{blue}{x + y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 59.5% accurate, 4.1× speedup

Math

\[x + y \]

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return 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, a)
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), intent (in) :: a
    code = x + y
end function

Java

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

Python

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

Julia

function code(x, y, z, t, a)
	return Float64(x + y)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{a - t} \]

2. Taylor expanded in t around inf

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

   1. lower-+.f64 59.5%

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

4. Applied rewrites 59.5%

   \[\leadsto \color{blue}{x + y} \]
5. Add Preprocessing

Alternative 9: 18.4% accurate, 15.3× speedup

Math

\[y \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := y

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{a - t} \]

2. Taylor expanded in t around inf

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

   1. lower-+.f64 59.5%

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

4. Applied rewrites 59.5%

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

5. Taylor expanded in x around 0

   \[\leadsto y \]
6. Step-by-step derivation

7. Applied rewrites 18.4%

   \[\leadsto y \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025188 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B"
  :precision binary64
  (+ x (* y (/ (- z t) (- a t)))))