Metrics for Main:i from

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 11 to 7 computations (36.4% saved)

sample493.0ms (34.3%)

Memory

11.1MiB live, 525.6MiB allocated; 145ms collecting garbage

Samples

316.0ms

8 256×

valid

Precisions

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

ival-add!: 117.0ms (98.8% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess729.0ms (50.7%)

Memory

-29.6MiB live, 65.5MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	11	28
1	41	16
2	129	9
3	212	9
4	430	9
5	630	9
6	2819	9
7	6144	9

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)

Symmetry

(negabs x)

Compiler

Compiled 10 to 10 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

5 → 5

Calls

Call 1

Inputs
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
(+.f64 (+.f64 (+.f64 x x) x) x)
(+.f64 (+.f64 x x) x)
(+.f64 x x)
x

Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (+ (+ (+ x x) x) x) #s(hole binary64 (* 4 x)))
#s(approx (+ (+ x x) x) #s(hole binary64 (* 3 x)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

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

Time

Variable

Point

Expression

1.0ms

inf

((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)

1.0ms

-inf

((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)

1.0ms

((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)

rewrite60.0ms (4.2%)

Memory

-6.2MiB live, 40.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	68
0	27	68
0	82	62
1	198	62

Stop Event

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

Counts

10 → 25

Calls

Call 1

Inputs
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
(+.f64 (+.f64 (+.f64 x x) x) x)
(+.f64 (+.f64 x x) x)
(+.f64 x x)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (+ (+ (+ x x) x) x) #s(hole binary64 (* 4 x)))
#s(approx (+ (+ x x) x) #s(hole binary64 (* 3 x)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Outputs
(-.f64 (fma.f64 #s(literal 2 binary64) x (+.f64 x x)) (neg.f64 x))
(+.f64 (fma.f64 #s(literal 2 binary64) x (+.f64 x x)) x)
(+.f64 (fma.f64 #s(literal 2 binary64) x x) (+.f64 x x))
(+.f64 x (fma.f64 #s(literal 2 binary64) x (+.f64 x x)))
(fma.f64 #s(literal 2 binary64) x (+.f64 x x))
(fma.f64 x #s(literal 2 binary64) (+.f64 x x))
(-.f64 (fma.f64 #s(literal 2 binary64) x x) (neg.f64 x))
(+.f64 (fma.f64 #s(literal 2 binary64) x x) x)
(+.f64 (+.f64 x x) (+.f64 x x))
(+.f64 x (fma.f64 #s(literal 2 binary64) x x))
(fma.f64 #s(literal 2 binary64) x x)
(fma.f64 x #s(literal 2 binary64) x)
(-.f64 (+.f64 x x) (neg.f64 x))
(+.f64 (+.f64 x x) x)
(+.f64 x (+.f64 x x))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(-.f64 x (neg.f64 x))
(+.f64 x x)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
#s(approx (+ (+ (+ x x) x) x) (*.f64 #s(literal 4 binary64) x))
#s(approx (+ (+ x x) x) (*.f64 #s(literal 3 binary64) x))
#s(approx (+ x x) (+.f64 x x))
#s(approx x x)

eval2.0ms (0.1%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 99 to 66 computations (33.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	21	1	22
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	22	1	23

Accuracy

100.0%

Counts

23 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 2

Calls

Call 1

Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
#s(literal 5 binary64)
x

Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)
1.0ms	x	@	inf	((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)
1.0ms	x	@	0	((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)

rewrite66.0ms (4.6%)

Memory

21.6MiB live, 66.4MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	34
0	11	34
1	63	26
0	508	24
1	1741	24

Stop Event

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

Counts

6 → 7

Calls

Call 1

Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
#s(literal 5 binary64)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx x #s(hole binary64 x))

Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
(*.f64 x #s(literal 5 binary64))
#s(literal 5 binary64)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
#s(approx x x)

eval0.0ms (0%)

Memory: 0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 11 to 11 computations (0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))

Compiler

Compiled 20 to 20 computations (0% saved)

regimes3.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)

Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))

Calls

2 calls:

1.0ms	(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
1.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)`
100.0%	1	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 8 to 8 computations (0% saved)

preprocess77.0ms (5.3%)

Memory: -43.4MiB live, 53.3MiB allocated; 13ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 29 to 29 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample493.0ms (34.3%)

preprocess729.0ms (50.7%)

series3.0ms (0.2%)

rewrite60.0ms (4.2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite66.0ms (4.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

derivations1.0ms (0.1%)

preprocess77.0ms (5.3%)

end0.0ms (0%)

Profiling