Rosa's FloatVsDoubleBenchmark

Percentage Accurate: 70.2% → 99.6%

Time: 16.8s

Alternatives: 19

Speedup: 7.4×

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

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 70.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_3 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_3 INFINITY)
     t_3
     (*
      (- 6.0 (/ (- 3.0 (/ (fma (- (* 2.0 x2) 3.0) 4.0 9.0) x1)) x1))
      (pow x1 4.0)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = (6.0 - ((3.0 - (fma(((2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * pow(x1, 4.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_3 <= Inf)
		tmp = t_3;
	else
		tmp = Float64(Float64(6.0 - Float64(Float64(3.0 - Float64(fma(Float64(Float64(2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * (x1 ^ 4.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, Infinity], t$95$3, N[(N[(6.0 - N[(N[(3.0 - N[(N[(N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0 + 9.0), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 78.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot x1\\ t_1 := \left(3 \cdot x1\right) \cdot x1\\ t_2 := x1 \cdot x1 + 1\\ t_3 := \frac{\left(t\_1 + 2 \cdot x2\right) - x1}{t\_2}\\ t_4 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_2 + t\_1 \cdot t\_3\right) + t\_0\right) + x1\right) + 3 \cdot \frac{\left(t\_1 - 2 \cdot x2\right) - x1}{t\_2}\right)\\ t_5 := \mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right)\\ \mathbf{if}\;t\_4 \leq -4 \cdot 10^{+125}:\\ \;\;\;\;t\_5\\ \mathbf{elif}\;t\_4 \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+282}:\\ \;\;\;\;\left(t\_0 \cdot x1\right) \cdot 6\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_5\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) x1))
        (t_1 (* (* 3.0 x1) x1))
        (t_2 (+ (* x1 x1) 1.0))
        (t_3 (/ (- (+ t_1 (* 2.0 x2)) x1) t_2))
        (t_4
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_3) (- t_3 3.0))
                (* (* x1 x1) (- (* 4.0 t_3) 6.0)))
               t_2)
              (* t_1 t_3))
             t_0)
            x1)
           (* 3.0 (/ (- (- t_1 (* 2.0 x2)) x1) t_2)))))
        (t_5 (fma (* (* x2 x2) 8.0) x1 (* -6.0 x2))))
   (if (<= t_4 -4e+125)
     t_5
     (if (<= t_4 1e+67)
       (fma (- (* 9.0 x1) 1.0) x1 (* -6.0 x2))
       (if (<= t_4 2e+282)
         (* (* t_0 x1) 6.0)
         (if (<= t_4 INFINITY) t_5 (* (* x1 x1) (* (* x1 x1) 6.0))))))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (3.0 * x1) * x1;
	double t_2 = (x1 * x1) + 1.0;
	double t_3 = ((t_1 + (2.0 * x2)) - x1) / t_2;
	double t_4 = x1 + (((((((((2.0 * x1) * t_3) * (t_3 - 3.0)) + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_2) + (t_1 * t_3)) + t_0) + x1) + (3.0 * (((t_1 - (2.0 * x2)) - x1) / t_2)));
	double t_5 = fma(((x2 * x2) * 8.0), x1, (-6.0 * x2));
	double tmp;
	if (t_4 <= -4e+125) {
		tmp = t_5;
	} else if (t_4 <= 1e+67) {
		tmp = fma(((9.0 * x1) - 1.0), x1, (-6.0 * x2));
	} else if (t_4 <= 2e+282) {
		tmp = (t_0 * x1) * 6.0;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_5;
	} else {
		tmp = (x1 * x1) * ((x1 * x1) * 6.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * x1)
	t_1 = Float64(Float64(3.0 * x1) * x1)
	t_2 = Float64(Float64(x1 * x1) + 1.0)
	t_3 = Float64(Float64(Float64(t_1 + Float64(2.0 * x2)) - x1) / t_2)
	t_4 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_2) + Float64(t_1 * t_3)) + t_0) + x1) + Float64(3.0 * Float64(Float64(Float64(t_1 - Float64(2.0 * x2)) - x1) / t_2))))
	t_5 = fma(Float64(Float64(x2 * x2) * 8.0), x1, Float64(-6.0 * x2))
	tmp = 0.0
	if (t_4 <= -4e+125)
		tmp = t_5;
	elseif (t_4 <= 1e+67)
		tmp = fma(Float64(Float64(9.0 * x1) - 1.0), x1, Float64(-6.0 * x2));
	elseif (t_4 <= 2e+282)
		tmp = Float64(Float64(t_0 * x1) * 6.0);
	elseif (t_4 <= Inf)
		tmp = t_5;
	else
		tmp = Float64(Float64(x1 * x1) * Float64(Float64(x1 * x1) * 6.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$1 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] + N[(t$95$1 * t$95$3), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$1 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(x2 * x2), $MachinePrecision] * 8.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -4e+125], t$95$5, If[LessEqual[t$95$4, 1e+67], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 2e+282], N[(N[(t$95$0 * x1), $MachinePrecision] * 6.0), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$5, N[(N[(x1 * x1), $MachinePrecision] * N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -3.9999999999999997e125 or 2.00000000000000007e282 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 72.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(8 \cdot {x2}^{2}, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 70.7%

      \[\leadsto \mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right) \]

   if -3.9999999999999997e125 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 9.99999999999999983e66

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 98.0%

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]

   if 9.99999999999999983e66 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000007e282

   1. Initial program 98.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 27.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 52.9

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 52.9%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 52.8%

       \[\leadsto \left(\left(\left(x1 \cdot x1\right) \cdot \left(-x1\right)\right) \cdot \left(-x1\right)\right) \cdot 6 \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 98.8

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 98.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.8%

       \[\leadsto \left(x1 \cdot x1\right) \cdot \color{blue}{\left(\left(x1 \cdot x1\right) \cdot 6\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq -4 \cdot 10^{+125}:\\ \;\;\;\;\mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq 2 \cdot 10^{+282}:\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{elif}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 78.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right)\\ \mathbf{if}\;t\_3 \leq -4 \cdot 10^{+125}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+282}:\\ \;\;\;\;\left(\left(x1 \cdot x1\right) \cdot \left(x1 \cdot x1\right)\right) \cdot 6\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (fma (* (* x2 x2) 8.0) x1 (* -6.0 x2))))
   (if (<= t_3 -4e+125)
     t_4
     (if (<= t_3 1e+67)
       (fma (- (* 9.0 x1) 1.0) x1 (* -6.0 x2))
       (if (<= t_3 2e+282)
         (* (* (* x1 x1) (* x1 x1)) 6.0)
         (if (<= t_3 INFINITY) t_4 (* (* x1 x1) (* (* x1 x1) 6.0))))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = fma(((x2 * x2) * 8.0), x1, (-6.0 * x2));
	double tmp;
	if (t_3 <= -4e+125) {
		tmp = t_4;
	} else if (t_3 <= 1e+67) {
		tmp = fma(((9.0 * x1) - 1.0), x1, (-6.0 * x2));
	} else if (t_3 <= 2e+282) {
		tmp = ((x1 * x1) * (x1 * x1)) * 6.0;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = (x1 * x1) * ((x1 * x1) * 6.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = fma(Float64(Float64(x2 * x2) * 8.0), x1, Float64(-6.0 * x2))
	tmp = 0.0
	if (t_3 <= -4e+125)
		tmp = t_4;
	elseif (t_3 <= 1e+67)
		tmp = fma(Float64(Float64(9.0 * x1) - 1.0), x1, Float64(-6.0 * x2));
	elseif (t_3 <= 2e+282)
		tmp = Float64(Float64(Float64(x1 * x1) * Float64(x1 * x1)) * 6.0);
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(Float64(x1 * x1) * Float64(Float64(x1 * x1) * 6.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x2 * x2), $MachinePrecision] * 8.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -4e+125], t$95$4, If[LessEqual[t$95$3, 1e+67], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+282], N[(N[(N[(x1 * x1), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision] * 6.0), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(x1 * x1), $MachinePrecision] * N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -3.9999999999999997e125 or 2.00000000000000007e282 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 72.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(8 \cdot {x2}^{2}, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 70.7%

      \[\leadsto \mathsf{fma}\left(\left(x2 \cdot x2\right) \cdot 8, x1, -6 \cdot x2\right) \]

   if -3.9999999999999997e125 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 9.99999999999999983e66

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 98.0%

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]

   if 9.99999999999999983e66 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000007e282

   1. Initial program 98.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 27.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 52.9

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 52.9%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 52.7%

       \[\leadsto \left(\left(x1 \cdot x1\right) \cdot \left(x1 \cdot x1\right)\right) \cdot 6 \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 98.8

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 98.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.8%

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

Alternative 4: 78.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \mathbf{if}\;t\_3 \leq -2 \cdot 10^{+246}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+282} \lor \neg \left(t\_3 \leq \infty\right):\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \mathbf{else}:\\ \;\;\;\;t\_4\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* (* (* x2 x2) x1) 8.0)))
   (if (<= t_3 -2e+246)
     t_4
     (if (<= t_3 1e+67)
       (fma (- (* 9.0 x1) 1.0) x1 (* -6.0 x2))
       (if (or (<= t_3 2e+282) (not (<= t_3 INFINITY)))
         (* (* x1 x1) (* (* x1 x1) 6.0))
         t_4)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = ((x2 * x2) * x1) * 8.0;
	double tmp;
	if (t_3 <= -2e+246) {
		tmp = t_4;
	} else if (t_3 <= 1e+67) {
		tmp = fma(((9.0 * x1) - 1.0), x1, (-6.0 * x2));
	} else if ((t_3 <= 2e+282) || !(t_3 <= ((double) INFINITY))) {
		tmp = (x1 * x1) * ((x1 * x1) * 6.0);
	} else {
		tmp = t_4;
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(Float64(Float64(x2 * x2) * x1) * 8.0)
	tmp = 0.0
	if (t_3 <= -2e+246)
		tmp = t_4;
	elseif (t_3 <= 1e+67)
		tmp = fma(Float64(Float64(9.0 * x1) - 1.0), x1, Float64(-6.0 * x2));
	elseif ((t_3 <= 2e+282) || !(t_3 <= Inf))
		tmp = Float64(Float64(x1 * x1) * Float64(Float64(x1 * x1) * 6.0));
	else
		tmp = t_4;
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x2 * x2), $MachinePrecision] * x1), $MachinePrecision] * 8.0), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+246], t$95$4, If[LessEqual[t$95$3, 1e+67], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$3, 2e+282], N[Not[LessEqual[t$95$3, Infinity]], $MachinePrecision]], N[(N[(x1 * x1), $MachinePrecision] * N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision], t$95$4]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -2.00000000000000014e246 or 2.00000000000000007e282 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 74.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 71.9%

      \[\leadsto \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot \color{blue}{8} \]

   if -2.00000000000000014e246 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 9.99999999999999983e66

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 95.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 94.4%

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]

   if 9.99999999999999983e66 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000007e282 or +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 33.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 48.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 83.3

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 83.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 83.2%

       \[\leadsto \left(x1 \cdot x1\right) \cdot \color{blue}{\left(\left(x1 \cdot x1\right) \cdot 6\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq -2 \cdot 10^{+246}:\\ \;\;\;\;\left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \mathbf{elif}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq 2 \cdot 10^{+282} \lor \neg \left(x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \leq \infty\right):\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \mathbf{if}\;t\_3 \leq -2 \cdot 10^{+246}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 10^{+67}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+282}:\\ \;\;\;\;\left(\left(x1 \cdot x1\right) \cdot \left(x1 \cdot x1\right)\right) \cdot 6\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot \left(\left(x1 \cdot x1\right) \cdot 6\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* (* (* x2 x2) x1) 8.0)))
   (if (<= t_3 -2e+246)
     t_4
     (if (<= t_3 1e+67)
       (fma (- (* 9.0 x1) 1.0) x1 (* -6.0 x2))
       (if (<= t_3 2e+282)
         (* (* (* x1 x1) (* x1 x1)) 6.0)
         (if (<= t_3 INFINITY) t_4 (* (* x1 x1) (* (* x1 x1) 6.0))))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = ((x2 * x2) * x1) * 8.0;
	double tmp;
	if (t_3 <= -2e+246) {
		tmp = t_4;
	} else if (t_3 <= 1e+67) {
		tmp = fma(((9.0 * x1) - 1.0), x1, (-6.0 * x2));
	} else if (t_3 <= 2e+282) {
		tmp = ((x1 * x1) * (x1 * x1)) * 6.0;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = (x1 * x1) * ((x1 * x1) * 6.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(Float64(Float64(x2 * x2) * x1) * 8.0)
	tmp = 0.0
	if (t_3 <= -2e+246)
		tmp = t_4;
	elseif (t_3 <= 1e+67)
		tmp = fma(Float64(Float64(9.0 * x1) - 1.0), x1, Float64(-6.0 * x2));
	elseif (t_3 <= 2e+282)
		tmp = Float64(Float64(Float64(x1 * x1) * Float64(x1 * x1)) * 6.0);
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(Float64(x1 * x1) * Float64(Float64(x1 * x1) * 6.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x2 * x2), $MachinePrecision] * x1), $MachinePrecision] * 8.0), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+246], t$95$4, If[LessEqual[t$95$3, 1e+67], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+282], N[(N[(N[(x1 * x1), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision] * 6.0), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(x1 * x1), $MachinePrecision] * N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -2.00000000000000014e246 or 2.00000000000000007e282 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 74.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 71.9%

      \[\leadsto \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot \color{blue}{8} \]

   if -2.00000000000000014e246 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 9.99999999999999983e66

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 95.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 94.4%

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]

   if 9.99999999999999983e66 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000007e282

   1. Initial program 98.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 27.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 52.9

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 52.9%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 52.7%

       \[\leadsto \left(\left(x1 \cdot x1\right) \cdot \left(x1 \cdot x1\right)\right) \cdot 6 \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 98.8

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 98.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.8%

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

Alternative 6: 73.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \mathbf{if}\;t\_3 \leq -2 \cdot 10^{+246}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+232}:\\ \;\;\;\;\mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot 9\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* (* (* x2 x2) x1) 8.0)))
   (if (<= t_3 -2e+246)
     t_4
     (if (<= t_3 2e+232)
       (fma (- (* 9.0 x1) 1.0) x1 (* -6.0 x2))
       (if (<= t_3 INFINITY) t_4 (* (* x1 x1) 9.0))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = ((x2 * x2) * x1) * 8.0;
	double tmp;
	if (t_3 <= -2e+246) {
		tmp = t_4;
	} else if (t_3 <= 2e+232) {
		tmp = fma(((9.0 * x1) - 1.0), x1, (-6.0 * x2));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = (x1 * x1) * 9.0;
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(Float64(Float64(x2 * x2) * x1) * 8.0)
	tmp = 0.0
	if (t_3 <= -2e+246)
		tmp = t_4;
	elseif (t_3 <= 2e+232)
		tmp = fma(Float64(Float64(9.0 * x1) - 1.0), x1, Float64(-6.0 * x2));
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(Float64(x1 * x1) * 9.0);
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x2 * x2), $MachinePrecision] * x1), $MachinePrecision] * 8.0), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+246], t$95$4, If[LessEqual[t$95$3, 2e+232], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(x1 * x1), $MachinePrecision] * 9.0), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -2.00000000000000014e246 or 2.00000000000000011e232 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 62.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 60.3%

      \[\leadsto \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot \color{blue}{8} \]

   if -2.00000000000000014e246 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000011e232

   1. Initial program 99.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 79.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 78.5%

      \[\leadsto \mathsf{fma}\left(9 \cdot x1 - 1, x1, -6 \cdot x2\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 84.0%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around inf

      \[\leadsto 9 \cdot {x1}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 84.0%

       \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 61.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot 8\\ \mathbf{if}\;t\_3 \leq -2 \cdot 10^{+246}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+232}:\\ \;\;\;\;-6 \cdot x2\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot 9\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* (* (* x2 x2) x1) 8.0)))
   (if (<= t_3 -2e+246)
     t_4
     (if (<= t_3 2e+232)
       (* -6.0 x2)
       (if (<= t_3 INFINITY) t_4 (* (* x1 x1) 9.0))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = ((x2 * x2) * x1) * 8.0;
	double tmp;
	if (t_3 <= -2e+246) {
		tmp = t_4;
	} else if (t_3 <= 2e+232) {
		tmp = -6.0 * x2;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = (x1 * x1) * 9.0;
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = ((x2 * x2) * x1) * 8.0;
	double tmp;
	if (t_3 <= -2e+246) {
		tmp = t_4;
	} else if (t_3 <= 2e+232) {
		tmp = -6.0 * x2;
	} else if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_4;
	} else {
		tmp = (x1 * x1) * 9.0;
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))
	t_4 = ((x2 * x2) * x1) * 8.0
	tmp = 0
	if t_3 <= -2e+246:
		tmp = t_4
	elif t_3 <= 2e+232:
		tmp = -6.0 * x2
	elif t_3 <= math.inf:
		tmp = t_4
	else:
		tmp = (x1 * x1) * 9.0
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(Float64(Float64(x2 * x2) * x1) * 8.0)
	tmp = 0.0
	if (t_3 <= -2e+246)
		tmp = t_4;
	elseif (t_3 <= 2e+232)
		tmp = Float64(-6.0 * x2);
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(Float64(x1 * x1) * 9.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	t_4 = ((x2 * x2) * x1) * 8.0;
	tmp = 0.0;
	if (t_3 <= -2e+246)
		tmp = t_4;
	elseif (t_3 <= 2e+232)
		tmp = -6.0 * x2;
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = (x1 * x1) * 9.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x2 * x2), $MachinePrecision] * x1), $MachinePrecision] * 8.0), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+246], t$95$4, If[LessEqual[t$95$3, 2e+232], N[(-6.0 * x2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(x1 * x1), $MachinePrecision] * 9.0), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -2.00000000000000014e246 or 2.00000000000000011e232 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 62.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 60.3%

      \[\leadsto \left(\left(x2 \cdot x2\right) \cdot x1\right) \cdot \color{blue}{8} \]

   if -2.00000000000000014e246 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000011e232

   1. Initial program 99.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

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

      1. lower-*.f64 52.2

         \[\leadsto \color{blue}{-6 \cdot x2} \]

   5. Applied rewrites 52.2%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 84.0%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around inf

      \[\leadsto 9 \cdot {x1}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 84.0%

       \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 98.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := \left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\\ t_4 := x1 + \left(t\_3 + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_4 \leq 0.01:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;x1 + \left(t\_3 + 3 \cdot \left(-2 \cdot x2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          (+
           (+
            (*
             (+
              (* (* (* 2.0 x1) t_2) (- t_2 3.0))
              (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
             t_1)
            (* t_0 t_2))
           (* (* x1 x1) x1))
          x1))
        (t_4 (+ x1 (+ t_3 (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_4 0.01)
     (fma
      (fma (* 8.0 x1) x2 (- (* (- (* 12.0 x1) 12.0) x1) 6.0))
      x2
      (* (- (* 9.0 x1) 1.0) x1))
     (if (<= t_4 INFINITY)
       (+ x1 (+ t_3 (* 3.0 (* -2.0 x2))))
       (*
        (- 6.0 (/ (- 3.0 (/ (fma (- (* 2.0 x2) 3.0) 4.0 9.0) x1)) x1))
        (pow x1 4.0))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = (((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1;
	double t_4 = x1 + (t_3 + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_4 <= 0.01) {
		tmp = fma(fma((8.0 * x1), x2, ((((12.0 * x1) - 12.0) * x1) - 6.0)), x2, (((9.0 * x1) - 1.0) * x1));
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = x1 + (t_3 + (3.0 * (-2.0 * x2)));
	} else {
		tmp = (6.0 - ((3.0 - (fma(((2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * pow(x1, 4.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1)
	t_4 = Float64(x1 + Float64(t_3 + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_4 <= 0.01)
		tmp = fma(fma(Float64(8.0 * x1), x2, Float64(Float64(Float64(Float64(12.0 * x1) - 12.0) * x1) - 6.0)), x2, Float64(Float64(Float64(9.0 * x1) - 1.0) * x1));
	elseif (t_4 <= Inf)
		tmp = Float64(x1 + Float64(t_3 + Float64(3.0 * Float64(-2.0 * x2))));
	else
		tmp = Float64(Float64(6.0 - Float64(Float64(3.0 - Float64(fma(Float64(Float64(2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * (x1 ^ 4.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision]}, Block[{t$95$4 = N[(x1 + N[(t$95$3 + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.01], N[(N[(N[(8.0 * x1), $MachinePrecision] * x2 + N[(N[(N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision] * x1), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision] * x2 + N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(x1 + N[(t$95$3 + N[(3.0 * N[(-2.0 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(6.0 - N[(N[(3.0 - N[(N[(N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0 + 9.0), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 0.0100000000000000002

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 91.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.7%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), \color{blue}{x2}, \left(9 \cdot x1 - 1\right) \cdot x1\right) \]

   if 0.0100000000000000002 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \color{blue}{\left(-2 \cdot x2\right)}\right) \]
   4. Step-by-step derivation

      1. lower-*.f64 99.5

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \color{blue}{\left(-2 \cdot x2\right)}\right) \]

   5. Applied rewrites 99.5%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \color{blue}{\left(-2 \cdot x2\right)}\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 97.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := \left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}\\ t_2 := x1 \cdot x1 + 1\\ t_3 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_2}\\ \mathbf{if}\;x1 \leq -155000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x1 \leq 3.1 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \mathbf{elif}\;x1 \leq 2 \cdot 10^{+78}:\\ \;\;\;\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_2 + t\_0 \cdot t\_3\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot 3\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1
         (*
          (- 6.0 (/ (- 3.0 (/ (fma (- (* 2.0 x2) 3.0) 4.0 9.0) x1)) x1))
          (pow x1 4.0)))
        (t_2 (+ (* x1 x1) 1.0))
        (t_3 (/ (- (+ t_0 (* 2.0 x2)) x1) t_2)))
   (if (<= x1 -155000000.0)
     t_1
     (if (<= x1 3.1e-6)
       (fma
        (fma (* 8.0 x1) x2 (- (* (- (* 12.0 x1) 12.0) x1) 6.0))
        x2
        (* (- (* 9.0 x1) 1.0) x1))
       (if (<= x1 2e+78)
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_3) (- t_3 3.0))
                (* (* x1 x1) (- (* 4.0 t_3) 6.0)))
               t_2)
              (* t_0 t_3))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 3.0)))
         t_1)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (6.0 - ((3.0 - (fma(((2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * pow(x1, 4.0);
	double t_2 = (x1 * x1) + 1.0;
	double t_3 = ((t_0 + (2.0 * x2)) - x1) / t_2;
	double tmp;
	if (x1 <= -155000000.0) {
		tmp = t_1;
	} else if (x1 <= 3.1e-6) {
		tmp = fma(fma((8.0 * x1), x2, ((((12.0 * x1) - 12.0) * x1) - 6.0)), x2, (((9.0 * x1) - 1.0) * x1));
	} else if (x1 <= 2e+78) {
		tmp = x1 + (((((((((2.0 * x1) * t_3) * (t_3 - 3.0)) + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_2) + (t_0 * t_3)) + ((x1 * x1) * x1)) + x1) + (3.0 * 3.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(6.0 - Float64(Float64(3.0 - Float64(fma(Float64(Float64(2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * (x1 ^ 4.0))
	t_2 = Float64(Float64(x1 * x1) + 1.0)
	t_3 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_2)
	tmp = 0.0
	if (x1 <= -155000000.0)
		tmp = t_1;
	elseif (x1 <= 3.1e-6)
		tmp = fma(fma(Float64(8.0 * x1), x2, Float64(Float64(Float64(Float64(12.0 * x1) - 12.0) * x1) - 6.0)), x2, Float64(Float64(Float64(9.0 * x1) - 1.0) * x1));
	elseif (x1 <= 2e+78)
		tmp = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_2) + Float64(t_0 * t_3)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * 3.0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(6.0 - N[(N[(3.0 - N[(N[(N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0 + 9.0), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[x1, -155000000.0], t$95$1, If[LessEqual[x1, 3.1e-6], N[(N[(N[(8.0 * x1), $MachinePrecision] * x2 + N[(N[(N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision] * x1), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision] * x2 + N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x1, 2e+78], N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] + N[(t$95$0 * t$95$3), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -1.55e8 or 2.00000000000000002e78 < x1

   1. Initial program 26.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   5. Applied rewrites 98.1%

      \[\leadsto \color{blue}{\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   if -1.55e8 < x1 < 3.1e-6

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 89.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.1%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), \color{blue}{x2}, \left(9 \cdot x1 - 1\right) \cdot x1\right) \]

   if 3.1e-6 < x1 < 2.00000000000000002e78

   1. Initial program 98.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \color{blue}{3}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 98.9%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \color{blue}{3}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 95.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -155000000 \lor \neg \left(x1 \leq 1550\right):\\ \;\;\;\;\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -155000000.0) (not (<= x1 1550.0)))
   (*
    (- 6.0 (/ (- 3.0 (/ (fma (- (* 2.0 x2) 3.0) 4.0 9.0) x1)) x1))
    (pow x1 4.0))
   (fma
    (fma (* 8.0 x1) x2 (- (* (- (* 12.0 x1) 12.0) x1) 6.0))
    x2
    (* (- (* 9.0 x1) 1.0) x1))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -155000000.0) || !(x1 <= 1550.0)) {
		tmp = (6.0 - ((3.0 - (fma(((2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * pow(x1, 4.0);
	} else {
		tmp = fma(fma((8.0 * x1), x2, ((((12.0 * x1) - 12.0) * x1) - 6.0)), x2, (((9.0 * x1) - 1.0) * x1));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -155000000.0) || !(x1 <= 1550.0))
		tmp = Float64(Float64(6.0 - Float64(Float64(3.0 - Float64(fma(Float64(Float64(2.0 * x2) - 3.0), 4.0, 9.0) / x1)) / x1)) * (x1 ^ 4.0));
	else
		tmp = fma(fma(Float64(8.0 * x1), x2, Float64(Float64(Float64(Float64(12.0 * x1) - 12.0) * x1) - 6.0)), x2, Float64(Float64(Float64(9.0 * x1) - 1.0) * x1));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -155000000.0], N[Not[LessEqual[x1, 1550.0]], $MachinePrecision]], N[(N[(6.0 - N[(N[(3.0 - N[(N[(N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0 + 9.0), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[(8.0 * x1), $MachinePrecision] * x2 + N[(N[(N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision] * x1), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision] * x2 + N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -1.55e8 or 1550 < x1

   1. Initial program 37.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}} \]

   if -1.55e8 < x1 < 1550

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 88.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.7%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), \color{blue}{x2}, \left(9 \cdot x1 - 1\right) \cdot x1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -155000000 \lor \neg \left(x1 \leq 1550\right):\\ \;\;\;\;\left(6 - \frac{3 - \frac{\mathsf{fma}\left(2 \cdot x2 - 3, 4, 9\right)}{x1}}{x1}\right) \cdot {x1}^{4}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 92.9% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -350000000:\\ \;\;\;\;{x1}^{4} \cdot 6\\ \mathbf{elif}\;x1 \leq 1.45 \cdot 10^{+33}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (<= x1 -350000000.0)
   (* (pow x1 4.0) 6.0)
   (if (<= x1 1.45e+33)
     (fma
      (fma (* 8.0 x1) x2 (- (* (- (* 12.0 x1) 12.0) x1) 6.0))
      x2
      (* (- (* 9.0 x1) 1.0) x1))
     (* (* (* (* x1 x1) x1) x1) 6.0))))

C

double code(double x1, double x2) {
	double tmp;
	if (x1 <= -350000000.0) {
		tmp = pow(x1, 4.0) * 6.0;
	} else if (x1 <= 1.45e+33) {
		tmp = fma(fma((8.0 * x1), x2, ((((12.0 * x1) - 12.0) * x1) - 6.0)), x2, (((9.0 * x1) - 1.0) * x1));
	} else {
		tmp = (((x1 * x1) * x1) * x1) * 6.0;
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if (x1 <= -350000000.0)
		tmp = Float64((x1 ^ 4.0) * 6.0);
	elseif (x1 <= 1.45e+33)
		tmp = fma(fma(Float64(8.0 * x1), x2, Float64(Float64(Float64(Float64(12.0 * x1) - 12.0) * x1) - 6.0)), x2, Float64(Float64(Float64(9.0 * x1) - 1.0) * x1));
	else
		tmp = Float64(Float64(Float64(Float64(x1 * x1) * x1) * x1) * 6.0);
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[LessEqual[x1, -350000000.0], N[(N[Power[x1, 4.0], $MachinePrecision] * 6.0), $MachinePrecision], If[LessEqual[x1, 1.45e+33], N[(N[(N[(8.0 * x1), $MachinePrecision] * x2 + N[(N[(N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision] * x1), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision] * x2 + N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision] * x1), $MachinePrecision] * 6.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -3.5e8

   1. Initial program 25.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 39.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 93.3

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 93.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

   if -3.5e8 < x1 < 1.45000000000000012e33

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 87.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), \color{blue}{x2}, \left(9 \cdot x1 - 1\right) \cdot x1\right) \]

   if 1.45000000000000012e33 < x1

   1. Initial program 48.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 62.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 86.6

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 86.6%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 86.6%

       \[\leadsto \left(\left(\left(x1 \cdot x1\right) \cdot \left(-x1\right)\right) \cdot \left(-x1\right)\right) \cdot 6 \]
3. Recombined 3 regimes into one program.

4. Final simplification 93.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -350000000:\\ \;\;\;\;{x1}^{4} \cdot 6\\ \mathbf{elif}\;x1 \leq 1.45 \cdot 10^{+33}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 92.8% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 1.45 \cdot 10^{+33}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -350000000.0) (not (<= x1 1.45e+33)))
   (* (* (* (* x1 x1) x1) x1) 6.0)
   (fma
    (fma (* 8.0 x1) x2 (- (* (- (* 12.0 x1) 12.0) x1) 6.0))
    x2
    (* (- (* 9.0 x1) 1.0) x1))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -350000000.0) || !(x1 <= 1.45e+33)) {
		tmp = (((x1 * x1) * x1) * x1) * 6.0;
	} else {
		tmp = fma(fma((8.0 * x1), x2, ((((12.0 * x1) - 12.0) * x1) - 6.0)), x2, (((9.0 * x1) - 1.0) * x1));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -350000000.0) || !(x1 <= 1.45e+33))
		tmp = Float64(Float64(Float64(Float64(x1 * x1) * x1) * x1) * 6.0);
	else
		tmp = fma(fma(Float64(8.0 * x1), x2, Float64(Float64(Float64(Float64(12.0 * x1) - 12.0) * x1) - 6.0)), x2, Float64(Float64(Float64(9.0 * x1) - 1.0) * x1));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -350000000.0], N[Not[LessEqual[x1, 1.45e+33]], $MachinePrecision]], N[(N[(N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision] * x1), $MachinePrecision] * 6.0), $MachinePrecision], N[(N[(N[(8.0 * x1), $MachinePrecision] * x2 + N[(N[(N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision] * x1), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision] * x2 + N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -3.5e8 or 1.45000000000000012e33 < x1

   1. Initial program 35.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 90.3

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 90.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 90.2%

       \[\leadsto \left(\left(\left(x1 \cdot x1\right) \cdot \left(-x1\right)\right) \cdot \left(-x1\right)\right) \cdot 6 \]

   if -3.5e8 < x1 < 1.45000000000000012e33

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 87.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), \color{blue}{x2}, \left(9 \cdot x1 - 1\right) \cdot x1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 1.45 \cdot 10^{+33}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(8 \cdot x1, x2, \left(12 \cdot x1 - 12\right) \cdot x1 - 6\right), x2, \left(9 \cdot x1 - 1\right) \cdot x1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 87.0% accurate, 6.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 1.45 \cdot 10^{+33}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x2, -6, \left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, -12\right), x2, 9 \cdot x1\right) - 1\right) \cdot x1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -350000000.0) (not (<= x1 1.45e+33)))
   (* (* (* (* x1 x1) x1) x1) 6.0)
   (fma x2 -6.0 (* (- (fma (fma 8.0 x2 -12.0) x2 (* 9.0 x1)) 1.0) x1))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -350000000.0) || !(x1 <= 1.45e+33)) {
		tmp = (((x1 * x1) * x1) * x1) * 6.0;
	} else {
		tmp = fma(x2, -6.0, ((fma(fma(8.0, x2, -12.0), x2, (9.0 * x1)) - 1.0) * x1));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -350000000.0) || !(x1 <= 1.45e+33))
		tmp = Float64(Float64(Float64(Float64(x1 * x1) * x1) * x1) * 6.0);
	else
		tmp = fma(x2, -6.0, Float64(Float64(fma(fma(8.0, x2, -12.0), x2, Float64(9.0 * x1)) - 1.0) * x1));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -350000000.0], N[Not[LessEqual[x1, 1.45e+33]], $MachinePrecision]], N[(N[(N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision] * x1), $MachinePrecision] * 6.0), $MachinePrecision], N[(x2 * -6.0 + N[(N[(N[(N[(8.0 * x2 + -12.0), $MachinePrecision] * x2 + N[(9.0 * x1), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -3.5e8 or 1.45000000000000012e33 < x1

   1. Initial program 35.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 90.3

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 90.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 90.2%

       \[\leadsto \left(\left(\left(x1 \cdot x1\right) \cdot \left(-x1\right)\right) \cdot \left(-x1\right)\right) \cdot 6 \]

   if -3.5e8 < x1 < 1.45000000000000012e33

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 87.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(\left(9 \cdot x1 + x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 87.8%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, 12 \cdot x1 - 12\right), x2, 9 \cdot x1\right) - 1, x1, -6 \cdot x2\right) \]

   9. Taylor expanded in x1 around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, -12\right), x2, 9 \cdot x1\right) - 1, x1, -6 \cdot x2\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 87.8%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, -12\right), x2, 9 \cdot x1\right) - 1, x1, -6 \cdot x2\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 88.0%

       \[\leadsto \mathsf{fma}\left(x2, \color{blue}{-6}, \left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, -12\right), x2, 9 \cdot x1\right) - 1\right) \cdot x1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 1.45 \cdot 10^{+33}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x2, -6, \left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, -12\right), x2, 9 \cdot x1\right) - 1\right) \cdot x1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 55.4% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(9 \cdot x1 - 1\right) \cdot x1\\ \mathbf{if}\;x1 \leq -3.4 \cdot 10^{-61}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x1 \leq 2 \cdot 10^{-67}:\\ \;\;\;\;-6 \cdot x2\\ \mathbf{elif}\;x1 \leq 3.1 \cdot 10^{-6}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x1 \leq 4.4 \cdot 10^{+153}:\\ \;\;\;\;\left(\left(x1 \cdot x1\right) \cdot x2\right) \cdot 12\\ \mathbf{else}:\\ \;\;\;\;\left(x1 \cdot x1\right) \cdot 9\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (- (* 9.0 x1) 1.0) x1)))
   (if (<= x1 -3.4e-61)
     t_0
     (if (<= x1 2e-67)
       (* -6.0 x2)
       (if (<= x1 3.1e-6)
         t_0
         (if (<= x1 4.4e+153) (* (* (* x1 x1) x2) 12.0) (* (* x1 x1) 9.0)))))))

C

double code(double x1, double x2) {
	double t_0 = ((9.0 * x1) - 1.0) * x1;
	double tmp;
	if (x1 <= -3.4e-61) {
		tmp = t_0;
	} else if (x1 <= 2e-67) {
		tmp = -6.0 * x2;
	} else if (x1 <= 3.1e-6) {
		tmp = t_0;
	} else if (x1 <= 4.4e+153) {
		tmp = ((x1 * x1) * x2) * 12.0;
	} else {
		tmp = (x1 * x1) * 9.0;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((9.0d0 * x1) - 1.0d0) * x1
    if (x1 <= (-3.4d-61)) then
        tmp = t_0
    else if (x1 <= 2d-67) then
        tmp = (-6.0d0) * x2
    else if (x1 <= 3.1d-6) then
        tmp = t_0
    else if (x1 <= 4.4d+153) then
        tmp = ((x1 * x1) * x2) * 12.0d0
    else
        tmp = (x1 * x1) * 9.0d0
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double t_0 = ((9.0 * x1) - 1.0) * x1;
	double tmp;
	if (x1 <= -3.4e-61) {
		tmp = t_0;
	} else if (x1 <= 2e-67) {
		tmp = -6.0 * x2;
	} else if (x1 <= 3.1e-6) {
		tmp = t_0;
	} else if (x1 <= 4.4e+153) {
		tmp = ((x1 * x1) * x2) * 12.0;
	} else {
		tmp = (x1 * x1) * 9.0;
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = ((9.0 * x1) - 1.0) * x1
	tmp = 0
	if x1 <= -3.4e-61:
		tmp = t_0
	elif x1 <= 2e-67:
		tmp = -6.0 * x2
	elif x1 <= 3.1e-6:
		tmp = t_0
	elif x1 <= 4.4e+153:
		tmp = ((x1 * x1) * x2) * 12.0
	else:
		tmp = (x1 * x1) * 9.0
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(Float64(9.0 * x1) - 1.0) * x1)
	tmp = 0.0
	if (x1 <= -3.4e-61)
		tmp = t_0;
	elseif (x1 <= 2e-67)
		tmp = Float64(-6.0 * x2);
	elseif (x1 <= 3.1e-6)
		tmp = t_0;
	elseif (x1 <= 4.4e+153)
		tmp = Float64(Float64(Float64(x1 * x1) * x2) * 12.0);
	else
		tmp = Float64(Float64(x1 * x1) * 9.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = ((9.0 * x1) - 1.0) * x1;
	tmp = 0.0;
	if (x1 <= -3.4e-61)
		tmp = t_0;
	elseif (x1 <= 2e-67)
		tmp = -6.0 * x2;
	elseif (x1 <= 3.1e-6)
		tmp = t_0;
	elseif (x1 <= 4.4e+153)
		tmp = ((x1 * x1) * x2) * 12.0;
	else
		tmp = (x1 * x1) * 9.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision]}, If[LessEqual[x1, -3.4e-61], t$95$0, If[LessEqual[x1, 2e-67], N[(-6.0 * x2), $MachinePrecision], If[LessEqual[x1, 3.1e-6], t$95$0, If[LessEqual[x1, 4.4e+153], N[(N[(N[(x1 * x1), $MachinePrecision] * x2), $MachinePrecision] * 12.0), $MachinePrecision], N[(N[(x1 * x1), $MachinePrecision] * 9.0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if x1 < -3.3999999999999998e-61 or 1.99999999999999989e-67 < x1 < 3.1e-6

   1. Initial program 49.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 58.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 54.1%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   if -3.3999999999999998e-61 < x1 < 1.99999999999999989e-67

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

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

      1. lower-*.f64 60.8

         \[\leadsto \color{blue}{-6 \cdot x2} \]

   5. Applied rewrites 60.8%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if 3.1e-6 < x1 < 4.3999999999999999e153

   1. Initial program 96.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 46.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto {x1}^{2} \cdot \color{blue}{\left(\left(-4 \cdot x2 + \left(-2 \cdot \left(2 \cdot x2 - 3\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + 14 \cdot x2\right)\right)\right) - 6\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 30.7%

      \[\leadsto \left(x1 \cdot x1\right) \cdot \color{blue}{\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(14, x2, \mathsf{fma}\left(2, x2, 3\right) \cdot 3\right)\right)\right) - 6\right)} \]

   9. Taylor expanded in x2 around inf

      \[\leadsto 12 \cdot \left({x1}^{2} \cdot \color{blue}{x2}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 29.3%

       \[\leadsto \left(\left(x1 \cdot x1\right) \cdot x2\right) \cdot 12 \]

   if 4.3999999999999999e153 < x1

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 79.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around inf

      \[\leadsto 9 \cdot {x1}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 15: 86.6% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(8 \cdot x2 - 12\right) \cdot x2 - 1, x1, -6 \cdot x2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -350000000.0) (not (<= x1 7.5e+32)))
   (* (* (* (* x1 x1) x1) x1) 6.0)
   (fma (- (* (- (* 8.0 x2) 12.0) x2) 1.0) x1 (* -6.0 x2))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -350000000.0) || !(x1 <= 7.5e+32)) {
		tmp = (((x1 * x1) * x1) * x1) * 6.0;
	} else {
		tmp = fma(((((8.0 * x2) - 12.0) * x2) - 1.0), x1, (-6.0 * x2));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -350000000.0) || !(x1 <= 7.5e+32))
		tmp = Float64(Float64(Float64(Float64(x1 * x1) * x1) * x1) * 6.0);
	else
		tmp = fma(Float64(Float64(Float64(Float64(8.0 * x2) - 12.0) * x2) - 1.0), x1, Float64(-6.0 * x2));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -350000000.0], N[Not[LessEqual[x1, 7.5e+32]], $MachinePrecision]], N[(N[(N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision] * x1), $MachinePrecision] * 6.0), $MachinePrecision], N[(N[(N[(N[(N[(8.0 * x2), $MachinePrecision] - 12.0), $MachinePrecision] * x2), $MachinePrecision] - 1.0), $MachinePrecision] * x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -3.5e8 or 7.49999999999999959e32 < x1

   1. Initial program 35.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]

      3. lower-pow.f64 90.3

         \[\leadsto \color{blue}{{x1}^{4}} \cdot 6 \]

   8. Applied rewrites 90.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot 6} \]
   9. Step-by-step derivation

   10. Applied rewrites 90.2%

       \[\leadsto \left(\left(\left(x1 \cdot x1\right) \cdot \left(-x1\right)\right) \cdot \left(-x1\right)\right) \cdot 6 \]

   if -3.5e8 < x1 < 7.49999999999999959e32

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 87.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(\left(9 \cdot x1 + x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1, x1, -6 \cdot x2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 87.8%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(8, x2, 12 \cdot x1 - 12\right), x2, 9 \cdot x1\right) - 1, x1, -6 \cdot x2\right) \]

   9. Taylor expanded in x1 around 0

      \[\leadsto \mathsf{fma}\left(x2 \cdot \left(8 \cdot x2 - 12\right) - 1, x1, -6 \cdot x2\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 86.7%

       \[\leadsto \mathsf{fma}\left(\left(8 \cdot x2 - 12\right) \cdot x2 - 1, x1, -6 \cdot x2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -350000000 \lor \neg \left(x1 \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;\left(\left(\left(x1 \cdot x1\right) \cdot x1\right) \cdot x1\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(8 \cdot x2 - 12\right) \cdot x2 - 1, x1, -6 \cdot x2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 52.9% accurate, 10.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot 9\\ \mathbf{if}\;x1 \leq -8.8 \cdot 10^{-11}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x1 \leq 2 \cdot 10^{-67}:\\ \;\;\;\;-6 \cdot x2\\ \mathbf{elif}\;x1 \leq 3.1 \cdot 10^{-6}:\\ \;\;\;\;-x1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) 9.0)))
   (if (<= x1 -8.8e-11)
     t_0
     (if (<= x1 2e-67) (* -6.0 x2) (if (<= x1 3.1e-6) (- x1) t_0)))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * 9.0;
	double tmp;
	if (x1 <= -8.8e-11) {
		tmp = t_0;
	} else if (x1 <= 2e-67) {
		tmp = -6.0 * x2;
	} else if (x1 <= 3.1e-6) {
		tmp = -x1;
	} else {
		tmp = t_0;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x1 * x1) * 9.0d0
    if (x1 <= (-8.8d-11)) then
        tmp = t_0
    else if (x1 <= 2d-67) then
        tmp = (-6.0d0) * x2
    else if (x1 <= 3.1d-6) then
        tmp = -x1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (x1 * x1) * 9.0;
	double tmp;
	if (x1 <= -8.8e-11) {
		tmp = t_0;
	} else if (x1 <= 2e-67) {
		tmp = -6.0 * x2;
	} else if (x1 <= 3.1e-6) {
		tmp = -x1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (x1 * x1) * 9.0
	tmp = 0
	if x1 <= -8.8e-11:
		tmp = t_0
	elif x1 <= 2e-67:
		tmp = -6.0 * x2
	elif x1 <= 3.1e-6:
		tmp = -x1
	else:
		tmp = t_0
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * 9.0)
	tmp = 0.0
	if (x1 <= -8.8e-11)
		tmp = t_0;
	elseif (x1 <= 2e-67)
		tmp = Float64(-6.0 * x2);
	elseif (x1 <= 3.1e-6)
		tmp = Float64(-x1);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (x1 * x1) * 9.0;
	tmp = 0.0;
	if (x1 <= -8.8e-11)
		tmp = t_0;
	elseif (x1 <= 2e-67)
		tmp = -6.0 * x2;
	elseif (x1 <= 3.1e-6)
		tmp = -x1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * 9.0), $MachinePrecision]}, If[LessEqual[x1, -8.8e-11], t$95$0, If[LessEqual[x1, 2e-67], N[(-6.0 * x2), $MachinePrecision], If[LessEqual[x1, 3.1e-6], (-x1), t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -8.8000000000000006e-11 or 3.1e-6 < x1

   1. Initial program 40.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 50.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 53.5%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around inf

      \[\leadsto 9 \cdot {x1}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 52.3%

       \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]

   if -8.8000000000000006e-11 < x1 < 1.99999999999999989e-67

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

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

      1. lower-*.f64 57.1

         \[\leadsto \color{blue}{-6 \cdot x2} \]

   5. Applied rewrites 57.1%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if 1.99999999999999989e-67 < x1 < 3.1e-6

   1. Initial program 99.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 50.4%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around 0

      \[\leadsto -1 \cdot x1 \]
   10. Step-by-step derivation

   11. Applied rewrites 49.4%

       \[\leadsto -x1 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 17: 54.1% accurate, 11.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -3.4 \cdot 10^{-61} \lor \neg \left(x1 \leq 2 \cdot 10^{-67}\right):\\ \;\;\;\;\left(9 \cdot x1 - 1\right) \cdot x1\\ \mathbf{else}:\\ \;\;\;\;-6 \cdot x2\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -3.4e-61) (not (<= x1 2e-67)))
   (* (- (* 9.0 x1) 1.0) x1)
   (* -6.0 x2)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -3.4e-61) || !(x1 <= 2e-67)) {
		tmp = ((9.0 * x1) - 1.0) * x1;
	} else {
		tmp = -6.0 * x2;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x1 <= (-3.4d-61)) .or. (.not. (x1 <= 2d-67))) then
        tmp = ((9.0d0 * x1) - 1.0d0) * x1
    else
        tmp = (-6.0d0) * x2
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -3.4e-61) || !(x1 <= 2e-67)) {
		tmp = ((9.0 * x1) - 1.0) * x1;
	} else {
		tmp = -6.0 * x2;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x1 <= -3.4e-61) or not (x1 <= 2e-67):
		tmp = ((9.0 * x1) - 1.0) * x1
	else:
		tmp = -6.0 * x2
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -3.4e-61) || !(x1 <= 2e-67))
		tmp = Float64(Float64(Float64(9.0 * x1) - 1.0) * x1);
	else
		tmp = Float64(-6.0 * x2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x1 <= -3.4e-61) || ~((x1 <= 2e-67)))
		tmp = ((9.0 * x1) - 1.0) * x1;
	else
		tmp = -6.0 * x2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -3.4e-61], N[Not[LessEqual[x1, 2e-67]], $MachinePrecision]], N[(N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] * x1), $MachinePrecision], N[(-6.0 * x2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -3.3999999999999998e-61 or 1.99999999999999989e-67 < x1

   1. Initial program 50.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 59.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 52.1%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   if -3.3999999999999998e-61 < x1 < 1.99999999999999989e-67

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

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

      1. lower-*.f64 60.8

         \[\leadsto \color{blue}{-6 \cdot x2} \]

   5. Applied rewrites 60.8%

      \[\leadsto \color{blue}{-6 \cdot x2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -3.4 \cdot 10^{-61} \lor \neg \left(x1 \leq 2 \cdot 10^{-67}\right):\\ \;\;\;\;\left(9 \cdot x1 - 1\right) \cdot x1\\ \mathbf{else}:\\ \;\;\;\;-6 \cdot x2\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 30.6% accurate, 16.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x2 \leq -5.9 \cdot 10^{-92} \lor \neg \left(x2 \leq 9.5 \cdot 10^{-222}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x2 -5.9e-92) (not (<= x2 9.5e-222))) (* -6.0 x2) (- x1)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -5.9e-92) || !(x2 <= 9.5e-222)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x2 <= (-5.9d-92)) .or. (.not. (x2 <= 9.5d-222))) then
        tmp = (-6.0d0) * x2
    else
        tmp = -x1
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -5.9e-92) || !(x2 <= 9.5e-222)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x2 <= -5.9e-92) or not (x2 <= 9.5e-222):
		tmp = -6.0 * x2
	else:
		tmp = -x1
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x2 <= -5.9e-92) || !(x2 <= 9.5e-222))
		tmp = Float64(-6.0 * x2);
	else
		tmp = Float64(-x1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x2 <= -5.9e-92) || ~((x2 <= 9.5e-222)))
		tmp = -6.0 * x2;
	else
		tmp = -x1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x2, -5.9e-92], N[Not[LessEqual[x2, 9.5e-222]], $MachinePrecision]], N[(-6.0 * x2), $MachinePrecision], (-x1)]

Derivation

1. Split input into 2 regimes

2. if x2 < -5.9e-92 or 9.5000000000000002e-222 < x2

   1. Initial program 70.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

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

      1. lower-*.f64 29.4

         \[\leadsto \color{blue}{-6 \cdot x2} \]

   5. Applied rewrites 29.4%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if -5.9e-92 < x2 < 9.5000000000000002e-222

   1. Initial program 59.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 78.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

   6. Taylor expanded in x2 around 0

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

   8. Applied rewrites 72.7%

      \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

   9. Taylor expanded in x1 around 0

      \[\leadsto -1 \cdot x1 \]
   10. Step-by-step derivation

   11. Applied rewrites 38.4%

       \[\leadsto -x1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 31.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x2 \leq -5.9 \cdot 10^{-92} \lor \neg \left(x2 \leq 9.5 \cdot 10^{-222}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \]
5. Add Preprocessing

Alternative 19: 13.3% accurate, 99.3× speedup

Math

\[\begin{array}{l} \\ -x1 \end{array} \]

FPCore

(FPCore (x1 x2) :precision binary64 (- x1))

C

double code(double x1, double x2) {
	return -x1;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    code = -x1
end function

Java

public static double code(double x1, double x2) {
	return -x1;
}

Python

def code(x1, x2):
	return -x1

Julia

function code(x1, x2)
	return Float64(-x1)
end

MATLAB

function tmp = code(x1, x2)
	tmp = -x1;
end

Wolfram

code[x1_, x2_] := (-x1)

Derivation

1. Initial program 67.9%

   \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x1 around 0

   \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

5. Applied rewrites 68.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-4, x2, \mathsf{fma}\left(-2, 2 \cdot x2 - 3, \mathsf{fma}\left(3 - -2 \cdot x2, 3, x2 \cdot 14\right) - 6\right)\right), x1, \left(\left(2 \cdot x2 - 3\right) \cdot x2\right) \cdot 4 - 1\right), x1, -6 \cdot x2\right)} \]

6. Taylor expanded in x2 around 0

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

8. Applied rewrites 39.2%

   \[\leadsto \left(9 \cdot x1 - 1\right) \cdot \color{blue}{x1} \]

9. Taylor expanded in x1 around 0

   \[\leadsto -1 \cdot x1 \]
10. Step-by-step derivation

11. Applied rewrites 13.0%

    \[\leadsto -x1 \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024352 
(FPCore (x1 x2)
  :name "Rosa's FloatVsDoubleBenchmark"
  :precision binary64
  (+ x1 (+ (+ (+ (+ (* (+ (* (* (* 2.0 x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) (- (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)) 3.0)) (* (* x1 x1) (- (* 4.0 (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) 6.0))) (+ (* x1 x1) 1.0)) (* (* (* 3.0 x1) x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)))) (* (* x1 x1) x1)) x1) (* 3.0 (/ (- (- (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))))))