diff options
| author | Simon-Kor <52245124+Simon-Kor@users.noreply.github.com> | 2024-05-28 17:36:28 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-05-28 17:36:28 +0200 |
| commit | a08c4b2d7a7135029a588df542c18fdf07725075 (patch) | |
| tree | 6ca3ecd36d8d84ea7153d74cab73361052d03565 /vampire-taks-with-unexpacted-behavoir | |
| parent | 3ae13f68d8d572aa62982bde614acf79dff60848 (diff) | |
| parent | 266529fa1271a942920845072efb588c64c4aba3 (diff) | |
Merge branch 'main' into main
Diffstat (limited to 'vampire-taks-with-unexpacted-behavoir')
| -rw-r--r-- | vampire-taks-with-unexpacted-behavoir/50-plus-secounds-for-iff-stamtent.p | 6 | ||||
| -rw-r--r-- | vampire-taks-with-unexpacted-behavoir/topological-basis-behovoir.p | 26 |
2 files changed, 32 insertions, 0 deletions
diff --git a/vampire-taks-with-unexpacted-behavoir/50-plus-secounds-for-iff-stamtent.p b/vampire-taks-with-unexpacted-behavoir/50-plus-secounds-for-iff-stamtent.p new file mode 100644 index 0000000..19ed046 --- /dev/null +++ b/vampire-taks-with-unexpacted-behavoir/50-plus-secounds-for-iff-stamtent.p @@ -0,0 +1,6 @@ +fof(inters_in_genopens,conjecture,unions(fB)=fX). +fof(topological_basis,axiom,![XB,XX]:(topological_basis(XB,XX)<=>(unions(XB)=XX&![XU,XV,Xx]:((elem(XU,XB)&elem(XV,XB)&elem(Xx,XU)&elem(Xx,XV))=>?[XW]:(elem(XW,XB)&elem(Xx,XW)&subseteq(XW,XU)&subseteq(XW,XV)))))). +fof(inters_in_genopens1,axiom,elem(fx,fVprimeprime)&subseteq(fVprimeprime,fC)&elem(fVprimeprime,fB)). +fof(inters_in_genopens2,axiom,elem(fx,fVprime)&subseteq(fVprime,fA)&elem(fVprime,fB)). +fof(inters_in_genopens3,axiom,elem(fx,inter(fA,fC))). +fof(inters_in_genopens4,axiom,topological_basis(fB,fX)). diff --git a/vampire-taks-with-unexpacted-behavoir/topological-basis-behovoir.p b/vampire-taks-with-unexpacted-behavoir/topological-basis-behovoir.p new file mode 100644 index 0000000..76b03e4 --- /dev/null +++ b/vampire-taks-with-unexpacted-behavoir/topological-basis-behovoir.p @@ -0,0 +1,26 @@ +% It doesn't make sense for me that this task takes so long. It taks on my computer nearly 50-60 secounds. + +fof(inters_in_genopens,conjecture,?[XW]:(elem(XW,fB)&elem(fx,XW)&subseteq(XW,fvprime)&subseteq(XW,fVprimeprime))). +%fof(topological_basis,axiom,![XB,XX]:(topological_basis(XB,XX)<=>(unions(XB)=XX&![XU,XV,Xx]:((elem(XU,XB)&elem(XV,XB)&elem(Xx,XU)&elem(Xx,XV))=>?[XW]:(elem(XW,XB)&elem(Xx,XW)&subseteq(XW,XU)&subseteq(XW,XV)))))). +fof(inters_in_genopens1,axiom,elem(fx,fVprimeprime)&subseteq(fVprimeprime,fC)&elem(fVprimeprime,fB)). +fof(inters_in_genopens2,axiom,elem(fx,fVprime)&subseteq(fVprime,fA)&elem(fVprime,fB)). +fof(inters_in_genopens3,axiom,elem(fx,inter(fA,fC))). +fof(inters_in_genopens4,axiom,topological_basis(fB,fX)). + +fof(topological_basis1,axiom,![XU,XV,Xx]:((elem(XU,fB)&elem(XV,fB)&elem(Xx,XU)&elem(Xx,XV))=>?[XW]:(elem(XW,fB)&elem(Xx,XW)&subseteq(XW,XU)&subseteq(XW,XV)))). + +fof(inters_in_genopens10,axiom,subseteq(fVprime,fA)). +fof(inters_in_genopens11,axiom,subseteq(fVprimeprime,fC)). +fof(inters_in_genopens12,axiom,elem(fx,fVprime)). +fof(inters_in_genopens13,axiom,elem(fx,fVprimeprime)). + + +% the task (unions(fB)=fX) takes only 0.2 secounds +% but if it is stated as an axiom it doesn't effect any proof time. + + +% with this axiom it takes 27 secounds so it improve the overall time, +% but this axiom is just a "and" more and combines axiom 1 and 2 +% fof(inters_in_genopens5,axiom,elem(fVprimeprime,fB)&elem(fVprimeprime,fB)&elem(fx,fVprime)&elem(fx,fVprimeprime)). + +% fof(topological_basis1,axiom,![XU,XV,Xx]:((elem(XU,fB)&elem(XV,fB)&elem(Xx,XU)&elem(Xx,XV))=>?[XW]:(elem(XW,fB)&elem(Xx,XW)&subseteq(XW,XU)&subseteq(XW,XV)))).
\ No newline at end of file |