Metrics for Diagrams.Segment:$catParam from diagrams-lib-1.3.0.3, A

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample667.0ms (63.5%)

Memory

8.0MiB live, 859.2MiB allocated; 164ms collecting garbage

Samples

376.0ms

8 256×

valid

Precisions

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

ival-mult: 181.0ms (94% of total)

exact: 6.0ms (3.1% of total)

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

adjust: 2.0ms (1% of total)

Bogosity

explain63.0ms (6%)

Memory

15.3MiB live, 104.9MiB allocated; 10ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
39	-	-	`(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)`
0	-	-	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
0	-	-	`y`
0	-	-	`#s(literal 3 binary64)`
0	-	-	`(*.f64 x #s(literal 3 binary64))`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)`	*no**	21	0
`*.f64`	`(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)`	*nu**	18	0

Confusion

	Predicted +	Predicted -
+	39	0
-	0	217

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	39	0	0
-	0	0	217

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	217
1	39

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

23.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

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

ival-mult: 10.0ms (92.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)

preprocess33.0ms (3.1%)

Memory

-1.7MiB live, 44.1MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	44
1	49	42
2	141	42
3	305	42
4	484	42
5	735	42
6	870	42
0	6	7
0	9	7
1	15	7
2	29	7
3	49	7
4	92	7
5	189	7
6	306	7
7	398	7
8	438	7
0	438	7

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)

Outputs
(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))

Symmetry

(abs x)

(negabs y)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	85.7%	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)

Compiler

Compiled 7 to 6 computations (14.3% saved)

series7.0ms (0.7%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
y

Outputs
#s(approx (* (* (* x 3) x) y) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	x	@	inf	((* (* (* x 3) x) y) (* (* x 3) x) (* x 3) x 3 y)
1.0ms	y	@	inf	((* (* (* x 3) x) y) (* (* x 3) x) (* x 3) x 3 y)
1.0ms	x	@	0	((* (* (* x 3) x) y) (* (* x 3) x) (* x 3) x 3 y)
1.0ms	x	@	-inf	((* (* (* x 3) x) y) (* (* x 3) x) (* x 3) x 3 y)
1.0ms	y	@	0	((* (* (* x 3) x) y) (* (* x 3) x) (* x 3) x 3 y)

rewrite78.0ms (7.4%)

Memory

-28.0MiB live, 25.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	57
0	24	57
1	43	57
0	106	57

Stop Event

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

Counts

11 → 26

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
y
#s(approx (* (* (* x 3) x) y) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(.f64 (.f64 #s(literal 3 binary64) y) (*.f64 x x))
(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
(.f64 (.f64 x x) (*.f64 y #s(literal 3 binary64)))
(.f64 (.f64 x x) (*.f64 #s(literal 3 binary64) y))
(.f64 y (.f64 (*.f64 #s(literal 3 binary64) x) x))
(.f64 (.f64 (*.f64 #s(literal 3 binary64) x) x) y)
(.f64 (.f64 #s(literal 3 binary64) x) (*.f64 y x))
(.f64 #s(literal 3 binary64) (.f64 (*.f64 x x) y))
(.f64 x (.f64 (*.f64 #s(literal 3 binary64) x) y))
(.f64 x (.f64 #s(literal 3 binary64) (*.f64 y x)))
(.f64 (.f64 x x) #s(literal 3 binary64))
(.f64 (.f64 #s(literal 3 binary64) x) x)
(.f64 #s(literal 3 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal 3 binary64) x))
(*.f64 #s(literal 3 binary64) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
y
#s(approx (* (* (* x 3) x) y) (.f64 y (.f64 (*.f64 #s(literal 3 binary64) x) x)))
#s(approx (* (* x 3) x) (.f64 (.f64 #s(literal 3 binary64) x) x))
#s(approx (* x 3) (*.f64 #s(literal 3 binary64) x))
#s(approx x x)
#s(approx y y)

eval2.0ms (0.2%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 220 to 52 computations (76.4% saved)

prune6.0ms (0.6%)

Memory

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

Pruning

5 alts after pruning (4 fresh and 1 done)

	Pruned	Kept	Total
New	24	4	28
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	24	5	29

Accuracy

100.0%

Counts

29 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
	85.7%	(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
✓	85.7%	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
	99.8%	(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)
	85.7%	(.f64 (.f64 x x) (*.f64 y #s(literal 3 binary64)))
▶	99.7%	(.f64 x (.f64 #s(literal 3 binary64) (*.f64 y x)))

Compiler

Compiled 35 to 30 computations (14.3% saved)

series6.0ms (0.6%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
(.f64 x (.f64 #s(literal 3 binary64) (*.f64 y x)))
x
(.f64 #s(literal 3 binary64) (.f64 y x))
#s(literal 3 binary64)
(*.f64 y x)
y

Outputs
#s(approx (* x (* 3 (* y x))) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx x #s(hole binary64 x))
#s(approx (* 3 (* y x)) #s(hole binary64 (* 3 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((* x (* 3 (* y x))) x (* 3 (* y x)) 3 (* y x) y)
1.0ms	x	@	-inf	((* x (* 3 (* y x))) x (* 3 (* y x)) 3 (* y x) y)
1.0ms	y	@	inf	((* x (* 3 (* y x))) x (* 3 (* y x)) 3 (* y x) y)
1.0ms	x	@	0	((* x (* 3 (* y x))) x (* 3 (* y x)) 3 (* y x) y)
1.0ms	x	@	inf	((* x (* 3 (* y x))) x (* 3 (* y x)) 3 (* y x) y)

rewrite37.0ms (3.5%)

Memory

-16.3MiB live, 27.5MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	57
0	23	57
1	47	57
0	116	57

Stop Event

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

Counts

11 → 27

Calls

Call 1

Inputs
(.f64 x (.f64 #s(literal 3 binary64) (*.f64 y x)))
x
(.f64 #s(literal 3 binary64) (.f64 y x))
#s(literal 3 binary64)
(*.f64 y x)
y
#s(approx (* x (* 3 (* y x))) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx x #s(hole binary64 x))
#s(approx (* 3 (* y x)) #s(hole binary64 (* 3 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx y #s(hole binary64 y))

Outputs
(.f64 (.f64 x (*.f64 #s(literal 3 binary64) x)) y)
(.f64 (.f64 (*.f64 #s(literal 3 binary64) x) x) y)
(.f64 (.f64 y #s(literal 3 binary64)) (*.f64 x x))
(.f64 (.f64 #s(literal 3 binary64) x) (*.f64 y x))
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
(.f64 (.f64 x x) (*.f64 y #s(literal 3 binary64)))
(.f64 (.f64 (*.f64 y x) #s(literal 3 binary64)) x)
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(.f64 y (.f64 (*.f64 #s(literal 3 binary64) x) x))
(.f64 #s(literal 3 binary64) (.f64 (*.f64 x x) y))
(.f64 x (.f64 (*.f64 y x) #s(literal 3 binary64)))
x
(.f64 (.f64 y #s(literal 3 binary64)) x)
(.f64 (.f64 #s(literal 3 binary64) x) y)
(.f64 (.f64 y x) #s(literal 3 binary64))
(.f64 y (.f64 #s(literal 3 binary64) x))
(.f64 #s(literal 3 binary64) (.f64 y x))
(.f64 x (.f64 y #s(literal 3 binary64)))
#s(literal 3 binary64)
(*.f64 y x)
(*.f64 x y)
y
#s(approx (* x (* 3 (* y x))) (.f64 (.f64 (*.f64 y x) #s(literal 3 binary64)) x))
#s(approx x x)
#s(approx (* 3 (* y x)) (.f64 (.f64 y x) #s(literal 3 binary64)))
#s(approx (* y x) (*.f64 y x))
#s(approx y y)

eval2.0ms (0.2%)

Memory: 4.7MiB live, 4.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 227 to 54 computations (76.2% saved)

prune7.0ms (0.7%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	27	2	29
Fresh	2	1	3
Picked	1	0	1
Done	0	1	1
Total	30	4	34

Accuracy

100.0%

Counts

34 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
	85.7%	(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
✓	85.7%	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
	99.7%	(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
▶	99.8%	(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))

Compiler

Compiled 28 to 24 computations (14.3% saved)

series6.0ms (0.6%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))
x
(.f64 (.f64 y #s(literal 3 binary64)) x)
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)

Outputs
#s(approx (* x (* (* y 3) x)) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx x #s(hole binary64 x))
#s(approx (* (* y 3) x) #s(hole binary64 (* 3 (* x y))))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	inf	((* x (* (* y 3) x)) x (* (* y 3) x) (* y 3) y 3)
1.0ms	y	@	-inf	((* x (* (* y 3) x)) x (* (* y 3) x) (* y 3) y 3)
1.0ms	x	@	-inf	((* x (* (* y 3) x)) x (* (* y 3) x) (* y 3) y 3)
1.0ms	x	@	inf	((* x (* (* y 3) x)) x (* (* y 3) x) (* y 3) y 3)
1.0ms	y	@	0	((* x (* (* y 3) x)) x (* (* y 3) x) (* y 3) y 3)

rewrite29.0ms (2.8%)

Memory

-14.4MiB live, 28.8MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	57
0	24	57
1	46	57
0	104	57

Stop Event

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

Counts

11 → 25

Calls

Call 1

Inputs
(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))
x
(.f64 (.f64 y #s(literal 3 binary64)) x)
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (* x (* (* y 3) x)) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx x #s(hole binary64 x))
#s(approx (* (* y 3) x) #s(hole binary64 (* 3 (* x y))))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Outputs
(.f64 (.f64 (*.f64 #s(literal 3 binary64) x) x) y)
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
(.f64 (.f64 x x) (*.f64 #s(literal 3 binary64) y))
(.f64 (.f64 (*.f64 #s(literal 3 binary64) y) x) x)
(.f64 (.f64 #s(literal 3 binary64) y) (*.f64 x x))
(.f64 #s(literal 3 binary64) (.f64 (*.f64 x x) y))
(.f64 y (.f64 (*.f64 #s(literal 3 binary64) x) x))
(.f64 x (.f64 (*.f64 #s(literal 3 binary64) y) x))
x
(.f64 (.f64 #s(literal 3 binary64) x) y)
(.f64 (.f64 y x) #s(literal 3 binary64))
(.f64 (.f64 #s(literal 3 binary64) y) x)
(.f64 #s(literal 3 binary64) (.f64 y x))
(.f64 y (.f64 #s(literal 3 binary64) x))
(.f64 x (.f64 #s(literal 3 binary64) y))
(*.f64 #s(literal 3 binary64) y)
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (* x (* (* y 3) x)) (.f64 (.f64 (*.f64 #s(literal 3 binary64) y) x) x))
#s(approx x x)
#s(approx (* (* y 3) x) (.f64 (.f64 #s(literal 3 binary64) y) x))
#s(approx (* y 3) (*.f64 #s(literal 3 binary64) y))
#s(approx y y)

eval2.0ms (0.2%)

Memory: 4.1MiB live, 4.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 213 to 50 computations (76.5% saved)

prune6.0ms (0.6%)

Memory

11.3MiB live, 11.2MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (2 fresh and 2 done)

	Pruned	Kept	Total
New	27	0	27
Fresh	0	2	2
Picked	0	1	1
Done	0	1	1
Total	27	4	31

Accuracy

100.0%

Counts

31 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
	85.7%	(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
✓	85.7%	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
▶	99.7%	(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
✓	99.8%	(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))

Compiler

Compiled 28 to 24 computations (14.3% saved)

series5.0ms (0.5%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(*.f64 y x)
y
x
(*.f64 #s(literal 3 binary64) x)
#s(literal 3 binary64)

Outputs
#s(approx (* (* y x) (* 3 x)) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* 3 x) #s(hole binary64 (* 3 x)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (* y x) (* 3 x)) (* y x) y x (* 3 x) 3)
1.0ms	x	@	inf	((* (* y x) (* 3 x)) (* y x) y x (* 3 x) 3)
1.0ms	y	@	-inf	((* (* y x) (* 3 x)) (* y x) y x (* 3 x) 3)
1.0ms	x	@	0	((* (* y x) (* 3 x)) (* y x) y x (* 3 x) 3)
1.0ms	y	@	inf	((* (* y x) (* 3 x)) (* y x) y x (* 3 x) 3)

rewrite29.0ms (2.8%)

Memory

-8.4MiB live, 35.0MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	51
0	22	51
1	42	51
0	103	51

Stop Event

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

Counts

11 → 23

Calls

Call 1

Inputs
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(*.f64 y x)
y
x
(*.f64 #s(literal 3 binary64) x)
#s(literal 3 binary64)
#s(approx (* (* y x) (* 3 x)) #s(hole binary64 (* 3 (* (pow x 2) y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* 3 x) #s(hole binary64 (* 3 x)))
#s(approx y #s(hole binary64 y))

Outputs
(.f64 (.f64 #s(literal 3 binary64) y) (*.f64 x x))
(.f64 (.f64 (*.f64 #s(literal 3 binary64) x) y) x)
(.f64 (.f64 (*.f64 x x) #s(literal 3 binary64)) y)
(.f64 (.f64 #s(literal 3 binary64) (*.f64 x y)) x)
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
(.f64 (.f64 x x) (*.f64 y #s(literal 3 binary64)))
(.f64 (.f64 #s(literal 3 binary64) x) (*.f64 x y))
(.f64 #s(literal 3 binary64) (.f64 (*.f64 x x) y))
(.f64 (.f64 x y) (*.f64 #s(literal 3 binary64) x))
(.f64 x (.f64 #s(literal 3 binary64) (*.f64 x y)))
(.f64 y (.f64 (*.f64 x x) #s(literal 3 binary64)))
(*.f64 x y)
(*.f64 y x)
y
x
(*.f64 #s(literal 3 binary64) x)
(*.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
#s(approx (* (* y x) (* 3 x)) (.f64 (.f64 #s(literal 3 binary64) y) (*.f64 x x)))
#s(approx (* y x) (*.f64 x y))
#s(approx x x)
#s(approx (* 3 x) (*.f64 #s(literal 3 binary64) x))
#s(approx y y)

eval2.0ms (0.2%)

Memory: 4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 197 to 44 computations (77.7% saved)

prune20.0ms (1.9%)

Memory

-56.5MiB live, 17.7MiB allocated; 17ms collecting garbage

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	1	1
Picked	0	1	1
Done	0	2	2
Total	25	4	29

Accuracy

100.0%

Counts

29 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
	85.7%	(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))
✓	85.7%	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
✓	99.7%	(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
✓	99.8%	(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))

Compiler

Compiled 77 to 44 computations (42.9% saved)

regimes10.0ms (0.9%)

Memory

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

Accuracy

Total -9.2b remaining (-7007.1%)

Threshold costs -9.2b (-7007.1%)

Counts

7 → 1

Calls

Call 1

Inputs
(.f64 x (.f64 #s(literal 3 binary64) (*.f64 y x)))
(.f64 x (.f64 (*.f64 y #s(literal 3 binary64)) x))
(.f64 (.f64 x x) (*.f64 y #s(literal 3 binary64)))
(.f64 (.f64 y x) (*.f64 #s(literal 3 binary64) x))
(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)
(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
(.f64 (.f64 (*.f64 x x) y) #s(literal 3 binary64))

Outputs
(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)

Calls

4 calls:

2.0ms	y
2.0ms	x
2.0ms	(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)
2.0ms	(.f64 (.f64 x #s(literal 3 binary64)) x)

Results

Accuracy	Segments	Branch
99.8%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.8%	1	`(.f64 (.f64 (*.f64 x #s(literal 3 binary64)) x) y)`
99.8%	1	`x`
99.8%	1	`y`

Compiler

Compiled 14 to 15 computations (-7.1% saved)

simplify9.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)

Outputs
(.f64 (.f64 y (*.f64 #s(literal 3 binary64) x)) x)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

fuel

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess22.0ms (2.1%)

Memory

-16.1MiB live, 30.9MiB allocated; 3ms collecting garbage

Remove

(negabs y)

(abs x)

Compiler

Compiled 70 to 60 computations (14.3% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	17	44
1	49	42
2	141	42
3	305	42
4	484	42
5	735	42
6	870	42
0	6	7
0	9	7
1	15	7
2	29	7
3	49	7
4	92	7
5	189	7
6	306	7
7	398	7
8	438	7
0	438	7

Iter	Nodes	Cost
0	17	44
1	49	42
2	141	42
3	305	42
4	484	42
5	735	42
6	870	42
0	6	7
0	9	7
1	15	7
2	29	7
3	49	7
4	92	7
5	189	7
6	306	7
7	398	7
8	438	7
0	438	7

start0.0ms (0%)

analyze0.0ms (0%)

sample667.0ms (63.5%)

explain63.0ms (6%)

preprocess33.0ms (3.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series7.0ms (0.7%)

rewrite78.0ms (7.4%)

eval2.0ms (0.2%)

prune6.0ms (0.6%)

series6.0ms (0.6%)

rewrite37.0ms (3.5%)

eval2.0ms (0.2%)

prune7.0ms (0.7%)

series6.0ms (0.6%)

rewrite29.0ms (2.8%)

eval2.0ms (0.2%)

prune6.0ms (0.6%)

series5.0ms (0.5%)

rewrite29.0ms (2.8%)

eval2.0ms (0.2%)

prune20.0ms (1.9%)

regimes10.0ms (0.9%)

simplify9.0ms (0.8%)

derivations1.0ms (0.1%)

preprocess22.0ms (2.1%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	17	44
1	49	42
2	141	42
3	305	42
4	484	42
5	735	42
6	870	42
0	6	7
0	9	7
1	15	7
2	29	7
3	49	7
4	92	7
5	189	7
6	306	7
7	398	7
8	438	7
0	438	7