Metrics for UniformSampleCone, z

start0.0ms (0%)

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

analyze46.0ms (1.3%)

Memory

-27.5MiB live, 61.9MiB allocated; 7ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	0.1%	99.9%	0%	0%	0%	0
0%	0%	0.1%	99.9%	0%	0%	0%	1
0%	0%	0.1%	99.9%	0%	0%	0%	2
25%	0%	0.1%	99.9%	0%	0%	0%	3
25%	0%	0.1%	99.9%	0%	0%	0%	4
37.5%	0%	0.1%	99.9%	0%	0%	0%	5
56.2%	0.1%	0%	99.9%	0%	0%	0%	6
56.2%	0.1%	0%	99.9%	0%	0%	0%	7
65.6%	0.1%	0%	99.9%	0%	0%	0%	8
76.6%	0.1%	0%	99.9%	0%	0%	0%	9
76.6%	0.1%	0%	99.9%	0%	0%	0%	10
82%	0.1%	0%	99.9%	0%	0%	0%	11
87.9%	0.1%	0%	99.9%	0%	0%	0%	12

Compiler

Compiled 31 to 21 computations (32.3% saved)

sample702.0ms (20.7%)

Memory

41.7MiB live, 544.4MiB allocated; 720ms collecting garbage

Samples

545.0ms	8 173×	0	valid
4.0ms	83×	1	valid

Precisions

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

ival-mult!: 329.0ms (87.2% of total)

ival-sub!: 23.0ms (6.1% of total)

ival-add!: 16.0ms (4.2% of total)

ival-<=: 3.0ms (0.8% of total)

adjust: 2.0ms (0.5% of total)

ival-and: 2.0ms (0.5% of total)

ival-assert: 0.0ms (0% of total)

Bogosity

preprocess209.0ms (6.2%)

Memory

-18.7MiB live, 25.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	25	77
1	77	75
2	166	75
3	305	71
4	843	70
5	5616	70

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))

Symmetry

(abs uy)

Compiler

Compiled 12 to 14 computations (-16.7% saved)

series5.0ms (0.1%)

Memory

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

Counts

6 → 19

Calls

Call 1

Inputs
(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))
(-.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux
(*.f32 ux maxCos)
maxCos

Outputs
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 1))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx ux #s(hole binary32 ux))
#s(approx (* ux maxCos) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (- 1 ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx maxCos #s(hole binary32 maxCos))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	ux	@	-inf	((+ (- 1 ux) (* ux maxCos)) (- 1 ux) 1 ux (* ux maxCos) maxCos)
1.0ms	ux	@	inf	((+ (- 1 ux) (* ux maxCos)) (- 1 ux) 1 ux (* ux maxCos) maxCos)
1.0ms	maxCos	@	0	((+ (- 1 ux) (* ux maxCos)) (- 1 ux) 1 ux (* ux maxCos) maxCos)
1.0ms	maxCos	@	-inf	((+ (- 1 ux) (* ux maxCos)) (- 1 ux) 1 ux (* ux maxCos) maxCos)
1.0ms	ux	@	0	((+ (- 1 ux) (* ux maxCos)) (- 1 ux) 1 ux (* ux maxCos) maxCos)

rewrite780.0ms (23%)

Memory

42.8MiB live, 415.8MiB allocated; 100ms collecting garbage

Counts

25 → 25

Calls

Call 1

Inputs
(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))
(-.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux
(*.f32 ux maxCos)
maxCos
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 1))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx ux #s(hole binary32 ux))
#s(approx (* ux maxCos) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (- 1 ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx maxCos #s(hole binary32 maxCos))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (+ (- 1 ux) (* ux maxCos)) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))

