Metrics for Numeric.Integration.TanhSinh:nonNegative from integration-0.2.1

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze1.0ms (0.1%)

Memory

2.2MiB live, 2.2MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample427.0ms (46.1%)

Memory

6.0MiB live, 570.3MiB allocated; 153ms collecting garbage

Samples

223.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 79.0ms

ival-div!: 47.0ms (59.8% of total)

ival-sub!: 30.0ms (38.2% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

explain42.0ms (4.5%)

Memory

6.7MiB live, 53.7MiB allocated; 4ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
-	-	`(-.f64 #s(literal 1 binary64) x)`
-	-	`#s(literal 1 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

14.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 5.0ms

ival-div!: 3.0ms (66.5% of total)

ival-sub!: 2.0ms (44.3% of total)

adjust: 0.0ms (0% of total)

preprocess87.0ms (9.4%)

Memory

-18.2MiB live, 28.7MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	16	18
2	21	18
3	38	16
4	90	15
5	340	15
6	3065	15
7	7385	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))

Compiler

Compiled 10 to 8 computations (20% saved)

series2.0ms (0.2%)

Memory

3.0MiB live, 3.0MiB allocated; 0ms collecting garbage

Counts

4 → 15

Calls

Call 1

Inputs
(/.f64 x (-.f64 #s(literal 1 binary64) x))
x
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)

Outputs
#s(approx (/ x (- 1 x)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (- 1 x) #s(hole binary64 1))
#s(approx (- 1 x) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (- 1 x) #s(hole binary64 (* -1 x)))
#s(approx (- 1 x) #s(hole binary64 (* x (- (/ 1 x) 1))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))
#s(approx (- 1 x) #s(hole binary64 (* -1 (* x (- 1 (/ 1 x))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ x (- 1 x)) x (- 1 x) 1)
1.0ms	x	@	inf	((/ x (- 1 x)) x (- 1 x) 1)
0.0ms	x	@	0	((/ x (- 1 x)) x (- 1 x) 1)

rewrite105.0ms (11.3%)

Memory

11.9MiB live, 108.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	52	193
0	53	184
1	271	178
0	2708	172

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

19 → 49

Calls

Call 1

Inputs
(/.f64 x (-.f64 #s(literal 1 binary64) x))
x
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
#s(approx (/ x (- 1 x)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (- 1 x) #s(hole binary64 1))
#s(approx (- 1 x) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (- 1 x) #s(hole binary64 (* -1 x)))
#s(approx (- 1 x) #s(hole binary64 (* x (- (/ 1 x) 1))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))
#s(approx (- 1 x) #s(hole binary64 (* -1 (* x (- 1 (/ 1 x))))))

Outputs
(.f64 (/.f64 x (-.f64 #s(literal 1 binary64) (.f64 x x))) (-.f64 x #s(literal -1 binary64)))
(.f64 (/.f64 x (fma.f64 (.f64 x x) (neg.f64 x) #s(literal 1 binary64))) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64)))
(*.f64 #s(literal -1 binary64) (/.f64 x (neg.f64 (-.f64 #s(literal 1 binary64) x))))
(*.f64 x (/.f64 #s(literal -1 binary64) (neg.f64 (-.f64 #s(literal 1 binary64) x))))
(/.f64 (neg.f64 x) (neg.f64 (-.f64 #s(literal 1 binary64) x)))
(/.f64 x (neg.f64 (neg.f64 (-.f64 #s(literal 1 binary64) x))))
(/.f64 x (-.f64 #s(literal 1 binary64) x))
(neg.f64 (/.f64 (neg.f64 x) (-.f64 #s(literal 1 binary64) x)))
(neg.f64 (/.f64 x (neg.f64 (-.f64 #s(literal 1 binary64) x))))
x
(.f64 (/.f64 (-.f64 #s(literal 1 binary64) (.f64 x x)) (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(.f64 (/.f64 (-.f64 #s(literal 1 binary64) (.f64 x x)) (-.f64 #s(literal 1 binary64) (*.f64 x x))) (-.f64 #s(literal 1 binary64) x))
(*.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x))
(/.f64 (-.f64 (*.f64 x x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(/.f64 (neg.f64 (fma.f64 (*.f64 x x) (neg.f64 x) #s(literal 1 binary64))) (neg.f64 (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 x #s(literal -1 binary64)))
(/.f64 (fma.f64 (*.f64 x x) (neg.f64 x) #s(literal 1 binary64)) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (fma.f64 (*.f64 x x) (neg.f64 x) #s(literal 1 binary64)) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64)))
(neg.f64 (+.f64 x #s(literal -1 binary64)))
(neg.f64 (+.f64 #s(literal -1 binary64) x))
(fma.f64 (neg.f64 x) #s(literal 1 binary64) #s(literal 1 binary64))
(fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64))
(fma.f64 #s(literal 1 binary64) (neg.f64 x) #s(literal 1 binary64))
(fma.f64 x #s(literal -1 binary64) #s(literal 1 binary64))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))) (/.f64 (*.f64 x x) (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 #s(literal 1 binary64) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64))) (/.f64 (.f64 (.f64 x x) x) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64))))
(-.f64 (neg.f64 x) #s(literal -1 binary64))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) #s(literal -1 binary64)))
(-.f64 #s(literal 1 binary64) x)
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64))) (/.f64 (.f64 (.f64 x x) (neg.f64 x)) (fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(literal 1 binary64))))
(+.f64 (neg.f64 x) #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) (neg.f64 x))
#s(literal 1 binary64)
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
#s(approx (/ x (- 1 x)) (fma.f64 (fma.f64 x x x) x x))
#s(approx (/ x (- 1 x)) (fma.f64 (fma.f64 (fma.f64 x x x) x x) x x))
#s(approx x x)
#s(approx (- 1 x) #s(literal 1 binary64))
#s(approx (- 1 x) (-.f64 #s(literal 1 binary64) x))
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) x) #s(literal 1 binary64)))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) (*.f64 x x)) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
#s(approx (- 1 x) (neg.f64 x))
#s(approx (- 1 x) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) x))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) x) #s(literal 1 binary64)) x) #s(literal 1 binary64)))
#s(approx (- 1 x) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) (neg.f64 x)))

eval4.0ms (0.4%)

Memory: 7.1MiB live, 7.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 512 to 133 computations (74% saved)

prune2.0ms (0.2%)

Memory

3.2MiB live, 3.2MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	43	3	46
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	43	4	47

Accuracy

100.0%

Counts

47 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))
▶	45.4%	#s(approx (/ x (- 1 x)) (fma.f64 x x x))
▶	46.7%	#s(approx (/ x (- 1 x)) x)
▶	55.5%	#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Compiler

Compiled 29 to 21 computations (27.6% saved)

series2.0ms (0.2%)

Memory

2.7MiB live, 2.7MiB allocated; 0ms collecting garbage

Counts

6 → 14

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (/ x (- 1 x)) x)
x
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
(fma.f64 x x x)

Outputs
#s(approx (/ x (- 1 x)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (+ (* x x) x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) x) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ x (- 1 x)) -1 (/ x (- 1 x)) x (/ x (- 1 x)) (+ (* x x) x))
1.0ms	x	@	inf	((/ x (- 1 x)) -1 (/ x (- 1 x)) x (/ x (- 1 x)) (+ (* x x) x))
0.0ms	x	@	0	((/ x (- 1 x)) -1 (/ x (- 1 x)) x (/ x (- 1 x)) (+ (* x x) x))

rewrite159.0ms (17.2%)

Memory

-10.5MiB live, 81.1MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	47	206
0	48	191
1	254	186
0	2713	183

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

20 → 77

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (/ x (- 1 x)) x)
x
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
(fma.f64 x x x)
#s(approx (/ x (- 1 x)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (+ (* x x) x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) x) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (/ x (- 1 x)) x)
x
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
(.f64 (.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))) x)
(.f64 (.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 x))
(.f64 (.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) x) x)
(.f64 (neg.f64 x) (.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
(.f64 (.f64 x x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) (.f64 x x))
(*.f64 (fma.f64 x x x) #s(literal 1 binary64))
(*.f64 (-.f64 x #s(literal -1 binary64)) x)
(*.f64 #s(literal 1 binary64) (fma.f64 x x x))
(.f64 x (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
(*.f64 x (-.f64 x #s(literal -1 binary64)))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (.f64 x x)) x) (-.f64 #s(literal 1 binary64) x))
(/.f64 (.f64 (fma.f64 (.f64 x x) x #s(literal 1 binary64)) x) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (.f64 #s(literal 1 binary64) (.f64 (fma.f64 x x x) (-.f64 (.f64 x x) x))) (-.f64 (.f64 x x) x))
(/.f64 (.f64 #s(literal 1 binary64) (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) (.f64 (.f64 x x) x))) (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (*.f64 x x)))))
(/.f64 (.f64 x (-.f64 #s(literal 1 binary64) (.f64 x x))) (-.f64 #s(literal 1 binary64) x))
(/.f64 (.f64 x (fma.f64 (.f64 x x) x #s(literal 1 binary64))) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (-.f64 (.f64 x x) (.f64 (.f64 (.f64 x x) x) x)) (-.f64 x (*.f64 x x)))
(/.f64 (neg.f64 (.f64 (fma.f64 x x x) (-.f64 (.f64 x x) x))) (neg.f64 (-.f64 (*.f64 x x) x)))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) (.f64 (.f64 x x) x))) (neg.f64 (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (.f64 x x))))))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (.f64 x x))) (*.f64 x x)) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (.f64 x x) x)) #s(literal 1 binary64)) (.f64 x x)) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (*.f64 #s(literal 2 binary64) (fma.f64 x x x)) #s(literal 2 binary64))
(/.f64 (.f64 (.f64 x x) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x)))) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 (.f64 x x) (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (.f64 x x) x)) #s(literal 1 binary64))) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (.f64 #s(literal 2 binary64) (.f64 (fma.f64 x x x) (-.f64 (.f64 x x) x))) (.f64 #s(literal 2 binary64) (-.f64 (*.f64 x x) x)))
(/.f64 (.f64 #s(literal 2 binary64) (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) (.f64 (.f64 x x) x))) (.f64 #s(literal 2 binary64) (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (.f64 x x))))))
(/.f64 (.f64 (fma.f64 x x x) (-.f64 (.f64 x x) x)) (-.f64 (*.f64 x x) x))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) (.f64 (.f64 x x) x)) (fma.f64 x x (-.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 (*.f64 x x) x))))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) (.f64 (.f64 x x) x)) (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (.f64 x x)))))
(fma.f64 (.f64 #s(literal 1 binary64) (fabs.f64 x)) (.f64 #s(literal 1 binary64) (fabs.f64 x)) x)
(fma.f64 (*.f64 #s(literal 1 binary64) (fabs.f64 x)) (fabs.f64 x) x)
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) x)
(fma.f64 (.f64 #s(literal 1 binary64) (neg.f64 x)) (.f64 #s(literal 1 binary64) (neg.f64 x)) x)
(fma.f64 (*.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x) x)
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) x)
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) x)
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) x)
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) x)
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 x) (neg.f64 x) x)
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) x)
(fma.f64 (fabs.f64 x) (fabs.f64 x) x)
(fma.f64 (*.f64 x x) #s(literal 1 binary64) x)
(fma.f64 #s(literal 1 binary64) (*.f64 x x) x)
(fma.f64 x x x)
(-.f64 (/.f64 (.f64 (.f64 (.f64 x x) x) x) (-.f64 (.f64 x x) x)) (/.f64 (.f64 x x) (-.f64 (.f64 x x) x)))
(-.f64 (.f64 x x) (.f64 (/.f64 #s(literal -1 binary64) x) (*.f64 x x)))
(-.f64 (.f64 x x) (.f64 (*.f64 (neg.f64 x) x) (/.f64 #s(literal 1 binary64) x)))
(-.f64 (.f64 x x) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(-.f64 (.f64 x x) (.f64 #s(literal -1 binary64) x))
(-.f64 x (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (.f64 x x))))) (/.f64 (.f64 (.f64 x x) x) (fma.f64 (.f64 (.f64 x x) x) x (.f64 x (-.f64 x (*.f64 x x))))))
(+.f64 (*.f64 x x) x)
(+.f64 x (*.f64 x x))
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
#s(approx (/ x (- 1 x)) (fma.f64 (fma.f64 x x x) x x))
#s(approx (/ x (- 1 x)) (fma.f64 (fma.f64 (fma.f64 x x x) x x) x x))
#s(approx x x)
#s(approx (+ (* x x) x) x)
#s(approx (+ (* x x) x) (fma.f64 x x x))
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) x) #s(literal 1 binary64)))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) (*.f64 x x)) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
#s(approx (+ (* x x) x) (*.f64 x x))
#s(approx (+ (* x x) x) (fma.f64 x x x))
#s(approx (/ x (- 1 x)) (-.f64 (/.f64 (-.f64 (/.f64 (-.f64 #s(literal -1 binary64) (/.f64 #s(literal 1 binary64) x)) x) #s(literal 1 binary64)) x) #s(literal 1 binary64)))

eval6.0ms (0.7%)

Memory: 8.7MiB live, 8.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 283 to 227 computations (82.3% saved)

prune3.0ms (0.4%)

Memory

3.5MiB live, 3.5MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	70	0	70
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	70	4	74

Accuracy

100.0%

Counts

74 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))
✓	45.4%	#s(approx (/ x (- 1 x)) (fma.f64 x x x))
✓	46.7%	#s(approx (/ x (- 1 x)) x)
✓	55.5%	#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes4.0ms (0.4%)

Memory

4.5MiB live, 4.5MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (fma.f64 x x x))
(/.f64 x (-.f64 #s(literal 1 binary64) x))

Outputs
(/.f64 x (-.f64 #s(literal 1 binary64) x))

Calls

2 calls:

2.0ms	x
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
100.0%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes3.0ms (0.3%)

Memory

5.9MiB live, 5.9MiB allocated; 0ms collecting garbage

Counts

3 → 2

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (fma.f64 x x x))

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) (fma.f64 x x x))

Calls

2 calls:

2.0ms	x
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))

Results

Accuracy	Segments	Branch
98.8%	2	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
98.8%	3	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes1.0ms (0.1%)

Memory

2.5MiB live, 2.5MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)

Calls

1 calls:

1.0ms

(/.f64 x (-.f64 #s(literal 1 binary64) x))

Results

Accuracy	Segments	Branch
98.7%	2	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`

Compiler

Compiled 5 to 4 computations (20% saved)

regimes2.0ms (0.2%)

Memory

4.4MiB live, 4.4MiB allocated; 0ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))

