Metrics for 2-ancestry mixing, zero discriminant

start0.0ms (0%)

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

analyze11.0ms (0.9%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 8 to 8 computations (0% saved)

sample833.0ms (68.8%)

Memory

19.2MiB live, 1 216.3MiB allocated; 297ms collecting garbage

Samples

535.0ms

8 256×

valid

Precisions

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

ival-cbrt: 123.0ms (49.5% of total)

ival-mult!: 76.0ms (30.6% of total)

ival-div!: 48.0ms (19.3% of total)

adjust: 1.0ms (0.4% of total)

Bogosity

preprocess29.0ms (2.4%)

Memory

-21.6MiB live, 71.2MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	6

Stop Event

1×	iter-limit
1×	iter-limit
1×	unsound

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	22.4%	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Symmetry

(abs g)

(abs a)

(sort g a)

Compiler

Compiled 12 to 12 computations (0% saved)

series45.0ms (3.7%)

Memory

0.3MiB live, 96.8MiB allocated; 14ms collecting garbage

Counts

6 → 6

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(/.f64 g (*.f64 #s(literal 2 binary64) a))
g
(*.f64 #s(literal 2 binary64) a)
#s(literal 2 binary64)
a

Outputs
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (/ g (* 2 a)) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (* 2 a) #s(hole binary64 (* 2 a)))
#s(approx a #s(hole binary64 a))

Calls

6 calls:

Time	Variable		Point	Expression
13.0ms	g	@	-inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) g (* 2 a) 2 a)
12.0ms	a	@	-inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) g (* 2 a) 2 a)
6.0ms	g	@	0	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) g (* 2 a) 2 a)
5.0ms	g	@	inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) g (* 2 a) 2 a)
4.0ms	a	@	inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) g (* 2 a) 2 a)

rewrite47.0ms (3.9%)

Memory

28.1MiB live, 74.4MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	29	73
0	32	42
0	91	42
1	135	42

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