Outputs
(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
(-.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux
(*.f32 ux maxCos)
maxCos
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
#s(approx (- 1 ux) #s(literal 1 binary32))
#s(approx (- 1 ux) (-.f32 #s(literal 1 binary32) ux))
#s(approx ux ux)
#s(approx (* ux maxCos) (*.f32 ux maxCos))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (-.f32 maxCos #s(literal 1 binary32)) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (+.f32 (/.f32 #s(literal 1 binary32) ux) (-.f32 maxCos #s(literal 1 binary32))) ux))
#s(approx (- 1 ux) (neg.f32 ux))
#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (neg.f32 (-.f32 ux (*.f32 ux maxCos))))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (neg.f32 (-.f32 (-.f32 #s(literal 1 binary32) maxCos) (/.f32 #s(literal 1 binary32) ux))) ux))
#s(approx (- 1 ux) (*.f32 (-.f32 #s(literal 1 binary32) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) (-.f32 #s(literal 1 binary32) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux)))
#s(approx maxCos maxCos)
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 ux maxCos))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (+.f32 (/.f32 (-.f32 #s(literal 1 binary32) ux) maxCos) ux) maxCos))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (-.f32 (neg.f32 ux) (/.f32 (-.f32 #s(literal 1 binary32) ux) maxCos)) (neg.f32 maxCos)))

eval3.0ms (0.1%)

Memory: 2.1MiB live, 2.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 106 to 54 computations (49.1% saved)

prune5.0ms (0.2%)

Memory

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

Pruning

6 alts after pruning (6 fresh and 0 done)

	Pruned	Kept	Total
New	19	6	25
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	20	6	26

Accuracy

100.0%

Counts

26 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
▶	97.5%	(-.f32 #s(literal 1 binary32) ux)
▶	99.9%	#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
▶	71.2%	#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
	96.3%	#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
▶	17.0%	#s(approx ux ux)

Compiler

Compiled 72 to 90 computations (-25% saved)

series15.0ms (0.4%)

Memory

-47.8MiB live, 5.5MiB allocated; 16ms collecting garbage

Counts

10 → 44

Calls

Call 1

Inputs
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
(fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32))
(-.f32 maxCos #s(literal 1 binary32))
maxCos
#s(literal 1 binary32)
ux
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
(-.f32 #s(literal 1 binary32) ux)
(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))

Outputs
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 1))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 1))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx ux #s(hole binary32 ux))
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 1))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* -1 (* ux (- (* -1 (- maxCos 1)) (/ 1 ux))))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (- 1 ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (+ (* -1 ux) (* maxCos ux)))))
#s(approx (- maxCos 1) #s(hole binary32 -1))
#s(approx (- maxCos 1) #s(hole binary32 (- maxCos 1)))
#s(approx maxCos #s(hole binary32 maxCos))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (- 1 ux)))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* maxCos ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* maxCos (+ ux (+ (* -1 (/ ux maxCos)) (/ 1 maxCos))))))
#s(approx (- maxCos 1) #s(hole binary32 maxCos))
#s(approx (- maxCos 1) #s(hole binary32 (* maxCos (- 1 (/ 1 maxCos)))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (+ 1 (* -1 ux)) maxCos)))))))
#s(approx (- maxCos 1) #s(hole binary32 (* -1 (* maxCos (- (/ 1 maxCos) 1)))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))

Calls

9 calls:

Time	Variable		Point	Expression
9.0ms	ux	@	-inf	((- (+ 1 (* ux maxCos)) ux) (+ (* (- maxCos 1) ux) 1) (- maxCos 1) maxCos 1 ux ux (- (+ 1 (* ux maxCos)) ux) (- 1 ux) (+ (* maxCos ux) (- 1 ux)))
1.0ms	ux	@	0	((- (+ 1 (* ux maxCos)) ux) (+ (* (- maxCos 1) ux) 1) (- maxCos 1) maxCos 1 ux ux (- (+ 1 (* ux maxCos)) ux) (- 1 ux) (+ (* maxCos ux) (- 1 ux)))
1.0ms	maxCos	@	0	((- (+ 1 (* ux maxCos)) ux) (+ (* (- maxCos 1) ux) 1) (- maxCos 1) maxCos 1 ux ux (- (+ 1 (* ux maxCos)) ux) (- 1 ux) (+ (* maxCos ux) (- 1 ux)))
1.0ms	ux	@	inf	((- (+ 1 (* ux maxCos)) ux) (+ (* (- maxCos 1) ux) 1) (- maxCos 1) maxCos 1 ux ux (- (+ 1 (* ux maxCos)) ux) (- 1 ux) (+ (* maxCos ux) (- 1 ux)))
1.0ms	maxCos	@	-inf	((- (+ 1 (* ux maxCos)) ux) (+ (* (- maxCos 1) ux) 1) (- maxCos 1) maxCos 1 ux ux (- (+ 1 (* ux maxCos)) ux) (- 1 ux) (+ (* maxCos ux) (- 1 ux)))

rewrite809.0ms (23.9%)

Memory

25.2MiB live, 344.9MiB allocated; 57ms collecting garbage

Counts

54 → 40

Calls

Call 1

