1 <?xml version="1.0" encoding="UTF-8"?>
2 <!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
3 "https://www.why3.org/why3session.dtd">
4 <why3session shape_version="6">
5 <prover id="0" name="CVC3" version="2.4.1" timelimit="11" steplimit="0" memlimit="1000"/>
6 <prover id="1" name="CVC4" version="1.4" timelimit="11" steplimit="0" memlimit="1000"/>
7 <prover id="2" name="Alt-Ergo" version="2.1.0" timelimit="5" steplimit="0" memlimit="1000"/>
8 <prover id="4" name="Z3" version="4.12.2" timelimit="11" steplimit="0" memlimit="1000"/>
9 <file format="whyml" proved="true">
10 <path name=".."/><path name="largest_prime_factor.mlw"/>
11 <theory name="PrimeFactor" proved="true">
12 <goal name="smallest_divisor'vc" expl="VC for smallest_divisor" proved="true">
13 <transf name="split_goal_right" proved="true" >
14 <goal name="smallest_divisor'vc.0" expl="assertion" proved="true">
15 <transf name="split_goal_right" proved="true" >
16 <goal name="smallest_divisor'vc.0.0" expl="assertion" proved="true">
17 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="22"/></proof>
19 <goal name="smallest_divisor'vc.0.1" expl="assertion" proved="true">
20 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="75"/></proof>
22 <goal name="smallest_divisor'vc.0.2" expl="assertion" proved="true">
23 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="26"/></proof>
25 <goal name="smallest_divisor'vc.0.3" expl="assertion" proved="true">
26 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="26"/></proof>
28 <goal name="smallest_divisor'vc.0.4" expl="assertion" proved="true">
29 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="30"/></proof>
31 <goal name="smallest_divisor'vc.0.5" expl="assertion" proved="true">
32 <transf name="remove" proved="true" arg1="real,bool,tuple0,unit,zero,one,(-),(+),(-),abs,div,mod,even,odd,gcd,prime,coprime,Assoc1,Unit_def_l,Unit_def_r,Inv_def_l,Inv_def_r,Comm1,Assoc2,Mul_distr_l,Mul_distr_r,Comm2,Unitary,NonTrivialRing,Refl,Trans,Antisymm,Total,ZeroLessOne,CompatOrderAdd,CompatOrderMult,Abs_le,Abs_pos,Div_mod,Mod_bound,Div_unique,Div_bound,Mod_1,Div_1,Div_inf,Div_inf_neg,Mod_0,Div_1_left,Div_minus1_left,Mod_1_left,Mod_minus1_left,Div_mult,Mod_mult,Div_mod1,Div_bound1,Mod_bound1,Div_sign_pos,Div_sign_neg,Mod_sign_pos,Mod_sign_neg,Rounds_toward_zero,Div_11,Mod_11,Div_inf1,Mod_inf,Div_mult1,Mod_mult1,even_or_odd,even_not_odd,odd_not_even,even_odd,odd_even,even_even,odd_odd,even_2k,odd_2k1,even_mod2,divides'spec,divides_refl,divides_1_n,divides_0,divides_left,divides_right,divides_oppr,divides_oppl,divides_oppr_rev,divides_oppl_rev,divides_plusr,divides_minusr,divides_multl,divides_multr,divides_factorl,divides_factorr,divides_n_1,divides_antisym,divides_trans,divides_bounds,mod_divides_euclidean,divides_mod_euclidean,mod_divides_computer,divides_mod_computer,even_divides,odd_divides,gcd_nonneg,gcd_def1,gcd_def2,gcd_def3,gcd_unique,Assoc,Comm,gcd_0_pos,gcd_0_neg,gcd_opp,gcd_euclid,Gcd_computer_mod,Gcd_euclidean_mod,gcd_mult,not_prime_1,prime_2,prime_3,prime_divisors,small_divisors,even_prime,odd_prime,prime_coprime,Gauss,Euclid,gcd_coprime">
33 <goal name="smallest_divisor'vc.0.5.0" expl="assertion" proved="true">
34 <proof prover="4" timelimit="5"><result status="valid" time="0.010000" steps="68870"/></proof>
38 <goal name="smallest_divisor'vc.0.6" expl="assertion" proved="true">
39 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="28"/></proof>
41 <goal name="smallest_divisor'vc.0.7" expl="assertion" proved="true">
42 <proof prover="2" timelimit="11"><result status="valid" time="0.060000" steps="81"/></proof>
44 <goal name="smallest_divisor'vc.0.8" expl="assertion" proved="true">
45 <proof prover="2" timelimit="11"><result status="valid" time="0.000000" steps="30"/></proof>
47 <goal name="smallest_divisor'vc.0.9" expl="assertion" proved="true">
48 <proof prover="2" timelimit="11"><result status="valid" time="0.020000" steps="32"/></proof>
52 <goal name="smallest_divisor'vc.1" expl="check modulo by zero" proved="true">
53 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="14"/></proof>
55 <goal name="smallest_divisor'vc.2" expl="variant decrease" proved="true">
56 <proof prover="2" timelimit="11"><result status="valid" time="0.000000" steps="18"/></proof>
58 <goal name="smallest_divisor'vc.3" expl="precondition" proved="true">
59 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="18"/></proof>
61 <goal name="smallest_divisor'vc.4" expl="precondition" proved="true">
62 <proof prover="2" timelimit="11"><result status="valid" time="0.020000" steps="114"/></proof>
64 <goal name="smallest_divisor'vc.5" expl="precondition" proved="true">
65 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="70"/></proof>
67 <goal name="smallest_divisor'vc.6" expl="postcondition" proved="true">
68 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="49"/></proof>
70 <goal name="smallest_divisor'vc.7" expl="postcondition" proved="true">
71 <proof prover="2" timelimit="11"><result status="valid" time="0.020000" steps="60"/></proof>
73 <goal name="smallest_divisor'vc.8" expl="postcondition" proved="true">
74 <proof prover="2" timelimit="11"><result status="valid" time="0.060000" steps="198"/></proof>
78 <goal name="largest_prime_factor'vc" expl="VC for largest_prime_factor" proved="true">
79 <transf name="split_goal_right" proved="true" >
80 <goal name="largest_prime_factor'vc.0" expl="precondition" proved="true">
81 <proof prover="2"><result status="valid" time="0.000000" steps="6"/></proof>
83 <goal name="largest_prime_factor'vc.1" expl="precondition" proved="true">
84 <proof prover="2"><result status="valid" time="0.010000" steps="8"/></proof>
86 <goal name="largest_prime_factor'vc.2" expl="precondition" proved="true">
87 <proof prover="2"><result status="valid" time="0.000000" steps="9"/></proof>
89 <goal name="largest_prime_factor'vc.3" expl="check division by zero" proved="true">
90 <proof prover="2"><result status="valid" time="0.010000" steps="14"/></proof>
92 <goal name="largest_prime_factor'vc.4" expl="assertion" proved="true">
93 <proof prover="2"><result status="valid" time="0.020000" steps="93"/></proof>
95 <goal name="largest_prime_factor'vc.5" expl="assertion" proved="true">
96 <proof prover="1"><result status="valid" time="0.880000"/></proof>
98 <goal name="largest_prime_factor'vc.6" expl="loop invariant init" proved="true">
99 <proof prover="2"><result status="valid" time="0.020000" steps="20"/></proof>
101 <goal name="largest_prime_factor'vc.7" expl="loop invariant init" proved="true">
102 <proof prover="2"><result status="valid" time="0.010000" steps="21"/></proof>
104 <goal name="largest_prime_factor'vc.8" expl="loop invariant init" proved="true">
105 <proof prover="2"><result status="valid" time="0.010000" steps="21"/></proof>
107 <goal name="largest_prime_factor'vc.9" expl="loop invariant init" proved="true">
108 <proof prover="1"><result status="valid" time="0.560000"/></proof>
110 <goal name="largest_prime_factor'vc.10" expl="loop invariant init" proved="true">
111 <proof prover="2"><result status="valid" time="0.020000" steps="68"/></proof>
113 <goal name="largest_prime_factor'vc.11" expl="loop invariant init" proved="true">
114 <proof prover="2"><result status="valid" time="0.020000" steps="31"/></proof>
116 <goal name="largest_prime_factor'vc.12" expl="assertion" proved="true">
117 <proof prover="2"><result status="valid" time="0.020000" steps="33"/></proof>
119 <goal name="largest_prime_factor'vc.13" expl="precondition" proved="true">
120 <proof prover="2"><result status="valid" time="0.010000" steps="36"/></proof>
122 <goal name="largest_prime_factor'vc.14" expl="precondition" proved="true">
123 <proof prover="2"><result status="valid" time="0.010000" steps="36"/></proof>
125 <goal name="largest_prime_factor'vc.15" expl="precondition" proved="true">
126 <proof prover="2"><result status="valid" time="0.010000" steps="42"/></proof>
128 <goal name="largest_prime_factor'vc.16" expl="assertion" proved="true">
129 <proof prover="1"><result status="valid" time="1.670000"/></proof>
131 <goal name="largest_prime_factor'vc.17" expl="check division by zero" proved="true">
132 <proof prover="2"><result status="valid" time="0.000000" steps="46"/></proof>
134 <goal name="largest_prime_factor'vc.18" expl="assertion" proved="true">
135 <transf name="split_goal_right" proved="true" >
136 <goal name="largest_prime_factor'vc.18.0" expl="VC for largest_prime_factor" proved="true">
137 <proof prover="2" timelimit="11"><result status="valid" time="0.020000" steps="188"/></proof>
139 <goal name="largest_prime_factor'vc.18.1" expl="VC for largest_prime_factor" proved="true">
140 <proof prover="2" timelimit="11"><result status="valid" time="0.030000" steps="52"/></proof>
144 <goal name="largest_prime_factor'vc.19" expl="assertion" proved="true">
145 <proof prover="1"><result status="valid" time="6.110000"/></proof>
147 <goal name="largest_prime_factor'vc.20" expl="loop variant decrease" proved="true">
148 <transf name="split_goal_right" proved="true" >
149 <goal name="largest_prime_factor'vc.20.0" expl="VC for largest_prime_factor" proved="true">
150 <proof prover="1"><result status="valid" time="0.020000"/></proof>
151 <proof prover="2" timelimit="11"><result status="valid" time="0.010000" steps="52"/></proof>
152 <proof prover="4"><result status="valid" time="0.010000" steps="46677"/></proof>
154 <goal name="largest_prime_factor'vc.20.1" expl="VC for largest_prime_factor" proved="true">
155 <proof prover="0"><result status="valid" time="0.070000"/></proof>
159 <goal name="largest_prime_factor'vc.21" expl="loop invariant preservation" proved="true">
160 <proof prover="2"><result status="valid" time="0.140000" steps="54"/></proof>
162 <goal name="largest_prime_factor'vc.22" expl="loop invariant preservation" proved="true">
163 <proof prover="2"><result status="valid" time="0.020000" steps="55"/></proof>
165 <goal name="largest_prime_factor'vc.23" expl="loop invariant preservation" proved="true">
166 <proof prover="2"><result status="valid" time="0.020000" steps="60"/></proof>
168 <goal name="largest_prime_factor'vc.24" expl="loop invariant preservation" proved="true">
169 <proof prover="2"><result status="valid" time="0.010000" steps="60"/></proof>
171 <goal name="largest_prime_factor'vc.25" expl="loop invariant preservation" proved="true">
172 <proof prover="1"><result status="valid" time="0.180000"/></proof>
174 <goal name="largest_prime_factor'vc.26" expl="loop invariant preservation" proved="true">
175 <proof prover="2"><result status="valid" time="0.020000" steps="69"/></proof>
177 <goal name="largest_prime_factor'vc.27" expl="postcondition" proved="true">
178 <proof prover="2"><result status="valid" time="0.010000" steps="32"/></proof>
180 <goal name="largest_prime_factor'vc.28" expl="postcondition" proved="true">
181 <proof prover="2"><result status="valid" time="0.010000" steps="32"/></proof>
183 <goal name="largest_prime_factor'vc.29" expl="postcondition" proved="true">
184 <proof prover="1" timelimit="5"><result status="valid" time="0.100000"/></proof>
188 <goal name="test'vc" expl="VC for test" proved="true">
189 <proof prover="2"><result status="valid" time="0.010000" steps="6"/></proof>
191 <goal name="solve'vc" expl="VC for solve" proved="true">
192 <proof prover="2"><result status="valid" time="0.010000" steps="6"/></proof>