12 → 17

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(/.f64 g (*.f64 #s(literal 2 binary64) a))
g
(*.f64 #s(literal 2 binary64) a)
#s(literal 2 binary64)
a
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (/ g (* 2 a)) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (* 2 a) #s(hole binary64 (* 2 a)))
#s(approx a #s(hole binary64 a))

Outputs
#s(literal 1/3 binary64)
(*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a)))
(/.f64 (/.f64 g #s(literal 2 binary64)) a)
(/.f64 (neg.f64 g) (neg.f64 (+.f64 a a)))
(/.f64 g (+.f64 a a))
g
(*.f64 a #s(literal 2 binary64))
(*.f64 #s(literal 2 binary64) a)
(+.f64 a a)
#s(literal 2 binary64)
a
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
#s(approx (/ g (* 2 a)) (*.f64 (/.f64 g a) #s(literal 1/2 binary64)))
#s(approx g g)
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(approx (* 2 a) (+.f64 a a))
#s(approx a a)

eval3.0ms (0.2%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 56 to 44 computations (21.4% saved)

prune7.0ms (0.5%)

Memory

-39.6MiB live, 7.1MiB allocated; 3ms collecting garbage

Pruning

4 alts after pruning (4 fresh and 0 done)

	Pruned	Kept	Total
New	9	4	13
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	10	4	14

Accuracy

77.1%

Counts

14 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	22.4%	(cbrt.f64 (/.f64 g (+.f64 a a)))
▶	22.4%	(cbrt.f64 (*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a))))
▶	4.5%	#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
▶	4.7%	#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))

Compiler

Compiled 28 to 28 computations (0% saved)

series50.0ms (4.1%)

Memory

37.6MiB live, 85.2MiB allocated; 8ms collecting garbage

Counts

13 → 7

Calls

Call 1

Inputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(literal -1/3 binary64)
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
#s(literal 1/3 binary64)
(cbrt.f64 (*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a))))
(*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a)))
g
(/.f64 #s(literal 1 binary64) (+.f64 a a))
#s(literal 1 binary64)
(+.f64 a a)
a
(cbrt.f64 (/.f64 g (+.f64 a a)))
(/.f64 g (+.f64 a a))

Outputs
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (* g (/ 1 (+ a a))) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (/ 1 (+ a a)) #s(hole binary64 (/ 1/2 a)))
#s(approx (+ a a) #s(hole binary64 (* 2 a)))
#s(approx a #s(hole binary64 a))

Calls

6 calls:

Time	Variable		Point	Expression
14.0ms	a	@	0	((cbrt (/ g (* 2 a))) -1/3 (cbrt (/ g (* 2 a))) 1/3 (cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) 1 (+ a a) a (cbrt (/ g (+ a a))) (/ g (+ a a)))
7.0ms	a	@	-inf	((cbrt (/ g (* 2 a))) -1/3 (cbrt (/ g (* 2 a))) 1/3 (cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) 1 (+ a a) a (cbrt (/ g (+ a a))) (/ g (+ a a)))
7.0ms	a	@	inf	((cbrt (/ g (* 2 a))) -1/3 (cbrt (/ g (* 2 a))) 1/3 (cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) 1 (+ a a) a (cbrt (/ g (+ a a))) (/ g (+ a a)))
7.0ms	g	@	-inf	((cbrt (/ g (* 2 a))) -1/3 (cbrt (/ g (* 2 a))) 1/3 (cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) 1 (+ a a) a (cbrt (/ g (+ a a))) (/ g (+ a a)))
7.0ms	g	@	0	((cbrt (/ g (* 2 a))) -1/3 (cbrt (/ g (* 2 a))) 1/3 (cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) 1 (+ a a) a (cbrt (/ g (+ a a))) (/ g (+ a a)))

rewrite35.0ms (2.9%)

Memory

-14.7MiB live, 31.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	42	122
0	50	70
0	142	70
1	206	70

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

20 → 36

Calls

Call 1

Inputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(literal -1/3 binary64)
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
#s(literal 1/3 binary64)
(cbrt.f64 (*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a))))
(*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a)))
g
(/.f64 #s(literal 1 binary64) (+.f64 a a))
#s(literal 1 binary64)
(+.f64 a a)
a
(cbrt.f64 (/.f64 g (+.f64 a a)))
(/.f64 g (+.f64 a a))
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (* g (/ 1 (+ a a))) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (/ g (* 2 a))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (/ 1 (+ a a)) #s(hole binary64 (/ 1/2 a)))
#s(approx (+ a a) #s(hole binary64 (* 2 a)))
#s(approx a #s(hole binary64 a))

Outputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(literal -1/3 binary64)
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
#s(literal 1/3 binary64)
#s(literal 1/3 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) (+.f64 a a)) g)
(*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a)))
(/.f64 (*.f64 g #s(literal 1 binary64)) (+.f64 a a))
(/.f64 (/.f64 g #s(literal 2 binary64)) a)
(/.f64 (neg.f64 g) (neg.f64 (+.f64 a a)))
(/.f64 g (+.f64 a a))
g
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 a a)))
(pow.f64 (+.f64 a a) #s(literal -1 binary64))
(/.f64 #s(literal -1 binary64) (neg.f64 (+.f64 a a)))
(/.f64 #s(literal 1 binary64) (+.f64 a a))
#s(literal 1 binary64)
(*.f64 a #s(literal 2 binary64))
(*.f64 #s(literal 2 binary64) a)
(-.f64 a (neg.f64 a))
(+.f64 a a)
a
#s(literal 1/3 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) (+.f64 a a)) g)
(*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a)))
(/.f64 (*.f64 g #s(literal 1 binary64)) (+.f64 a a))
(/.f64 (/.f64 g #s(literal 2 binary64)) a)
(/.f64 (neg.f64 g) (neg.f64 (+.f64 a a)))
(/.f64 g (+.f64 a a))
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
#s(approx (* g (/ 1 (+ a a))) (*.f64 (/.f64 g a) #s(literal 1/2 binary64)))
#s(approx g g)
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))
#s(approx (+ a a) (+.f64 a a))
#s(approx a a)

eval4.0ms (0.4%)

Memory: 6.8MiB live, 6.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 104 to 78 computations (25% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	20	1	21
Fresh	0	0	0
Picked	1	3	4
Done	0	0	0
Total	21	4	25

Accuracy

77.1%

Counts

25 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	22.4%	(cbrt.f64 (/.f64 g (+.f64 a a)))
▶	22.4%	(cbrt.f64 (*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))))
✓	4.5%	#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
✓	4.7%	#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))

Compiler

Compiled 31 to 31 computations (0% saved)

series41.0ms (3.4%)

Memory

-23.8MiB live, 65.8MiB allocated; 9ms collecting garbage

Counts

7 → 6

Calls

Call 1

Inputs
(cbrt.f64 (*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))))
(*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a)))
g
#s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))
(/.f64 #s(literal 1/2 binary64) a)
#s(literal 1/2 binary64)
a

Outputs
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (* g (/ 1 (+ a a))) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (/ 1 (+ a a)) #s(hole binary64 (/ 1/2 a)))
#s(approx a #s(hole binary64 a))

Calls

6 calls:

Time	Variable		Point	Expression
11.0ms	g	@	inf	((cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) (/ 1/2 a) 1/2 a)
7.0ms	a	@	-inf	((cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) (/ 1/2 a) 1/2 a)
7.0ms	g	@	-inf	((cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) (/ 1/2 a) 1/2 a)
6.0ms	g	@	0	((cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) (/ 1/2 a) 1/2 a)
5.0ms	a	@	0	((cbrt (* g (/ 1 (+ a a)))) (* g (/ 1 (+ a a))) g (/ 1 (+ a a)) (/ 1/2 a) 1/2 a)

rewrite52.0ms (4.3%)

Memory

-3.1MiB live, 49.4MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	32	102
0	34	59
0	115	59
1	177	59

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

13 → 16

Calls

Call 1

Inputs
(cbrt.f64 (*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))))
(*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a)))
g
#s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))
(/.f64 #s(literal 1/2 binary64) a)
#s(literal 1/2 binary64)
a
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(hole binary64 (/ (* (cbrt g) (cbrt 1/2)) (cbrt a))))
#s(approx (* g (/ 1 (+ a a))) #s(hole binary64 (* 1/2 (/ g a))))
#s(approx g #s(hole binary64 g))
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(hole binary64 (* -1 (/ (* (cbrt g) (cbrt -1/2)) (cbrt a)))))
#s(approx (/ 1 (+ a a)) #s(hole binary64 (/ 1/2 a)))
#s(approx a #s(hole binary64 a))

