Metrics for 2-ancestry mixing, zero discriminant

start0.0ms (0%)

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

analyze21.0ms (0.6%)

Memory

18.2MiB live, 18.2MiB 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)

sample898.0ms (24.7%)

Memory

21.8MiB live, 679.2MiB allocated; 242ms collecting garbage

Samples

599.0ms

8 256×

valid

Precisions

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

ival-div: 184.0ms (45.9% of total)

ival-mult: 130.0ms (32.4% of total)

ival-cbrt: 72.0ms (17.9% of total)

ival-true: 5.0ms (1.2% of total)

exact: 4.0ms (1% of total)

ival-assert: 3.0ms (0.7% of total)

adjust: 2.0ms (0.5% of total)

Bogosity

explain65.0ms (1.8%)

Memory

-26.3MiB live, 115.5MiB allocated; 22ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
48	-	3	(-1.7796385092451363e-144 1.5903386888571271e+178)	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`
0	-	0	-	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`a`
0	-	0	-	`g`
0	-	0	-	`(*.f64 #s(literal 2 binary64) a)`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`cbrt.f64`	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`	oflow-rescue	26	0
↳	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`	overflow	26
`cbrt.f64`	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`	uflow-rescue	19	0
↳	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`	underflow	19

Confusion

	Predicted +	Predicted -
+	45	3
-	0	208

Precision

1.0

Recall

0.9375

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	45	0	3
-	0	0	208

Precision?

1.0

Recall?

0.9375

Freqs

test

number	freq
0	211
1	45

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

26.0ms

512×

valid

Compiler

Compiled 44 to 22 computations (50% saved)

Precisions

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

ival-div: 4.0ms (35.8% of total)

ival-mult: 3.0ms (26.8% of total)

ival-cbrt: 3.0ms (26.8% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess226.0ms (6.2%)

Memory

0.0MiB live, 137.9MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	36
1	42	32
2	72	32
3	125	32
4	298	32
5	1444	32
6	6274	32
0	10	8
0	15	8
1	17	8
2	20	8
3	25	8
4	45	8
5	122	8
6	575	8
7	4689	8
0	8422	8

Stop Event

1×	saturated
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

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

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

Compiler

Compiled 6 to 6 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune5.0ms (0.1%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 6 computations (0% saved)

simplify138.0ms (3.8%)

Memory

-8.6MiB live, 87.4MiB allocated; 12ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 #s(literal 2 binary64) a)
cost-diff	0	(/.f64 g (*.f64 #s(literal 2 binary64) a))
cost-diff	0	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	25
0	15	25
1	17	25
2	20	25
3	25	25
4	45	25
5	122	25
6	575	25
7	4689	25
0	8422	25

Stop Event

1×	saturated
1×	node limit
1×	iter limit

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
(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

localize17.0ms (0.5%)

Memory

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

Localize:

Found 3 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 g (*.f64 #s(literal 2 binary64) a))
accuracy	0.0	(*.f64 #s(literal 2 binary64) a)
accuracy	11.633623738186094	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Samples

12.0ms

256×

valid

Compiler

Compiled 19 to 8 computations (57.9% saved)

Precisions

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

ival-div: 2.0ms (36.9% of total)

ival-mult: 2.0ms (36.9% of total)

ival-cbrt: 1.0ms (18.4% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series27.0ms (0.8%)

Memory

8.8MiB live, 53.8MiB allocated; 7ms collecting garbage

Counts

3 → 5

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable		Point	Expression
9.0ms	g	@	-inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) (* 2 a))
4.0ms	g	@	0	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) (* 2 a))
4.0ms	g	@	inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) (* 2 a))
4.0ms	a	@	0	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) (* 2 a))
3.0ms	a	@	inf	((cbrt (/ g (* 2 a))) (/ g (* 2 a)) (* 2 a))

simplify162.0ms (4.4%)

Memory

3.0MiB live, 105.1MiB allocated; 29ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	33	72
1	58	72
2	85	72
3	107	72
4	172	72
5	503	72
6	3396	72
0	8492	68
1	8995	68
2	10500	68
3	11050	68
4	11141	68
5	11197	68
6	11218	68

Stop Event

1×	saturated
1×	node limit

Counts

5 → 2

Calls

Call 1

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

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

rewrite31.0ms (0.9%)

Memory

-1.2MiB live, 44.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	20
1	15	20
2	17	20
3	19	20
4	21	20
0	21	20
1	35	20
0	99	14
1	149	14
2	192	14
3	197	14

Stop Event

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

Counts

3 → 17

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 152 to 62 computations (59.2% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	16	3	19
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	3	20

Accuracy

99.5%

Counts

20 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 19 computations (5% saved)

simplify713.0ms (19.6%)

Memory

-8.2MiB live, 84.4MiB allocated; 7ms collecting garbage

Localize:

Found 11 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(cbrt.f64 a)
cost-diff	0	(/.f64 g #s(literal 2 binary64))
cost-diff	0	(cbrt.f64 (/.f64 g #s(literal 2 binary64)))
cost-diff	0	(/.f64 (cbrt.f64 (/.f64 g #s(literal 2 binary64))) (cbrt.f64 a))
cost-diff	0	(*.f64 a #s(literal 2 binary64))
cost-diff	0	(cbrt.f64 (*.f64 a #s(literal 2 binary64)))
cost-diff	0	(cbrt.f64 g)
cost-diff	0	(/.f64 (cbrt.f64 g) (cbrt.f64 (*.f64 a #s(literal 2 binary64))))
cost-diff	0	(+.f64 a a)
cost-diff	0	(/.f64 g (+.f64 a a))
cost-diff	0	(cbrt.f64 (/.f64 g (+.f64 a a)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	70
0	25	70
1	27	70
2	30	70
3	35	70
4	55	70
5	132	70
6	585	70
7	4699	70
0	8432	70

Stop Event

1×	saturated
1×	node limit
1×	iter limit

Calls

Call 1

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

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

localize52.0ms (1.4%)

Memory

-7.1MiB live, 85.3MiB allocated; 10ms collecting garbage

Localize:

Found 11 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 g #s(literal 2 binary64))
accuracy	0.33498002930532605	(/.f64 (cbrt.f64 (/.f64 g #s(literal 2 binary64))) (cbrt.f64 a))
accuracy	0.5437088867581884	(cbrt.f64 (/.f64 g #s(literal 2 binary64)))
accuracy	0.6312676269897464	(cbrt.f64 a)
accuracy	0.0	(*.f64 a #s(literal 2 binary64))
accuracy	0.359375	(/.f64 (cbrt.f64 g) (cbrt.f64 (*.f64 a #s(literal 2 binary64))))
accuracy	0.5430451172213043	(cbrt.f64 g)
accuracy	0.5717164062950725	(cbrt.f64 (*.f64 a #s(literal 2 binary64)))
accuracy	0.0	(/.f64 g (+.f64 a a))
accuracy	0.0	(+.f64 a a)
accuracy	11.633623738186094	(cbrt.f64 (/.f64 g (+.f64 a a)))

Samples

41.0ms

256×

valid

Compiler

Compiled 56 to 16 computations (71.4% saved)

Precisions

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

ival-div: 10.0ms (50.8% of total)

ival-cbrt: 6.0ms (30.5% of total)

ival-add: 1.0ms (5.1% of total)

ival-mult: 1.0ms (5.1% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series68.0ms (1.9%)

Memory

-2.5MiB live, 90.3MiB allocated; 6ms collecting garbage

Counts

11 → 20

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable		Point	Expression
31.0ms	a	@	-inf	((cbrt (/ g (+ a a))) (/ g (+ a a)) (+ a a) (/ (cbrt g) (cbrt (* a 2))) (cbrt g) (cbrt (* a 2)) (* a 2) (/ (cbrt (/ g 2)) (cbrt a)) (cbrt (/ g 2)) (/ g 2) (cbrt a))
9.0ms	g	@	0	((cbrt (/ g (+ a a))) (/ g (+ a a)) (+ a a) (/ (cbrt g) (cbrt (* a 2))) (cbrt g) (cbrt (* a 2)) (* a 2) (/ (cbrt (/ g 2)) (cbrt a)) (cbrt (/ g 2)) (/ g 2) (cbrt a))
8.0ms	g	@	inf	((cbrt (/ g (+ a a))) (/ g (+ a a)) (+ a a) (/ (cbrt g) (cbrt (* a 2))) (cbrt g) (cbrt (* a 2)) (* a 2) (/ (cbrt (/ g 2)) (cbrt a)) (cbrt (/ g 2)) (/ g 2) (cbrt a))
8.0ms	g	@	-inf	((cbrt (/ g (+ a a))) (/ g (+ a a)) (+ a a) (/ (cbrt g) (cbrt (* a 2))) (cbrt g) (cbrt (* a 2)) (* a 2) (/ (cbrt (/ g 2)) (cbrt a)) (cbrt (/ g 2)) (/ g 2) (cbrt a))
6.0ms	a	@	inf	((cbrt (/ g (+ a a))) (/ g (+ a a)) (+ a a) (/ (cbrt g) (cbrt (* a 2))) (cbrt g) (cbrt (* a 2)) (* a 2) (/ (cbrt (/ g 2)) (cbrt a)) (cbrt (/ g 2)) (/ g 2) (cbrt a))

simplify421.0ms (11.6%)

Memory

22.4MiB live, 120.5MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	91	273
1	145	271
2	237	271
3	357	271
4	1103	271
5	6431	271
0	8172	261
1	9521	261
2	11678	261
3	12392	261
4	12433	261

Stop Event

1×	saturated
1×	node limit

Counts

20 → 5

Calls

Call 1

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

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

rewrite20.0ms (0.5%)

Memory

-20.3MiB live, 26.8MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	58
1	25	58
2	35	58
3	41	58
4	47	58
0	47	50
0	88	50
1	117	50
2	132	50
3	135	50

Stop Event

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

Counts

11 → 26

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 183 to 57 computations (68.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (2 fresh and 3 done)

	Pruned	Kept	Total
New	21	2	23
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	21	5	26

Accuracy

99.6%

Counts

26 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	98.2%	(/.f64 (/.f64 (cbrt.f64 g) (cbrt.f64 #s(literal 2 binary64))) (cbrt.f64 a))
✓	98.7%	(/.f64 (cbrt.f64 (/.f64 g #s(literal 2 binary64))) (cbrt.f64 a))
▶	98.3%	(/.f64 (cbrt.f64 g) (*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64))))
✓	98.7%	(/.f64 (cbrt.f64 g) (cbrt.f64 (*.f64 a #s(literal 2 binary64))))
✓	81.8%	(cbrt.f64 (/.f64 g (+.f64 a a)))

Compiler

Compiled 36 to 35 computations (2.8% saved)

simplify114.0ms (3.1%)

Memory

8.0MiB live, 53.9MiB allocated; 3ms collecting garbage

Localize:

Found 8 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(cbrt.f64 #s(literal 2 binary64))
cost-diff	0	(cbrt.f64 g)
cost-diff	0	(/.f64 (cbrt.f64 g) (cbrt.f64 #s(literal 2 binary64)))
cost-diff	0	(/.f64 (/.f64 (cbrt.f64 g) (cbrt.f64 #s(literal 2 binary64))) (cbrt.f64 a))
cost-diff	0	(cbrt.f64 a)
cost-diff	0	(*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64)))
cost-diff	0	(cbrt.f64 g)
cost-diff	0	(/.f64 (cbrt.f64 g) (*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64))))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	60
0	19	60
1	21	60
2	24	60
3	29	60
4	49	60
5	126	60
6	579	60
7	4693	60
0	8426	60

Stop Event

1×	saturated
1×	node limit
1×	iter limit

Calls

Call 1

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

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

localize76.0ms (2.1%)

Memory

-10.6MiB live, 85.6MiB allocated; 9ms collecting garbage

Localize:

Found 8 expressions of interest:

New	Metric	Score
accuracy	0.33498002930532605	(/.f64 (/.f64 (cbrt.f64 g) (cbrt.f64 #s(literal 2 binary64))) (cbrt.f64 a))
accuracy	0.5430451172213043	(cbrt.f64 g)
accuracy	0.6312676269897464	(cbrt.f64 a)
accuracy	1.0	(cbrt.f64 #s(literal 2 binary64))
accuracy	0.359375	(/.f64 (cbrt.f64 g) (*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64))))
accuracy	0.5430451172213043	(cbrt.f64 g)
accuracy	0.6312676269897464	(cbrt.f64 a)
accuracy	1.0	(cbrt.f64 #s(literal 2 binary64))

Samples

67.0ms

256×

valid

Compiler

Compiled 46 to 12 computations (73.9% saved)

Precisions

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

ival-mult: 6.0ms (43.3% of total)

ival-div: 4.0ms (28.9% of total)

ival-cbrt: 4.0ms (28.9% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series29.0ms (0.8%)

Memory

15.1MiB live, 61.3MiB allocated; 3ms collecting garbage

Counts

7 → 12

Calls

Call 1

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

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

Calls

6 calls:

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

simplify109.0ms (3%)

Memory

-20.9MiB live, 76.4MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	164
1	102	152
2	186	152
3	340	152
4	1091	152
5	6044	152
0	8485	144
1	8905	144
2	10100	144
3	10448	144
4	10457	144

Stop Event

1×	saturated
1×	node limit

Counts

12 → 4

Calls

Call 1

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

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

rewrite26.0ms (0.7%)

Memory

-16.2MiB live, 30.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	42
1	19	42
2	25	42
3	29	42
4	33	42
0	33	38
1	55	36
0	132	36
1	187	36
2	238	36
3	245	36

Stop Event

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

Counts

7 → 39

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 277 to 64 computations (76.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	31	1	32
Fresh	0	0	0
Picked	0	2	2
Done	0	3	3
Total	31	6	37

Accuracy

99.6%

Counts

37 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	98.2%	(/.f64 (/.f64 (cbrt.f64 g) (cbrt.f64 #s(literal 2 binary64))) (cbrt.f64 a))
▶	81.1%	(/.f64 (cbrt.f64 (/.f64 g a)) (cbrt.f64 #s(literal 2 binary64)))
✓	98.7%	(/.f64 (cbrt.f64 (/.f64 g #s(literal 2 binary64))) (cbrt.f64 a))
✓	98.3%	(/.f64 (cbrt.f64 g) (*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64))))
✓	98.7%	(/.f64 (cbrt.f64 g) (cbrt.f64 (*.f64 a #s(literal 2 binary64))))
✓	81.8%	(cbrt.f64 (/.f64 g (+.f64 a a)))

Compiler

Compiled 43 to 42 computations (2.3% saved)

simplify117.0ms (3.2%)

Memory

15.2MiB live, 62.1MiB allocated; 2ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(cbrt.f64 #s(literal 2 binary64))
cost-diff	0	(/.f64 g a)
cost-diff	0	(cbrt.f64 (/.f64 g a))
cost-diff	0	(/.f64 (cbrt.f64 (/.f64 g a)) (cbrt.f64 #s(literal 2 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	25
0	15	25
1	17	25
2	20	25
3	25	25
4	45	25
5	122	25
6	575	25
7	4689	25
0	8422	25

Stop Event

1×	saturated
1×	node limit
1×	iter limit

Calls

Call 1

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

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

localize23.0ms (0.6%)

Memory

1.6MiB live, 45.4MiB allocated; 3ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 g a)
accuracy	0.3125	(/.f64 (cbrt.f64 (/.f64 g a)) (cbrt.f64 #s(literal 2 binary64)))
accuracy	1.0	(cbrt.f64 #s(literal 2 binary64))
accuracy	11.639797727868796	(cbrt.f64 (/.f64 g a))

Samples

18.0ms

256×

valid

Compiler

Compiled 21 to 9 computations (57.1% saved)

Precisions

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

ival-cbrt: 6.0ms (54% of total)

ival-div: 5.0ms (45% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series35.0ms (1%)

Memory

23.5MiB live, 67.0MiB allocated; 8ms collecting garbage

Counts

4 → 7

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable		Point	Expression
19.0ms	g	@	-inf	((/ (cbrt (/ g a)) (cbrt 2)) (cbrt (/ g a)) (/ g a) (cbrt 2))
4.0ms	a	@	-inf	((/ (cbrt (/ g a)) (cbrt 2)) (cbrt (/ g a)) (/ g a) (cbrt 2))
3.0ms	g	@	inf	((/ (cbrt (/ g a)) (cbrt 2)) (cbrt (/ g a)) (/ g a) (cbrt 2))
3.0ms	a	@	inf	((/ (cbrt (/ g a)) (cbrt 2)) (cbrt (/ g a)) (/ g a) (cbrt 2))
3.0ms	g	@	0	((/ (cbrt (/ g a)) (cbrt 2)) (cbrt (/ g a)) (/ g a) (cbrt 2))

simplify84.0ms (2.3%)

Memory

-13.4MiB live, 72.8MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	99
1	61	93
2	103	93
3	223	93
4	894	93
5	5910	93
0	8305	85
1	8475	85
2	8972	85
3	9173	85
4	9182	85

Stop Event

1×	saturated
1×	node limit

Counts

7 → 4

Calls

Call 1

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

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

rewrite32.0ms (0.9%)

Memory

-2.5MiB live, 40.8MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	20
1	15	20
2	19	20
3	21	20
4	23	20
0	23	19
1	39	19
0	97	19
1	142	19
2	180	19
3	185	19

Stop Event

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

Counts

4 → 17

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 169 to 58 computations (65.7% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	18	1	19
Fresh	0	0	0
Picked	0	1	1
Done	1	4	5
Total	19	6	25

Accuracy

99.7%

Counts

25 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
	98.2%	(/.f64 (/.f64 (cbrt.f64 g) (cbrt.f64 a)) (cbrt.f64 #s(literal 2 binary64)))
✓	81.1%	(/.f64 (cbrt.f64 (/.f64 g a)) (cbrt.f64 #s(literal 2 binary64)))
✓	98.7%	(/.f64 (cbrt.f64 (/.f64 g #s(literal 2 binary64))) (cbrt.f64 a))
✓	98.3%	(/.f64 (cbrt.f64 g) (*.f64 (cbrt.f64 a) (cbrt.f64 #s(literal 2 binary64))))
✓	98.7%	(/.f64 (cbrt.f64 g) (cbrt.f64 (*.f64 a #s(literal 2 binary64))))
✓	81.8%	(cbrt.f64 (/.f64 g (+.f64 a a)))

Compiler

Compiled 100 to 69 computations (31% saved)

regimes13.0ms (0.4%)

Memory

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

Counts

8 → 1

Calls

Call 1

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

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

Calls

5 calls:

3.0ms	g
3.0ms	a
3.0ms	(*.f64 #s(literal 2 binary64) a)
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
98.7%	1	`(*.f64 #s(literal 2 binary64) a)`
98.7%	1	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`
98.7%	1	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`
98.7%	1	`g`
98.7%	1	`a`

Compiler

Compiled 16 to 19 computations (-18.8% saved)

regimes45.0ms (1.2%)

Memory

-30.0MiB live, 18.5MiB allocated; 38ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

5 calls:

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

Results

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

Compiler

Compiled 16 to 19 computations (-18.8% saved)

simplify37.0ms (1%)

Memory

-11.0MiB live, 38.4MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	15
1	23	15
2	26	15
3	32	15
4	64	15
5	384	15
6	3476	15

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations3.0ms (0.1%)

Memory

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

Stop Event

1×

fuel

Compiler

Compiled 13 to 10 computations (23.1% saved)

preprocess13.0ms (0.4%)

Memory: 21.5MiB live, 21.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 38 to 32 computations (15.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze21.0ms (0.6%)

sample898.0ms (24.7%)

explain65.0ms (1.8%)

preprocess226.0ms (6.2%)

eval0.0ms (0%)

prune5.0ms (0.1%)

simplify138.0ms (3.8%)

localize17.0ms (0.5%)

series27.0ms (0.8%)

simplify162.0ms (4.4%)

rewrite31.0ms (0.9%)

eval2.0ms (0.1%)

prune1.0ms (0%)

simplify713.0ms (19.6%)

localize52.0ms (1.4%)

series68.0ms (1.9%)

simplify421.0ms (11.6%)

rewrite20.0ms (0.5%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

simplify114.0ms (3.1%)

localize76.0ms (2.1%)

series29.0ms (0.8%)

simplify109.0ms (3%)

rewrite26.0ms (0.7%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

simplify117.0ms (3.2%)

localize23.0ms (0.6%)

series35.0ms (1%)

simplify84.0ms (2.3%)

rewrite32.0ms (0.9%)

eval2.0ms (0.1%)

prune3.0ms (0.1%)

regimes13.0ms (0.4%)

regimes45.0ms (1.2%)

simplify37.0ms (1%)

derivations3.0ms (0.1%)

preprocess13.0ms (0.4%)

end0.0ms (0%)

Profiling