Results

Accuracy	Segments	Branch
55.5%	1	`x`
55.5%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`

Compiler

Compiled 6 to 5 computations (16.7% saved)

bsearch0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9812188717296819	-3.4919373103100596e-14

Compiler

Compiled 8 to 8 computations (0% saved)

bsearch0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated; 0ms collecting garbage

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9812188717296819	-3.4919373103100596e-14

Compiler

Compiled 8 to 8 computations (0% saved)

derivations34.0ms (3.6%)

Memory

-11.4MiB live, 34.6MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 59 to 16 computations (72.9% saved)

preprocess42.0ms (4.5%)

Memory: 1.8MiB live, 63.6MiB allocated; 30ms collecting garbage
Compiler: Compiled 128 to 40 computations (68.8% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze1.0ms (0.1%)

sample427.0ms (46.1%)

explain42.0ms (4.5%)

preprocess87.0ms (9.4%)

series2.0ms (0.2%)

rewrite105.0ms (11.3%)

eval4.0ms (0.4%)

prune2.0ms (0.2%)

series2.0ms (0.2%)

rewrite159.0ms (17.2%)

eval6.0ms (0.7%)

prune3.0ms (0.4%)

regimes4.0ms (0.4%)

regimes3.0ms (0.3%)

regimes1.0ms (0.1%)

regimes2.0ms (0.2%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

derivations34.0ms (3.6%)

preprocess42.0ms (4.5%)

end0.0ms (0%)

Profiling