Outputs
#s(literal 1/3 binary64)
(*.f64 #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a)) g)
(*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a)))
g
#s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))
(*.f64 #s(literal 1/2 binary64) (/.f64 #s(literal 1 binary64) a))
(/.f64 #s(literal -1/2 binary64) (neg.f64 a))
(/.f64 #s(literal 1/2 binary64) a)
#s(literal 1/2 binary64)
a
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(literal 1/3 binary64))
#s(approx (* g (/ 1 (+ a a))) (*.f64 (/.f64 g a) #s(literal 1/2 binary64)))
#s(approx g g)
#s(approx (cbrt (* g (/ 1 (+ a a)))) #s(literal -1/3 binary64))
#s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))
#s(approx a a)

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 53 to 40 computations (24.5% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	9	4	13

Accuracy

77.1%

Counts

13 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	22.4%	(cbrt.f64 (/.f64 g (+.f64 a a)))
✓	22.4%	(cbrt.f64 (*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))))
✓	4.5%	#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
✓	4.7%	#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))

Compiler

Compiled 64 to 60 computations (6.3% saved)

regimes15.0ms (1.3%)

Memory

-12.3MiB live, 33.0MiB allocated; 4ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))
(cbrt.f64 (/.f64 g (+.f64 a a)))
(cbrt.f64 (*.f64 g #s(approx (/ 1 (+ a a)) (/.f64 #s(literal 1/2 binary64) a))))
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(cbrt.f64 (*.f64 g (/.f64 #s(literal 1 binary64) (+.f64 a a))))

Outputs
(cbrt.f64 (/.f64 g (+.f64 a a)))

Calls

5 calls:

2.0ms	(*.f64 #s(literal 2 binary64) a)
2.0ms	a
2.0ms	g
2.0ms	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
2.0ms	(/.f64 g (*.f64 #s(literal 2 binary64) a))

Results

Accuracy	Segments	Branch
22.4%	1	`(*.f64 #s(literal 2 binary64) a)`
22.4%	1	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`
22.4%	1	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`
22.4%	1	`g`
22.4%	1	`a`

Compiler

Compiled 16 to 19 computations (-18.8% saved)

regimes7.0ms (0.6%)

Memory

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

Accuracy

Total -2.0b remaining (-3.3%)

Threshold costs -2b (-3.3%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))
#s(approx (cbrt (/ g (* 2 a))) #s(literal 1/3 binary64))

Outputs
#s(approx (cbrt (/ g (* 2 a))) #s(literal -1/3 binary64))

Calls

5 calls:

1.0ms	(*.f64 #s(literal 2 binary64) a)
1.0ms	a
1.0ms	g
1.0ms	(/.f64 g (*.f64 #s(literal 2 binary64) a))
1.0ms	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Results

Accuracy	Segments	Branch
4.7%	1	`g`
4.7%	1	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`
4.7%	1	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`
4.7%	1	`(*.f64 #s(literal 2 binary64) a)`
4.7%	1	`a`

Compiler

Compiled 16 to 19 computations (-18.8% saved)

derivations2.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 11 to 11 computations (0% saved)

preprocess22.0ms (1.8%)

Memory

13.8MiB live, 59.9MiB allocated; 2ms collecting garbage

Remove

(sort g a)

(abs a)

(abs g)

Compiler

Compiled 95 to 95 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze11.0ms (0.9%)

sample833.0ms (68.8%)

preprocess29.0ms (2.4%)

series45.0ms (3.7%)

rewrite47.0ms (3.9%)

eval3.0ms (0.2%)

prune7.0ms (0.5%)

series50.0ms (4.1%)

rewrite35.0ms (2.9%)

eval4.0ms (0.4%)

prune3.0ms (0.2%)

series41.0ms (3.4%)

rewrite52.0ms (4.3%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

regimes15.0ms (1.3%)

regimes7.0ms (0.6%)

derivations2.0ms (0.2%)

preprocess22.0ms (1.8%)

end0.0ms (0%)

Profiling