Inputs
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
(fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32))
(-.f32 maxCos #s(literal 1 binary32))
maxCos
#s(literal 1 binary32)
ux
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
(-.f32 #s(literal 1 binary32) ux)
(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 1))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 1))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx ux #s(hole binary32 ux))
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 1))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (+ 1 (* ux (- maxCos 1)))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* ux (- maxCos 1))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* ux (- (+ maxCos (/ 1 ux)) 1))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* -1 (* ux (- (* -1 (- maxCos 1)) (/ 1 ux))))))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* ux (+ 1 (* -1 maxCos))))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* ux (- (+ 1 (* -1 maxCos)) (/ 1 ux))))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (- 1 ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (+ 1 (+ (* -1 ux) (* maxCos ux)))))
#s(approx (- maxCos 1) #s(hole binary32 -1))
#s(approx (- maxCos 1) #s(hole binary32 (- maxCos 1)))
#s(approx maxCos #s(hole binary32 maxCos))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (- 1 ux)))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (- (+ 1 (* maxCos ux)) ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* maxCos ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* maxCos (+ ux (+ (* -1 (/ ux maxCos)) (/ 1 maxCos))))))
#s(approx (- maxCos 1) #s(hole binary32 maxCos))
#s(approx (- maxCos 1) #s(hole binary32 (* maxCos (- 1 (/ 1 maxCos)))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* maxCos ux)))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* maxCos (- (+ ux (/ 1 maxCos)) (/ ux maxCos)))))
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))
#s(approx (+ (* (- maxCos 1) ux) 1) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (+ 1 (* -1 ux)) maxCos)))))))
#s(approx (- maxCos 1) #s(hole binary32 (* -1 (* maxCos (- (/ 1 maxCos) 1)))))
#s(approx (+ (* maxCos ux) (- 1 ux)) #s(hole binary32 (* -1 (* maxCos (+ (* -1 ux) (* -1 (/ (- 1 ux) maxCos)))))))

Outputs
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
(fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32))
(-.f32 maxCos #s(literal 1 binary32))
maxCos
#s(literal 1 binary32)
ux
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
(-.f32 #s(literal 1 binary32) ux)
(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
#s(approx (+ 1 (* ux (- maxCos 1))) #s(literal 1 binary32))
#s(approx (+ 1 (* ux (- maxCos 1))) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
#s(approx (- 1 ux) #s(literal 1 binary32))
#s(approx (- 1 ux) (+.f32 #s(literal 1 binary32) (neg.f32 ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 ux (-.f32 maxCos #s(literal 1 binary32))))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (+.f32 (/.f32 #s(literal 1 binary32) ux) (-.f32 maxCos #s(literal 1 binary32))) ux))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 ux (-.f32 maxCos #s(literal 1 binary32))))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 (+.f32 (/.f32 #s(literal 1 binary32) ux) (-.f32 maxCos #s(literal 1 binary32))) ux))
#s(approx (- 1 ux) (neg.f32 ux))
#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (neg.f32 (-.f32 ux (*.f32 maxCos ux))))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (-.f32 (+.f32 (neg.f32 maxCos) #s(literal 1 binary32)) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 (-.f32 (neg.f32 (-.f32 maxCos #s(literal 1 binary32))) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))
#s(approx (- 1 ux) (*.f32 (-.f32 #s(literal 1 binary32) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))
#s(approx (- (+ 1 (* ux maxCos)) ux) (-.f32 #s(literal 1 binary32) ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux)))
#s(approx (+ 1 (* ux (- maxCos 1))) (+.f32 #s(literal 1 binary32) (neg.f32 ux)))
#s(approx (+ 1 (* ux (- maxCos 1))) (fma.f32 (+.f32 maxCos #s(literal -1 binary32)) ux #s(literal 1 binary32)))
#s(approx (- maxCos 1) #s(literal -1 binary32))
#s(approx (- maxCos 1) (-.f32 maxCos #s(literal 1 binary32)))
#s(approx maxCos maxCos)
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 maxCos ux))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (+.f32 (/.f32 (-.f32 #s(literal 1 binary32) ux) maxCos) ux) maxCos))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 maxCos ux))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 (+.f32 (/.f32 (+.f32 #s(literal 1 binary32) (neg.f32 ux)) maxCos) ux) maxCos))
#s(approx (- maxCos 1) maxCos)
#s(approx (- maxCos 1) (*.f32 (-.f32 #s(literal 1 binary32) (/.f32 #s(literal 1 binary32) maxCos)) maxCos))
#s(approx (- (+ 1 (* ux maxCos)) ux) (*.f32 (-.f32 (neg.f32 ux) (/.f32 (-.f32 #s(literal 1 binary32) ux) maxCos)) (neg.f32 maxCos)))
#s(approx (+ 1 (* ux (- maxCos 1))) (*.f32 (-.f32 (neg.f32 ux) (/.f32 (+.f32 #s(literal 1 binary32) (neg.f32 ux)) maxCos)) (neg.f32 maxCos)))
#s(approx (- maxCos 1) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) maxCos) #s(literal 1 binary32)) (neg.f32 maxCos)))

eval2.0ms (0.1%)

Memory: 2.4MiB live, 2.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 178 to 81 computations (54.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	34	0	34
Fresh	0	1	1
Picked	0	5	5
Done	0	0	0
Total	34	6	40

Accuracy

100.0%

Counts

40 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
✓	97.5%	(-.f32 #s(literal 1 binary32) ux)
✓	99.9%	#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
✓	71.2%	#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
▶	96.3%	#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
✓	17.0%	#s(approx ux ux)

Compiler

Compiled 36 to 45 computations (-25% saved)

series3.0ms (0.1%)

Memory

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

Counts

6 → 16

Calls

Call 1

Inputs
#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
(*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux)
(-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32))
(/.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux

Outputs
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 1))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (/ 1 ux)))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (/ (+ 1 (* -1 ux)) ux)))
#s(approx (/ 1 ux) #s(hole binary32 (/ 1 ux)))
#s(approx ux #s(hole binary32 ux))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* -1 ux)))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 -1))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (- (/ 1 ux) 1)))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	ux	@	-inf	((- 1 ux) (* (- (/ 1 ux) 1) ux) (- (/ 1 ux) 1) (/ 1 ux) 1 ux)
1.0ms	ux	@	0	((- 1 ux) (* (- (/ 1 ux) 1) ux) (- (/ 1 ux) 1) (/ 1 ux) 1 ux)
1.0ms	ux	@	inf	((- 1 ux) (* (- (/ 1 ux) 1) ux) (- (/ 1 ux) 1) (/ 1 ux) 1 ux)
0.0ms	maxCos	@	0	((- 1 ux) (* (- (/ 1 ux) 1) ux) (- (/ 1 ux) 1) (/ 1 ux) 1 ux)
0.0ms	uy	@	0	((- 1 ux) (* (- (/ 1 ux) 1) ux) (- (/ 1 ux) 1) (/ 1 ux) 1 ux)

