kalmar
/
PropertyT.jl
mirror of https://github.com/kalmarek/PropertyT.jl.git
1
0
Fork 0
Code Issues Releases Wiki Activity

reorganize tests

This commit is contained in:
kalmarek 2019-01-18 15:59:17 +01:00
parent 23f829a874
commit 9567169bdc
1 changed files with 70 additions and 59 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

129
test/runtests.jl
View File

@ -16,67 +16,78 @@ end
solver(iters; accel=1) =
SCSSolver(max_iters=iters, acceleration_lookback=accel, eps=1e-10)
@testset "SL(2,Z)" begin
N = 2
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(20000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == false
@testset "1703.09680 Examples" begin
@testset "SL(2,Z)" begin
rm("SL(2,Z)", recursive=true, force=true)
N = 2
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(20000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == false
end
@testset "SL(3,Z)" begin
rm("SL(3,Z)", recursive=true, force=true)
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(1000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == true
end
@testset "SAut(F₂)" begin
rm("SAut(F2)", recursive=true, force=true)
N = 2
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
sett = PropertyT.Settings("SAut(F$N)", G, S, solver(20000);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
end
end
@testset "SL(3,Z)" begin
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
@testset "17.12.07167 Examples" begin
sett = PropertyT.Settings("SL($N,Z)", G, S, solver(1000, accel=20); upper_bound=0.1)
@test PropertyT.check_property_T(sett) == true
end
@testset "oSL(3,Z)" begin
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
autS = WreathProduct(PermGroup(2), PermGroup(N))
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(1000, accel=20);
upper_bound=0.27, warmstart=false)
@test PropertyT.check_property_T(sett) == false
#second run just checks the solution
@test PropertyT.check_property_T(sett) == false
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(1000, accel=20);
upper_bound=0.27, warmstart=true)
@test PropertyT.check_property_T(sett) == true
end
@testset "SAut(F₂)" begin
N = 2
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
sett = PropertyT.Settings("SAut(F$N)", G, S, solver(20000, accel=20);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
end
@testset "SAut(F₂)" begin
N = 3
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
autS = WreathProduct(PermGroup(2), PermGroup(N))
sett = PropertyT.Settings("SAut(F$N)", G, S, autS, solver(20000);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
@testset "oSL(3,Z)" begin
rm("oSL(3,Z)", recursive=true, force=true)
N = 3
G = MatrixSpace(Nemo.ZZ, N,N)
S = Groups.gens(G)
autS = WreathProduct(PermGroup(2), PermGroup(N))
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(2000, accel=20);
upper_bound=0.27, warmstart=false)
@test PropertyT.check_property_T(sett) == false
#second run just checks the solution
@test PropertyT.check_property_T(sett) == false
sett = PropertyT.Settings("SL($N,Z)", G, S, autS, solver(2000, accel=10);
upper_bound=0.27, warmstart=true)
@test PropertyT.check_property_T(sett) == true
end
@testset "SAut(F₂)" begin
rm("oSAut(F3)", recursive=true, force=true)
N = 3
G = SAut(FreeGroup(N))
S = Groups.gens(G)
S = [S; inv.(S)]
autS = WreathProduct(PermGroup(2), PermGroup(N))
sett = PropertyT.Settings("SAut(F$N)", G, S, autS, solver(10000);
upper_bound=0.15, warmstart=false)
@test PropertyT.check_property_T(sett) == false
end
end