Metrics for 2frac (problem 3.3.1)

start0.0ms (0%)

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

analyze2.0ms (0.1%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 11 to 8 computations (27.3% saved)

sample849.0ms (57.2%)

Memory

47.0MiB live, 683.8MiB allocated; 690ms collecting garbage

Samples

519.0ms	4 019×	1	valid
126.0ms	4 237×	0	valid

Precisions

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

ival-div!: 118.0ms (44.5% of total)

adjust: 71.0ms (26.8% of total)

ival-add!: 47.0ms (17.7% of total)

ival-sub!: 28.0ms (10.6% of total)

Bogosity

preprocess70.0ms (4.7%)

Memory

-33.0MiB live, 25.1MiB allocated; 87ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	31
1	55	27
2	271	27
3	1286	27

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 12 computations (25% saved)

series4.0ms (0.3%)

Memory

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

Counts

6 → 24

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite249.0ms (16.8%)

Memory

30.0MiB live, 164.3MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	84	438
0	89	401
1	567	391
2	3824	387

Stop Event

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

Counts

30 → 11

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 27 to 21 computations (22.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	3	2	5

Accuracy

77.6%

Counts

5 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	77.6%	(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) x))
▶	51.7%	(-.f64 #s(approx (/ 1 (+ x 1)) #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) x))

Compiler

Compiled 17 to 14 computations (17.6% saved)

series1.0ms (0.1%)

Memory

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

Counts

5 → 22

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite250.0ms (16.8%)

Memory

-13.0MiB live, 129.5MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	77	421
0	80	388
1	550	378
2	3791	374

Stop Event

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

Counts

27 → 8

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 14 to 13 computations (7.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

77.6%

Counts

4 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	77.6%	(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) x))
✓	51.7%	(-.f64 #s(approx (/ 1 (+ x 1)) #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) x))

Compiler

Compiled 30 to 25 computations (16.7% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

derivations16.0ms (1.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 13 to 11 computations (15.4% saved)

preprocess36.0ms (2.4%)

Memory: -15.2MiB live, 29.1MiB allocated; 5ms collecting garbage
Compiler: Compiled 33 to 29 computations (12.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze2.0ms (0.1%)

sample849.0ms (57.2%)

preprocess70.0ms (4.7%)

series4.0ms (0.3%)

rewrite249.0ms (16.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite250.0ms (16.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

derivations16.0ms (1.1%)

preprocess36.0ms (2.4%)

end0.0ms (0%)

Profiling