Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23

Percentage Accurate: 99.9% → 99.9%

Time: 6.8s

Alternatives: 7

Speedup: 1.3×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 100.0

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

   4. lift-+.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 90.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot y + z\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+162} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+132}\right):\\ \;\;\;\;\mathsf{fma}\left(y, x, z\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 -5e+162) (not (<= t_1 2e+132)))
     (* (fma y x z) y)
     (fma z y t))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -5e+162) || !(t_1 <= 2e+132)) {
		tmp = fma(y, x, z) * y;
	} else {
		tmp = fma(z, y, t);
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -5e+162], N[Not[LessEqual[t$95$1, 2e+132]], $MachinePrecision]], N[(N[(y * x + z), $MachinePrecision] * y), $MachinePrecision], N[(z * y + t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -4.9999999999999997e162 or 1.99999999999999998e132 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 97.5%

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

   if -4.9999999999999997e162 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1.99999999999999998e132

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 91.3%

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

4. Final simplification 94.0%

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

Alternative 3: 80.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot y + z\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+227} \lor \neg \left(t\_1 \leq 10^{+297}\right):\\ \;\;\;\;\left(x \cdot y\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 -1e+227) (not (<= t_1 1e+297))) (* (* x y) y) (fma z y t))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -1e+227) || !(t_1 <= 1e+297)) {
		tmp = (x * y) * y;
	} else {
		tmp = fma(z, y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if ((t_1 <= -1e+227) || !(t_1 <= 1e+297))
		tmp = Float64(Float64(x * y) * y);
	else
		tmp = fma(z, y, t);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.0000000000000001e227 or 1e297 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 80.5%

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

   7. Applied rewrites 81.5%

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

   if -1.0000000000000001e227 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1e297

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 87.5%

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

4. Final simplification 85.4%

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

Alternative 4: 81.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.0000000000000001e227

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.4%

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

   7. Applied rewrites 77.3%

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

   if -1.0000000000000001e227 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1e297

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 87.5%

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

   if 1e297 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 94.2%

      \[\leadsto \color{blue}{\left(y \cdot y\right) \cdot x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 52.3% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 -2e+132) (not (<= t_1 1e+47))) (* z y) t)))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -2e+132) || !(t_1 <= 1e+47)) {
		tmp = z * y;
	} else {
		tmp = t;
	}
	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) * y
    if ((t_1 <= (-2d+132)) .or. (.not. (t_1 <= 1d+47))) then
        tmp = z * y
    else
        tmp = t
    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) * y;
	double tmp;
	if ((t_1 <= -2e+132) || !(t_1 <= 1e+47)) {
		tmp = z * y;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((x * y) + z) * y
	tmp = 0
	if (t_1 <= -2e+132) or not (t_1 <= 1e+47):
		tmp = z * y
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if ((t_1 <= -2e+132) || !(t_1 <= 1e+47))
		tmp = Float64(z * y);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((x * y) + z) * y;
	tmp = 0.0;
	if ((t_1 <= -2e+132) || ~((t_1 <= 1e+47)))
		tmp = z * y;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -2e+132], N[Not[LessEqual[t$95$1, 1e+47]], $MachinePrecision]], N[(z * y), $MachinePrecision], t]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.99999999999999998e132 or 1e47 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 37.1%

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

   if -1.99999999999999998e132 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1e47

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 75.4%

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

4. Final simplification 55.8%

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

Alternative 6: 65.7% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 67.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
6. Add Preprocessing

Alternative 7: 38.6% accurate, 17.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

5. Applied rewrites 41.0%

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

Reproduce

herbie shell --seed 2025019 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))