rewrite713.0ms (21.1%)

Memory

28.2MiB live, 220.3MiB allocated; 96ms collecting garbage

Counts

22 → 21

Calls

Call 1

Inputs
#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
(*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux)
(-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32))
(/.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux
#s(approx (- 1 ux) #s(hole binary32 1))
#s(approx (- 1 ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 1))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (+ 1 (* -1 ux))))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (/ 1 ux)))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (/ (+ 1 (* -1 ux)) ux)))
#s(approx (/ 1 ux) #s(hole binary32 (/ 1 ux)))
#s(approx ux #s(hole binary32 ux))
#s(approx (- 1 ux) #s(hole binary32 (* -1 ux)))
#s(approx (- 1 ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* -1 ux)))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* ux (- (/ 1 ux) 1))))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 -1))
#s(approx (- (/ 1 ux) 1) #s(hole binary32 (- (/ 1 ux) 1)))
#s(approx (- 1 ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))
#s(approx (* (- (/ 1 ux) 1) ux) #s(hole binary32 (* -1 (* ux (- 1 (/ 1 ux))))))

Outputs
#s(approx (- 1 ux) (*.f32 ux (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32))))
(*.f32 ux (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)))
(-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32))
(/.f32 #s(literal 1 binary32) ux)
#s(literal 1 binary32)
ux
#s(approx (- 1 ux) #s(literal 1 binary32))
#s(approx (- 1 ux) (-.f32 #s(literal 1 binary32) ux))
#s(approx (* ux (- (/ 1 ux) 1)) #s(literal 1 binary32))
#s(approx (* ux (- (/ 1 ux) 1)) (-.f32 #s(literal 1 binary32) ux))
#s(approx (- (/ 1 ux) 1) (/.f32 #s(literal 1 binary32) ux))
#s(approx (- (/ 1 ux) 1) (/.f32 (-.f32 #s(literal 1 binary32) ux) ux))
#s(approx (/ 1 ux) (/.f32 #s(literal 1 binary32) ux))
#s(approx ux ux)
#s(approx (- 1 ux) (neg.f32 ux))
#s(approx (* ux (- (/ 1 ux) 1)) (neg.f32 ux))
#s(approx (* ux (- (/ 1 ux) 1)) (*.f32 ux (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32))))
#s(approx (- (/ 1 ux) 1) #s(literal -1 binary32))
#s(approx (- (/ 1 ux) 1) (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)))
#s(approx (- 1 ux) (*.f32 (-.f32 #s(literal 1 binary32) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))
#s(approx (* ux (- (/ 1 ux) 1)) (*.f32 (-.f32 #s(literal 1 binary32) (/.f32 #s(literal 1 binary32) ux)) (neg.f32 ux)))

eval10.0ms (0.3%)

Memory: -57.2MiB live, 1.2MiB allocated; 13ms collecting garbage
Compiler: Compiled 78 to 33 computations (57.7% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	20	0	20
Fresh	0	0	0
Picked	0	1	1
Done	0	5	5
Total	20	6	26

Accuracy

100.0%

Counts

26 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
✓	97.5%	(-.f32 #s(literal 1 binary32) ux)
✓	99.9%	#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
✓	71.2%	#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
✓	96.3%	#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))
✓	17.0%	#s(approx ux ux)

Compiler

Compiled 62 to 67 computations (-8.1% saved)

regimes13.0ms (0.4%)

Memory

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

Counts

7 → 1

Calls

Call 1

Inputs
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
(-.f32 #s(literal 1 binary32) ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))
(fma.f32 maxCos ux (-.f32 #s(literal 1 binary32) ux))
(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))
#s(approx (- 1 ux) (*.f32 (-.f32 (/.f32 #s(literal 1 binary32) ux) #s(literal 1 binary32)) ux))

Outputs
#s(approx (- (+ 1 (* ux maxCos)) ux) (fma.f32 (-.f32 maxCos #s(literal 1 binary32)) ux #s(literal 1 binary32)))

Calls

4 calls:

3.0ms	uy
3.0ms	(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))
3.0ms	maxCos
3.0ms	ux

Results

Accuracy	Segments	Branch
99.9%	1	`(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))`
99.9%	1	`ux`
99.9%	1	`uy`
99.9%	1	`maxCos`

Compiler

Compiled 9 to 16 computations (-77.8% saved)

regimes9.0ms (0.3%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))
(-.f32 #s(literal 1 binary32) ux)

Outputs
(-.f32 #s(literal 1 binary32) ux)

Calls

4 calls:

2.0ms	uy
2.0ms	maxCos
2.0ms	ux
2.0ms	(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))

Results

Accuracy	Segments	Branch
97.5%	1	`(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))`
97.5%	1	`ux`
97.5%	1	`uy`
97.5%	1	`maxCos`

Compiler

Compiled 9 to 16 computations (-77.8% saved)

regimes7.0ms (0.2%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx ux ux)
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))

Outputs
#s(approx (- (+ 1 (* ux maxCos)) ux) #s(literal 1 binary32))

Calls

4 calls:

2.0ms	uy
2.0ms	ux
2.0ms	maxCos
2.0ms	(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))

Results

Accuracy	Segments	Branch
71.2%	1	`(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))`
71.2%	1	`ux`
71.2%	1	`uy`
71.2%	1	`maxCos`

Compiler

Compiled 9 to 16 computations (-77.8% saved)

regimes6.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx ux ux)

Outputs
#s(approx ux ux)

Calls

4 calls:

1.0ms	uy
1.0ms	(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))
1.0ms	ux
1.0ms	maxCos

Results

Accuracy	Segments	Branch
17.0%	1	`(+.f32 (-.f32 #s(literal 1 binary32) ux) (*.f32 ux maxCos))`
17.0%	1	`uy`
17.0%	1	`ux`
17.0%	1	`maxCos`

Compiler

Compiled 9 to 16 computations (-77.8% saved)

derivations1.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 16 to 14 computations (12.5% saved)

preprocess41.0ms (1.2%)

Memory: -20.7MiB live, 26.2MiB allocated; 4ms collecting garbage
Remove: (abs uy)
Compiler: Compiled 68 to 79 computations (-16.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze46.0ms (1.3%)

sample702.0ms (20.7%)

preprocess209.0ms (6.2%)

series5.0ms (0.1%)

rewrite780.0ms (23%)

eval3.0ms (0.1%)

prune5.0ms (0.2%)

series15.0ms (0.4%)

rewrite809.0ms (23.9%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series3.0ms (0.1%)

rewrite713.0ms (21.1%)

eval10.0ms (0.3%)

prune3.0ms (0.1%)

regimes13.0ms (0.4%)

regimes9.0ms (0.3%)

regimes7.0ms (0.2%)

regimes6.0ms (0.2%)

derivations1.0ms (0%)

preprocess41.0ms (1.2%)

end0.0ms (0%)

Profiling