-------------------------------------------------------------------------------
Domain AGT = Agents.
52 problems (26 abstract, 0 CNF, 52 FOF, 0 THF)
-------------------------------------------------------------------------------
AGT001 ( -0 +2 ^0) Problem for the CPlanT system
AGT002 ( -0 +2 ^0) Problem for the CPlanT system
AGT003 ( -0 +2 ^0) Problem for the CPlanT system
AGT004 ( -0 +2 ^0) Problem for the CPlanT system
AGT005 ( -0 +2 ^0) Problem for the CPlanT system
AGT006 ( -0 +2 ^0) Problem for the CPlanT system
AGT007 ( -0 +2 ^0) Problem for the CPlanT system
AGT008 ( -0 +2 ^0) Problem for the CPlanT system
AGT009 ( -0 +2 ^0) Problem for the CPlanT system
AGT010 ( -0 +2 ^0) Problem for the CPlanT system
AGT011 ( -0 +2 ^0) Problem for the CPlanT system
AGT012 ( -0 +2 ^0) Problem for the CPlanT system
AGT013 ( -0 +2 ^0) Problem for the CPlanT system
AGT014 ( -0 +2 ^0) Problem for the CPlanT system
AGT015 ( -0 +2 ^0) Problem for the CPlanT system
AGT016 ( -0 +2 ^0) Problem for the CPlanT system
AGT017 ( -0 +2 ^0) Problem for the CPlanT system
AGT018 ( -0 +2 ^0) Problem for the CPlanT system
AGT019 ( -0 +2 ^0) Problem for the CPlanT system
AGT020 ( -0 +2 ^0) Problem for the CPlanT system
AGT021 ( -0 +2 ^0) Problem for the CPlanT system
AGT022 ( -0 +2 ^0) Problem for the CPlanT system
AGT023 ( -0 +2 ^0) Problem for the CPlanT system
AGT024 ( -0 +2 ^0) Problem for the CPlanT system
AGT025 ( -0 +2 ^0) Problem for the CPlanT system
AGT026 ( -0 +2 ^0) Problem for the CPlanT system
-------------------------------------------------------------------------------
Domain ALG = General Algebra.
350 problems (257 abstract, 15 CNF, 285 FOF, 50 THF)
-------------------------------------------------------------------------------
ALG001 ( -3 +0 ^0) The composition of homomorphisms is a homomorphism
ALG002 ( -1 +0 ^0) In an ordered field, if X > 0 then X^-1 > 0
ALG003 ( -1 +0 ^0) Cancellative medial algebras
ALG004 ( -1 +0 ^0) Cancellative medial algebras satisfy the quotient condition.
ALG005 ( -1 +0 ^0) Associativity of intersection in terms of set difference.
ALG006 ( -1 +0 ^0) Simplification of Kalman's set difference basis (part 1)
ALG007 ( -1 +0 ^0) Simplification of Kalman's set difference basis (part 2)
ALG008 ( -1 +0 ^0) TC + right identity does not give RC.
ALG009 ( -1 +0 ^0) Abstract algebra axioms, based on Godel set theory
ALG010 ( -1 +0 ^0) Prove J follows from HBCK
ALG011 ( -1 +0 ^0) Partition a monoid into 2 partitions
ALG012 ( -1 +0 ^0) Partition a monoid into 3 partitions
ALG013 ( -1 +0 ^0) Partition a monoid into 4 partitions
ALG014 ( -0 +1 ^0) Groups 4: CPROPS-COVERING-PROBLEM-1
ALG015 ( -0 +1 ^0) Groups 4: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG016 ( -0 +1 ^0) Groups 4: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG017 ( -0 +1 ^0) Groups 4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG018 ( -0 +1 ^0) Groups 4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG019 ( -0 +1 ^0) Groups 4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG020 ( -0 +1 ^0) Groups 4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG021 ( -0 +1 ^0) Groups 4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG022 ( -0 +1 ^0) Groups 4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG023 ( -0 +1 ^0) Groups 4: VERIFY-GEN-SYSES-PROBLEM-1
ALG024 ( -0 +1 ^0) Groups 4: VERIFY-GEN-SYSES-PROBLEM-2
ALG025 ( -0 +1 ^0) Groups 6: CPROPS-COVERING-PROBLEM-1
ALG026 ( -0 +1 ^0) Groups 6: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG027 ( -0 +1 ^0) Groups 6: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG028 ( -0 +1 ^0) Groups 6: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG029 ( -0 +1 ^0) Groups 6: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG030 ( -0 +1 ^0) Groups 6: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG031 ( -0 +1 ^0) Groups 6: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG032 ( -0 +1 ^0) Groups 6: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG033 ( -0 +1 ^0) Groups 6: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG034 ( -0 +1 ^0) Groups 6: VERIFY-GEN-SYSES-PROBLEM-1
ALG035 ( -0 +1 ^0) Groups 6: VERIFY-GEN-SYSES-PROBLEM-2
ALG036 ( -0 +1 ^0) Loops 4: CPROPS-COVERING-PROBLEM-1
ALG037 ( -0 +1 ^0) Loops 4: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG038 ( -0 +1 ^0) Loops 4: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG039 ( -0 +1 ^0) Loops 4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG040 ( -0 +1 ^0) Loops 4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG041 ( -0 +1 ^0) Loops 4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG042 ( -0 +1 ^0) Loops 4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG043 ( -0 +1 ^0) Loops 4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG044 ( -0 +1 ^0) Loops 4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG045 ( -0 +1 ^0) Loops 4: VERIFY-GEN-SYSES-PROBLEM-1
ALG046 ( -0 +1 ^0) Loops 4: VERIFY-GEN-SYSES-PROBLEM-2
ALG047 ( -0 +1 ^0) Loops 5: CPROPS-COVERING-PROBLEM-1
ALG048 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG049 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG050 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-3
ALG051 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-4
ALG052 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-5
ALG053 ( -0 +1 ^0) Loops 5: CPROPS-ISO-COMPLETE-PROBLEM-6
ALG054 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG055 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-10
ALG056 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-11
ALG057 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-12
ALG058 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-13
ALG059 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-14
ALG060 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-15
ALG061 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-2
ALG062 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-3
ALG063 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-4
ALG064 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-5
ALG065 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-6
ALG066 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-7
ALG067 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-8
ALG068 ( -0 +1 ^0) Loops 5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-9
ALG069 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG070 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG071 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-3
ALG072 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-4
ALG073 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-5
ALG074 ( -0 +1 ^0) Loops 5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-6
ALG075 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG076 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-10
ALG077 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-11
ALG078 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-12
ALG079 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-13
ALG080 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-14
ALG081 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-15
ALG082 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-2
ALG083 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-3
ALG084 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-4
ALG085 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-5
ALG086 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-6
ALG087 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-7
ALG088 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-8
ALG089 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-9
ALG090 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG091 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG092 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-3
ALG093 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-4
ALG094 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-5
ALG095 ( -0 +1 ^0) Loops 5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-6
ALG096 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-1
ALG097 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-2
ALG098 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-3
ALG099 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-4
ALG100 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-5
ALG101 ( -0 +1 ^0) Loops 5: VERIFY-GEN-SYSES-PROBLEM-6
ALG102 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-100
ALG103 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-101
ALG104 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-102
ALG105 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-75
ALG106 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-76
ALG107 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-77
ALG108 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-78
ALG109 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-79
ALG110 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-80
ALG111 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-81
ALG112 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-82
ALG113 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-83
ALG114 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-84
ALG115 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-85
ALG116 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-86
ALG117 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-87
ALG118 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-88
ALG119 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-89
ALG120 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-90
ALG121 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-91
ALG122 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-92
ALG123 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-93
ALG124 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-94
ALG125 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-95
ALG126 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-96
ALG127 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-97
ALG128 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-98
ALG129 ( -0 +1 ^0) Quasigroups 4: PROP-ISO-COMPLETE-99
ALG130 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-40
ALG131 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-41
ALG132 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-42
ALG133 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-43
ALG134 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-44
ALG135 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-45
ALG136 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-46
ALG137 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-47
ALG138 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-48
ALG139 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-49
ALG140 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-50
ALG141 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-51
ALG142 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-52
ALG143 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-53
ALG144 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-54
ALG145 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-55
ALG146 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-56
ALG147 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-57
ALG148 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-58
ALG149 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-59
ALG150 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-60
ALG151 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-61
ALG152 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-62
ALG153 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-63
ALG154 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-64
ALG155 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-65
ALG156 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-66
ALG157 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-67
ALG158 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-68
ALG159 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-69
ALG160 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-70
ALG161 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-71
ALG162 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-72
ALG163 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-73
ALG164 ( -0 +1 ^0) Quasigroups 4: PROP-SATS-GEN-SYS-74
ALG165 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-COVERING-PROBLEM-1
ALG166 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG167 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG168 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-ISO-COMPLETE-PROBLEM-3
ALG169 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-ISO-COMPLETE-PROBLEM-4
ALG170 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG171 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-2
ALG172 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-3
ALG173 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-4
ALG174 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-5
ALG175 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-6
ALG176 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG177 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG178 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-3
ALG179 ( -0 +1 ^0) Quasigroups 5 QG4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-4
ALG180 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG181 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-2
ALG182 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-3
ALG183 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-4
ALG184 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-5
ALG185 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-6
ALG186 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG187 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG188 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-3
ALG189 ( -0 +1 ^0) Quasigroups 5 QG4: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-4
ALG190 ( -0 +1 ^0) Quasigroups 5 QG4: VERIFY-GEN-SYSES-PROBLEM-1
ALG191 ( -0 +1 ^0) Quasigroups 5 QG4: VERIFY-GEN-SYSES-PROBLEM-2
ALG192 ( -0 +1 ^0) Quasigroups 5 QG4: VERIFY-GEN-SYSES-PROBLEM-3
ALG193 ( -0 +1 ^0) Quasigroups 5 QG4: VERIFY-GEN-SYSES-PROBLEM-4
ALG194 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-COVERING-PROBLEM-1
ALG195 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-ISO-COMPLETE-PROBLEM-1
ALG196 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-ISO-COMPLETE-PROBLEM-2
ALG197 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-ISO-COMPLETE-PROBLEM-3
ALG198 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-1
ALG199 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-2
ALG200 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-PAIRWISE-EXCLUSIVE-PROBLEM-3
ALG201 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
ALG202 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-2
ALG203 ( -0 +1 ^0) Quasigroups 7 QG5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-3
ALG204 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-1
ALG205 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-2
ALG206 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-PAIRWISE-NOT-ISO-PROBLEM-3
ALG207 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-1
ALG208 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-2
ALG209 ( -0 +1 ^0) Quasigroups 7 QG5: REPRESENTATIVES-SATISFY-PROPS-PROBLEM-3
ALG210 ( -0 +2 ^0) Star-algebras are closed under multiplication
ALG211 ( -0 +1 ^0) Vector spaces and bases
ALG212 ( -0 +1 ^0) Distributivity, long version
ALG213 ( -0 +1 ^0) Distributivity, short version
ALG214 ( -0 +4 ^0) Linear Independence in Right Module over Domain T02
ALG215 ( -0 +4 ^0) Linear Independence in Right Module over Domain T04
ALG216 ( -0 +4 ^0) Linear Independence in Right Module over Domain T06
ALG217 ( -0 +4 ^0) Linear Independence in Right Module over Domain T11
ALG218 ( -0 +4 ^0) Linear Independence in Right Module over Domain T12
ALG219 ( -0 +4 ^0) Linear Independence in Right Module over Domain T14
ALG220 ( -0 +4 ^0) Linear Independence in Right Module over Domain T16
ALG221 ( -0 +4 ^0) Linear Independence in Right Module over Domain T17
ALG222 ( -0 +4 ^0) Linear Independence in Right Module over Domain T18
ALG223 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T04
ALG224 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T05
ALG225 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T06
ALG226 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T07
ALG227 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T08
ALG228 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T09
ALG229 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T10
ALG230 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T11
ALG231 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T12
ALG232 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T13
ALG233 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T14
ALG234 ( -0 +4 ^0) Algebraic Operation on Subsets of Many Sorted Sets T16
ALG247 ( -0 +0 ^1) Push property lemma 0
ALG248 ( -0 +0 ^3) Push property lemma 1
ALG249 ( -0 +0 ^1) Push property lemma 2
ALG250 ( -0 +0 ^1) Push property lemma 3
ALG251 ( -0 +0 ^3) Push property
ALG252 ( -0 +0 ^2) Induction lemma
ALG253 ( -0 +0 ^2) Induction
ALG254 ( -0 +0 ^2) M is a monoid and T is an M-set
ALG255 ( -0 +0 ^1) T is an M-set
ALG256 ( -0 +0 ^2) HOASap is injective 1
ALG257 ( -0 +0 ^2) HOASap is injective 2
ALG258 ( -0 +0 ^2) HOASlam is injective
ALG259 ( -0 +0 ^2) HOASlam not ap
ALG260 ( -0 +0 ^2) HOASlam not var
ALG261 ( -0 +0 ^2) HOASap not var
ALG262 ( -0 +0 ^1) HOAS induction lemma 0
ALG263 ( -0 +0 ^3) HOAS induction lemma 1
ALG264 ( -0 +0 ^3) HOAS induction lemma 2
ALG265 ( -0 +0 ^1) HOAS induction lemma 3aa
ALG266 ( -0 +0 ^2) HOAS induction lemma 3a
ALG267 ( -0 +0 ^2) HOAS induction lemma 3b
ALG268 ( -0 +0 ^6) HOAS induction lemma 3
ALG269 ( -0 +0 ^4) HOAS induction
-------------------------------------------------------------------------------
Domain ANA = Analysis.
91 problems (42 abstract, 91 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
ANA001 ( -1 +0 ^0) Attaining minimum (or maximum) value
ANA002 ( -4 +0 ^0) Intermediate value theorem
ANA003 ( -4 +0 ^0) Lemma 1 for the sum of two continuous functions is continuous
ANA004 ( -5 +0 ^0) Lemma 2 for the sum of two continuous functions is continuous
ANA005 ( -5 +0 ^0) The sum of two continuous functions is continuous
ANA006 ( -2 +0 ^0) Analysis (limits) axioms for continuous functions
ANA007 ( -2 +0 ^0) Problem about Big-O notation
ANA009 ( -2 +0 ^0) Problem about Big-O notation
ANA010 ( -2 +0 ^0) Problem about Big-O notation
ANA012 ( -2 +0 ^0) Problem about Big-O notation
ANA013 ( -2 +0 ^0) Problem about Big-O notation
ANA014 ( -2 +0 ^0) Problem about Big-O notation
ANA015 ( -2 +0 ^0) Problem about Big-O notation
ANA016 ( -2 +0 ^0) Problem about Big-O notation
ANA017 ( -2 +0 ^0) Problem about Big-O notation
ANA018 ( -2 +0 ^0) Problem about Big-O notation
ANA019 ( -2 +0 ^0) Problem about Big-O notation
ANA020 ( -2 +0 ^0) Problem about Big-O notation
ANA021 ( -2 +0 ^0) Problem about Big-O notation
ANA022 ( -2 +0 ^0) Problem about Big-O notation
ANA023 ( -2 +0 ^0) Problem about Big-O notation
ANA024 ( -2 +0 ^0) Problem about Big-O notation
ANA025 ( -2 +0 ^0) Problem about Big-O notation
ANA026 ( -2 +0 ^0) Problem about Big-O notation
ANA027 ( -2 +0 ^0) Problem about Big-O notation
ANA028 ( -2 +0 ^0) Problem about Big-O notation
ANA029 ( -2 +0 ^0) Problem about Big-O notation
ANA030 ( -2 +0 ^0) Problem about Big-O notation
ANA031 ( -2 +0 ^0) Problem about Big-O notation
ANA032 ( -2 +0 ^0) Problem about Big-O notation
ANA033 ( -1 +0 ^0) Problem about Big-O notation
ANA034 ( -2 +0 ^0) Problem about Big-O notation
ANA035 ( -2 +0 ^0) Problem about Big-O notation
ANA036 ( -1 +0 ^0) Problem about Big-O notation
ANA037 ( -2 +0 ^0) Problem about Big-O notation
ANA038 ( -2 +0 ^0) Problem about Big-O notation
ANA039 ( -2 +0 ^0) Problem about Big-O notation
ANA041 ( -2 +0 ^0) Problem about Big-O notation
ANA042 ( -2 +0 ^0) Problem about Big-O notation
ANA043 ( -2 +0 ^0) Problem about Big-O notation
ANA044 ( -2 +0 ^0) Problem about Big-O notation
ANA045 ( -2 +0 ^0) Problem about Big-O notation
-------------------------------------------------------------------------------
Domain BOO = Boolean Algebra.
140 problems (105 abstract, 139 CNF, 1 FOF, 0 THF)
-------------------------------------------------------------------------------
BOO001 ( -1 +0 ^0) In B3 algebra, inverse is an involution
BOO002 ( -2 +0 ^0) In B3 algebra, X * X^-1 * Y = Y
BOO003 ( -3 +0 ^0) Multiplication is idempotent (X * X = X)
BOO004 ( -3 +0 ^0) Addition is idempotent (X + X = X)
BOO005 ( -3 +0 ^0) Addition is bounded (X + 1 = 1)
BOO006 ( -3 +0 ^0) Multiplication is bounded (X * 0 = 0)
BOO007 ( -3 +0 ^0) Product is associative ( (X * Y) * Z = X * (Y * Z) )
BOO008 ( -4 +0 ^0) Sum is associative ( (X + Y) + Z = X + (Y + Z) )
BOO009 ( -3 +0 ^0) Multiplication absorption (X * (X + Y) = X)
BOO010 ( -3 +0 ^0) Addition absorbtion (X + (X * Y) = X)
BOO011 ( -3 +0 ^0) Inverse of additive identity = Multiplicative identity
BOO012 ( -4 +0 ^0) Inverse is an involution
BOO013 ( -4 +0 ^0) The inverse of X is unique
BOO014 ( -4 +0 ^0) DeMorgan for inverse and product (X+Y)^-1 = (X^-1) * (Y^-1)
BOO015 ( -3 +0 ^0) DeMorgan for inverse and sum (X^-1 + Y^-1) = (X * Y)^-1
BOO016 ( -2 +0 ^0) Relating product and sum (X * Y = Z -> X + Z = X)
BOO017 ( -2 +0 ^0) Relating sum and product (X + Y = Z -> X * Z = X)
BOO018 ( -1 +0 ^0) Inverse of multiplicative identity = Additive identity
BOO019 ( -1 +0 ^0) Prove the independance of Ternary Boolean algebra axiom
BOO020 ( -1 +0 ^0) Frink's Theorem
BOO021 ( -1 +0 ^0) A Basis for Boolean Algebra
BOO022 ( -1 +0 ^0) A Basis for Boolean Algebra
BOO023 ( -1 +0 ^0) Half of Padmanabhan's 6-basis with Pixley, part 1.
BOO024 ( -1 +0 ^0) Half of Padmanabhan's 6-basis with Pixley, part 2.
BOO025 ( -1 +0 ^0) Half of Padmanabhan's 6-basis with Pixley, part 3.
BOO026 ( -1 +0 ^0) Absorption from self-dual independent 2-basis
BOO027 ( -1 +0 ^0) Independence of self-dual 2-basis.
BOO028 ( -1 +0 ^0) Self-dual 2-basis from majority reduction, part 1.
BOO029 ( -1 +0 ^0) Self-dual 2-basis from majority reduction, part 3.
BOO030 ( -1 +0 ^0) Independence of a BA 2-basis by majority reduction.
BOO031 ( -1 +0 ^0) Dual BA 3-basis, proof of distributivity.
BOO032 ( -1 +0 ^0) Independence of a system of Boolean algebra
BOO033 ( -1 +0 ^0) Independence of a system of Boolean algebra.
BOO034 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is sound.
BOO035 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete
BOO036 ( -1 +0 ^0) Ternary Boolean algebra (equality) axioms
BOO037 ( -3 +0 ^0) Boolean algebra axioms
BOO038 ( -1 +0 ^0) DN-1 is a single axiom for Boolean algebra
BOO039 ( -1 +0 ^0) Sh-1 is a single axiom for Boolean algebra
BOO040 ( -1 +0 ^0) Single axiom C1 for Boolean algebra in the Sheffer stroke
BOO041 ( -1 +0 ^0) Single axiom C2 for Boolean algebra in the Sheffer stroke
BOO042 ( -1 +0 ^0) Single axiom C3 for Boolean algebra in the Sheffer stroke
BOO043 ( -1 +0 ^0) Single axiom C4 for Boolean algebra in the Sheffer stroke
BOO044 ( -1 +0 ^0) Single axiom C5 for Boolean algebra in the Sheffer stroke
BOO045 ( -1 +0 ^0) Single axiom C6 for Boolean algebra in the Sheffer stroke
BOO046 ( -1 +0 ^0) Single axiom C7 for Boolean algebra in the Sheffer stroke
BOO047 ( -1 +0 ^0) Single axiom C8 for Boolean algebra in the Sheffer stroke
BOO048 ( -1 +0 ^0) Single axiom C9 for Boolean algebra in the Sheffer stroke
BOO049 ( -1 +0 ^0) Single axiom C10 for Boolean algebra in the Sheffer stroke
BOO050 ( -1 +0 ^0) Single axiom C11 for Boolean algebra in the Sheffer stroke
BOO051 ( -1 +0 ^0) Single axiom C12 for Boolean algebra in the Sheffer stroke
BOO052 ( -1 +0 ^0) Single axiom C13 for Boolean algebra in the Sheffer stroke
BOO053 ( -1 +0 ^0) Single axiom C14 for Boolean algebra in the Sheffer stroke
BOO054 ( -1 +0 ^0) Single axiom C15 for Boolean algebra in the Sheffer stroke
BOO055 ( -1 +0 ^0) Single axiom C16 for Boolean algebra in the Sheffer stroke
BOO056 ( -1 +0 ^0) Single non-axiom M5A for Boolean algebra in the Sheffer stroke
BOO057 ( -1 +0 ^0) Single non-axiom M5B for Boolean algebra in the Sheffer stroke
BOO058 ( -1 +0 ^0) Single non-axiom M6A for Boolean algebra in the Sheffer stroke
BOO059 ( -1 +0 ^0) Single non-axiom M6B for Boolean algebra in the Sheffer stroke
BOO060 ( -1 +0 ^0) Single non-axiom M6C for Boolean algebra in the Sheffer stroke
BOO061 ( -1 +0 ^0) Single non-axiom M6D for Boolean algebra in the Sheffer stroke
BOO066 ( -1 +0 ^0) Single non-axiom M8A for Boolean algebra in the Sheffer stroke
BOO067 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete, part 1
BOO068 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete, part 2
BOO069 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete, part 3
BOO070 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete, part 4
BOO071 ( -1 +0 ^0) Ternary Boolean Algebra Single axiom is complete, part 5
BOO072 ( -1 +0 ^0) DN-1 is a single axiom for Boolean algebra, part 1
BOO073 ( -1 +0 ^0) DN-1 is a single axiom for Boolean algebra, part 2
BOO074 ( -1 +0 ^0) DN-1 is a single axiom for Boolean algebra, part 3
BOO075 ( -1 +0 ^0) Sh-1 is a single axiom for Boolean algebra, part 1
BOO076 ( -1 +0 ^0) Sh-1 is a single axiom for Boolean algebra, part 2
BOO077 ( -1 +0 ^0) Axiom C1 for Boolean algebra in the Sheffer stroke, part 1
BOO078 ( -1 +0 ^0) Axiom C1 for Boolean algebra in the Sheffer stroke, part 2
BOO079 ( -1 +0 ^0) Axiom C2 for Boolean algebra in the Sheffer stroke, part 1
BOO080 ( -1 +0 ^0) Axiom C2 for Boolean algebra in the Sheffer stroke, part 2
BOO081 ( -1 +0 ^0) Axiom C3 for Boolean algebra in the Sheffer stroke, part 1
BOO082 ( -1 +0 ^0) Axiom C3 for Boolean algebra in the Sheffer stroke, part 2
BOO083 ( -1 +0 ^0) Axiom C4 for Boolean algebra in the Sheffer stroke, part 1
BOO084 ( -1 +0 ^0) Axiom C4 for Boolean algebra in the Sheffer stroke, part 2
BOO085 ( -1 +0 ^0) Axiom C5 for Boolean algebra in the Sheffer stroke, part 1
BOO086 ( -1 +0 ^0) Axiom C5 for Boolean algebra in the Sheffer stroke, part 2
BOO087 ( -1 +0 ^0) Axiom C6 for Boolean algebra in the Sheffer stroke, part 1
BOO088 ( -1 +0 ^0) Axiom C6 for Boolean algebra in the Sheffer stroke, part 2
BOO089 ( -1 +0 ^0) Axiom C7 for Boolean algebra in the Sheffer stroke, part 1
BOO090 ( -1 +0 ^0) Axiom C7 for Boolean algebra in the Sheffer stroke, part 2
BOO091 ( -1 +0 ^0) Axiom C8 for Boolean algebra in the Sheffer stroke, part 1
BOO092 ( -1 +0 ^0) Axiom C8 for Boolean algebra in the Sheffer stroke, part 2
BOO093 ( -1 +0 ^0) Axiom C9 for Boolean algebra in the Sheffer stroke, part 1
BOO094 ( -1 +0 ^0) Axiom C9 for Boolean algebra in the Sheffer stroke, part 2
BOO095 ( -1 +0 ^0) Axiom C10 for Boolean algebra in the Sheffer stroke, part 1
BOO096 ( -1 +0 ^0) Axiom C10 for Boolean algebra in the Sheffer stroke, part 2
BOO097 ( -1 +0 ^0) Axiom C11 for Boolean algebra in the Sheffer stroke, part 1
BOO098 ( -1 +0 ^0) Axiom C11 for Boolean algebra in the Sheffer stroke, part 2
BOO099 ( -1 +0 ^0) Axiom C12 for Boolean algebra in the Sheffer stroke, part 1
BOO100 ( -1 +0 ^0) Axiom C12 for Boolean algebra in the Sheffer stroke, part 2
BOO101 ( -1 +0 ^0) Axiom C13 for Boolean algebra in the Sheffer stroke, part 1
BOO102 ( -1 +0 ^0) Axiom C13 for Boolean algebra in the Sheffer stroke, part 2
BOO103 ( -1 +0 ^0) Axiom C14 for Boolean algebra in the Sheffer stroke, part 1
BOO104 ( -1 +0 ^0) Axiom C14 for Boolean algebra in the Sheffer stroke, part 2
BOO105 ( -1 +0 ^0) Axiom C15 for Boolean algebra in the Sheffer stroke, part 1
BOO106 ( -1 +0 ^0) Axiom C15 for Boolean algebra in the Sheffer stroke, part 2
BOO107 ( -1 +0 ^0) Axiom C16 for Boolean algebra in the Sheffer stroke, part 1
BOO108 ( -1 +0 ^0) Axiom C16 for Boolean algebra in the Sheffer stroke, part 2
BOO109 ( -0 +1 ^0) 
-------------------------------------------------------------------------------
Domain CAT = Category Theory.
130 problems (37 abstract, 62 CNF, 68 FOF, 0 THF)
-------------------------------------------------------------------------------
CAT001 ( -4 +0 ^0) XY monomorphism => Y monomorphism
CAT002 ( -4 +0 ^0) X and Y monomorphisms, XY well-defined => XY monomorphism
CAT003 ( -4 +0 ^0) XY epimorphism => X epimorphism
CAT004 ( -4 +0 ^0) X and Y epimorphisms, XY well-defined => XY epimorphism
CAT005 ( -3 +0 ^0) Domain is the unique right identity
CAT006 ( -3 +0 ^0) Codomain is the unique left identity
CAT007 ( -2 +0 ^0) If domain(x) = codomain(y) then xy is defined
CAT008 ( -1 +0 ^0) If xy is defined then domain(x) = codomain(y)
CAT009 ( -3 +0 ^0) If xy is defined, then domain(xy) = domain(y)
CAT010 ( -2 +0 ^0) If xy is defined, then codomain(xy) = codomain(x)
CAT011 ( -4 +0 ^0) domain(domain(x)) = domain(x)
CAT012 ( -3 +0 ^0) codomain(domain(x)) = domain(x)
CAT013 ( -3 +0 ^0) domain(codomain(x)) = codomain(x)
CAT014 ( -4 +0 ^0) codomain(codomain(x)) = codomain(x)
CAT015 ( -2 +0 ^0) Prove something exists
CAT016 ( -2 +0 ^0) If x exists, then domain(x) exists
CAT017 ( -2 +0 ^0) If x exists, then codomain(x) exists
CAT018 ( -3 +0 ^0) If xy and yz exist, then so does x(yz)
CAT019 ( -5 +0 ^0) Axiom of Indiscernibles
CAT020 ( -4 +0 ^0) Category theory axioms
CAT021 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T11
CAT022 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T21
CAT023 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T28
CAT024 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T29
CAT025 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T34
CAT026 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T38
CAT027 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T40
CAT028 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T41
CAT029 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T42
CAT030 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T43
CAT031 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T45
CAT032 ( -0 +4 ^0) Some Isomorphisms Between Functor Categories T49
CAT033 ( -0 +4 ^0) Yoneda Embedding T02
CAT034 ( -0 +4 ^0) Yoneda Embedding T04
CAT035 ( -0 +4 ^0) Yoneda Embedding T05
CAT036 ( -0 +4 ^0) Yoneda Embedding T08
CAT037 ( -0 +4 ^0) Yoneda Embedding T09
-------------------------------------------------------------------------------
Domain COL = Combinatory Logic.
239 problems (121 abstract, 239 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
COL001 ( -2 +0 ^0) Weak fixed point for S and K
COL002 ( -5 +0 ^0) Weak fixed point for S, B, C, and I
COL003 (-19 +0 ^0) Strong fixed point for B and W
COL004 ( -2 +0 ^0) Find combinator equivalent to U from S and K
COL005 ( -1 +0 ^0) Find a model for S and W but not a weak fixed point
COL006 ( -7 +0 ^0) Strong fixed point for S and K
COL007 ( -1 +0 ^0) Weak fixed point for L
COL008 ( -1 +0 ^0) Weak fixed point for M and B
COL009 ( -1 +0 ^0) Weak fixed point for B and L2
COL010 ( -1 +0 ^0) Weak fixed point for B and S2
COL011 ( -1 +0 ^0) Weak fixed point for O and Q1
COL012 ( -1 +0 ^0) Weak fixed point for U
COL013 ( -1 +0 ^0) Weak fixed point for S and L
COL014 ( -1 +0 ^0) Weak fixed point for L and O
COL015 ( -1 +0 ^0) Weak fixed point for Q and M
COL016 ( -1 +0 ^0) Weak fixed point for B, M and L
COL017 ( -1 +0 ^0) Weak fixed point for B, M, and T
COL018 ( -1 +0 ^0) Weak fixed point for W, Q, and L
COL019 ( -1 +0 ^0) Weak fixed point for B, S, and T
COL020 ( -1 +0 ^0) Weak fixed point for B, S, and C
COL021 ( -1 +0 ^0) Weak fixed point for B, M, and V
COL022 ( -1 +0 ^0) Weak fixed point for B, O, and M
COL023 ( -1 +0 ^0) Weak fixed point for B and N
COL024 ( -1 +0 ^0) Weak fixed point for B, M, and C
COL025 ( -1 +0 ^0) Weak fixed point for B and W
COL026 ( -1 +0 ^0) Weak fixed point for B and W1
COL027 ( -1 +0 ^0) Weak fixed point for B and H
COL029 ( -1 +0 ^0) Strong fixed point for U
COL030 ( -1 +0 ^0) Strong fixed point for S and L
COL031 ( -1 +0 ^0) Strong fixed point for L and O
COL032 ( -1 +0 ^0) Strong fixed point for Q and M
COL033 ( -1 +0 ^0) Strong fixed point for B, M and L
COL034 ( -1 +0 ^0) Strong fixed point for B, M, and T
COL035 ( -1 +0 ^0) Strong fixed point for W, Q, and L
COL036 ( -1 +0 ^0) Strong fixed point for B, S, and T
COL037 ( -1 +0 ^0) Strong fixed point for B, S, and C
COL038 ( -1 +0 ^0) Strong fixed point for B, M, and V
COL039 ( -1 +0 ^0) Strong fixed point for B, O, and M
COL041 ( -1 +0 ^0) Strong fixed point for B, M, and C
COL042 ( -9 +0 ^0) Strong fixed point for B and W1
COL043 ( -3 +0 ^0) Strong fixed point for B and H
COL044 ( -9 +0 ^0) Strong fixed point for B and N
COL045 ( -1 +0 ^0) Weak fixed point for B, M and S
COL046 ( -1 +0 ^0) Strong fixed point for B, M and S
COL047 ( -1 +0 ^0) Find a model for L and Q but not a strong fixed point
COL048 ( -1 +0 ^0) Weak fixed point for B, W, and M
COL049 ( -1 +0 ^0) Strong fixed point for B, W, and M
COL050 ( -1 +0 ^0) The Significance of the Mockingbird
COL051 ( -1 +0 ^0) Egocentric mocking bird?
COL052 ( -2 +0 ^0) A Question on Agreeable Birds
COL053 ( -1 +0 ^0) An Exercise in Composition
COL054 ( -1 +0 ^0) Compatible Birds
COL055 ( -1 +0 ^0) Happy Birds
COL056 ( -1 +0 ^0) Normal Birds
COL057 ( -1 +0 ^0) Strong fixed point for S, B, C, and I
COL058 ( -3 +0 ^0) If there's a lark, then there's an egocentric bird.
COL059 ( -1 +0 ^0) L3 ((lark lark) lark) is not egocentric.
COL060 ( -3 +0 ^0) Find combinator equivalent to Q from B and T
COL061 ( -3 +0 ^0) Find combinator equivalent to Q1 from B and T
COL062 ( -3 +0 ^0) Find combinator equivalent to C from B and T
COL063 ( -6 +0 ^0) Find combinator equivalent to F from B and T
COL064 (-11 +0 ^0) Find combinator equivalent to V from B and T
COL065 ( -1 +0 ^0) Find combinator equivalent to G from B and T
COL066 ( -3 +0 ^0) Find combinator equivalent to P from B, Q and W
COL067 ( -1 +0 ^0) Strong fixed point for B and S
COL068 ( -1 +0 ^0) Weak fixed point for B and S
COL069 ( -1 +0 ^0) Strong fixed point for B and L
COL070 ( -1 +0 ^0) Weak fixed point for B and N1
COL071 ( -1 +0 ^0) Strong fixed point for N and Q
COL073 ( -1 +0 ^0) Strong fixed point for B and N1
COL074 ( -3 +0 ^0) Unsatisfiable variant of TRC
COL075 ( -2 +0 ^0) Lemma 1 for showing the unsatisfiable variant of TRC
COL076 ( -2 +0 ^0) Lemma 2 for showing the unsatisfiable variant of TRC
COL077 ( -1 +0 ^0) Abst Abst Abst Abst Abst Abst = Id
COL078 ( -2 +0 ^0) Abst Abst Abst Abst = k(k(id))
COL079 ( -2 +0 ^0) Abst(Abst(Abst X)) = Abst X
COL080 ( -2 +0 ^0) Abst(Abst k(X)) = k(X)
COL081 ( -2 +0 ^0) Abst k(k(X)) = k(k(X))
COL082 ( -1 +0 ^0) Type-respecting combinators
COL083 ( -1 +0 ^0) Compatible Birds, part 1
COL084 ( -1 +0 ^0) Compatible Birds, part 2
COL085 ( -1 +0 ^0) Happy Birds, part 1
COL086 ( -1 +0 ^0) Happy Birds, part 2
COL087 ( -1 +0 ^0) Strong fixed point for B and M
COL088 ( -2 +0 ^0) ap_reduce1_2c1
COL089 ( -2 +0 ^0) ap_reduce2_2c1
COL090 ( -3 +0 ^0) i_contract_E
COL091 ( -2 +0 ^0) k1_contractD_c1
COL092 ( -2 +0 ^0) k1_parcontractD_c1
COL093 ( -2 +0 ^0) s1_parcontractD_c1
COL094 ( -2 +0 ^0) s2_parcontractD_c1
COL095 ( -2 +0 ^0) diamond_parcontract_2c1
COL096 ( -2 +0 ^0) diamond_parcontract_3c1
COL097 ( -2 +0 ^0) diamond_parcontract_4c1
COL098 ( -2 +0 ^0) diamond_strip_lemmaD_2c1
COL099 ( -2 +0 ^0) diamond_trancl_1c1
COL100 ( -2 +0 ^0) diamond_trancl_2c1
COL101 ( -2 +0 ^0) Problem about combinators
COL102 ( -2 +0 ^0) Problem about combinators
COL103 ( -2 +0 ^0) Problem about combinators
COL104 ( -2 +0 ^0) Problem about combinators
COL105 ( -2 +0 ^0) Problem about combinators
COL106 ( -2 +0 ^0) Problem about combinators
COL107 ( -1 +0 ^0) Problem about combinators
COL108 ( -1 +0 ^0) Problem about combinators
COL109 ( -2 +0 ^0) Problem about combinators
COL110 ( -2 +0 ^0) Problem about combinators
COL111 ( -2 +0 ^0) Problem about combinators
COL112 ( -2 +0 ^0) Problem about combinators
COL113 ( -2 +0 ^0) Problem about combinators
COL114 ( -2 +0 ^0) Problem about combinators
COL115 ( -2 +0 ^0) Problem about combinators
COL116 ( -2 +0 ^0) Problem about combinators
COL117 ( -2 +0 ^0) Problem about combinators
COL118 ( -2 +0 ^0) Problem about combinators
COL119 ( -2 +0 ^0) Problem about combinators
COL120 ( -2 +0 ^0) Problem about combinators
COL121 ( -2 +0 ^0) Problem about combinators
COL122 ( -2 +0 ^0) Problem about combinators
COL123 ( -2 +0 ^0) Problem about combinators
COL124 ( -2 +0 ^0) Problem about combinators
-------------------------------------------------------------------------------
Domain COM = Computing Theory.
21 problems (11 abstract, 14 CNF, 7 FOF, 0 THF)
-------------------------------------------------------------------------------
COM001 ( -1 +0 ^0) A program correctness theorem
COM002 ( -2 +0 ^0) A program correctness theorem
COM003 ( -2 +3 ^0) The halting problem is undecidable
COM004 ( -1 +0 ^0) Part of completeness of resolution
COM005 ( -1 +0 ^0) Behaviour of an algorithm that orients rings with 3 nodes
COM006 ( -1 +0 ^0) Behaviour of an algorithm that orients rings with 5 nodes
COM007 ( -0 +2 ^0) Preservation of the Diamond Property under reflexive closure
COM008 ( -0 +2 ^0) Induction step in Newman's Lemma
COM009 ( -2 +0 ^0) Problem about UNITY theory
COM010 ( -2 +0 ^0) Problem about UNITY theory
COM011 ( -2 +0 ^0) Problem about UNITY theory
-------------------------------------------------------------------------------
Domain CSR = Commonsense Reasoning.
442 problems (111 abstract, 0 CNF, 442 FOF, 0 THF)
-------------------------------------------------------------------------------
CSR001 ( -0 +2 ^0) Water level is 3 at time 4
CSR002 ( -0 +2 ^0) Not filling at time 4
CSR003 ( -0 +1 ^0) Spilling at time 4
CSR004 ( -0 +2 ^0) Overflow happens at time 3
CSR005 ( -0 +2 ^0) Filling at time 3
CSR006 ( -0 +1 ^0) Waterlevel is 3 at time 3
CSR007 ( -0 +1 ^0) Waterlevel is not 3 at time 2
CSR008 ( -0 +1 ^0) Waterlevel is 2 at time 2
CSR009 ( -0 +1 ^0) Filling at time 2
CSR010 ( -0 +1 ^0) Filling at time 1
CSR011 ( -0 +1 ^0) Not stopped filling between times 0 and 3
CSR012 ( -0 +1 ^0) Waterlevel is 1 at time 1
CSR013 ( -0 +1 ^0) Nothing happens to stop filling at time 2
CSR014 ( -0 +1 ^0) Filling is not released at time 3
CSR015 ( -0 +1 ^0) Not backwards at time 1
CSR016 ( -0 +1 ^0) Forwards at time 1
CSR017 ( -0 +1 ^0) Not spinning at time 1
CSR018 ( -0 +1 ^0) Backwards at time 2
CSR019 ( -0 +1 ^0) Not forwards at time 2
CSR020 ( -0 +1 ^0) Not spinning at time 2
CSR021 ( -0 +1 ^0) Not backwards at time 3
CSR022 ( -0 +1 ^0) Not forwards at time 3
CSR023 ( -0 +1 ^0) Spinning at time 3
CSR024 ( -0 +2 ^0) Multiple trolleys, size 9
CSR025 ( -0 +6 ^0) Autogenerated Cyc Problem CSR025+1
CSR026 ( -0 +6 ^0) Autogenerated Cyc Problem CSR026+1
CSR027 ( -0 +6 ^0) Autogenerated Cyc Problem CSR027+1
CSR028 ( -0 +6 ^0) Autogenerated Cyc Problem CSR028+1
CSR029 ( -0 +6 ^0) Autogenerated Cyc Problem CSR029+1
CSR030 ( -0 +6 ^0) Autogenerated Cyc Problem CSR030+1
CSR031 ( -0 +6 ^0) Autogenerated Cyc Problem CSR031+1
CSR032 ( -0 +6 ^0) Autogenerated Cyc Problem CSR032+1
CSR033 ( -0 +6 ^0) Autogenerated Cyc Problem CSR033+1
CSR034 ( -0 +6 ^0) Autogenerated Cyc Problem CSR034+1
CSR035 ( -0 +6 ^0) Autogenerated Cyc Problem CSR035+1
CSR036 ( -0 +6 ^0) Autogenerated Cyc Problem CSR036+1
CSR037 ( -0 +6 ^0) Autogenerated Cyc Problem CSR037+1
CSR038 ( -0 +6 ^0) Autogenerated Cyc Problem CSR038+1
CSR039 ( -0 +6 ^0) Autogenerated Cyc Problem CSR039+1
CSR040 ( -0 +6 ^0) Autogenerated Cyc Problem CSR040+1
CSR041 ( -0 +6 ^0) Autogenerated Cyc Problem CSR041+1
CSR042 ( -0 +6 ^0) Autogenerated Cyc Problem CSR042+1
CSR043 ( -0 +6 ^0) Autogenerated Cyc Problem CSR043+1
CSR044 ( -0 +6 ^0) Autogenerated Cyc Problem CSR044+1
CSR045 ( -0 +6 ^0) Autogenerated Cyc Problem CSR045+1
CSR046 ( -0 +6 ^0) Autogenerated Cyc Problem CSR046+1
CSR047 ( -0 +6 ^0) Autogenerated Cyc Problem CSR047+1
CSR048 ( -0 +6 ^0) Autogenerated Cyc Problem CSR048+1
CSR049 ( -0 +6 ^0) Autogenerated Cyc Problem CSR049+1
CSR050 ( -0 +6 ^0) Autogenerated Cyc Problem CSR050+1
CSR051 ( -0 +6 ^0) Autogenerated Cyc Problem CSR051+1
CSR052 ( -0 +6 ^0) Autogenerated Cyc Problem CSR052+1
CSR053 ( -0 +6 ^0) Autogenerated Cyc Problem CSR053+1
CSR054 ( -0 +6 ^0) Autogenerated Cyc Problem CSR054+1
CSR055 ( -0 +6 ^0) Autogenerated Cyc Problem CSR055+1
CSR056 ( -0 +6 ^0) Autogenerated Cyc Problem CSR056+1
CSR057 ( -0 +6 ^0) Autogenerated Cyc Problem CSR057+1
CSR058 ( -0 +6 ^0) Autogenerated Cyc Problem CSR058+1
CSR059 ( -0 +6 ^0) Autogenerated Cyc Problem CSR059+1
CSR060 ( -0 +6 ^0) Autogenerated Cyc Problem CSR060+1
CSR061 ( -0 +6 ^0) Autogenerated Cyc Problem CSR061+1
CSR062 ( -0 +6 ^0) Autogenerated Cyc Problem CSR062+1
CSR063 ( -0 +6 ^0) Autogenerated Cyc Problem CSR063+1
CSR064 ( -0 +6 ^0) Autogenerated Cyc Problem CSR064+1
CSR065 ( -0 +6 ^0) Autogenerated Cyc Problem CSR065+1
CSR066 ( -0 +6 ^0) Autogenerated Cyc Problem CSR066+1
CSR067 ( -0 +6 ^0) Autogenerated Cyc Problem CSR067+1
CSR068 ( -0 +6 ^0) Autogenerated Cyc Problem CSR068+1
CSR069 ( -0 +6 ^0) Autogenerated Cyc Problem CSR069+1
CSR070 ( -0 +6 ^0) Autogenerated Cyc Problem CSR070+1
CSR071 ( -0 +6 ^0) Autogenerated Cyc Problem CSR071+1
CSR072 ( -0 +6 ^0) Autogenerated Cyc Problem CSR072+1
CSR073 ( -0 +6 ^0) Autogenerated Cyc Problem CSR073+1
CSR074 ( -0 +6 ^0) Autogenerated Cyc Problem CSR074+1
CSR075 ( -0 +3 ^0) Class subsumption, skolemization
CSR076 ( -0 +3 ^0) Relation subsumption
CSR077 ( -0 +3 ^0) Case elimination reasoning
CSR078 ( -0 +3 ^0) Uses holdsDuring
CSR079 ( -0 +3 ^0) Class equality and subsumption reasoning
CSR080 ( -0 +3 ^0) Hard parts and pieces
CSR081 ( -0 +3 ^0) Family matter
CSR082 ( -0 +3 ^0) Jane does reasoning and perception
CSR083 ( -0 +3 ^0) Class identification
CSR084 ( -0 +3 ^0) Case elimination with multiple rules
CSR085 ( -0 +3 ^0) One simple rule
CSR086 ( -0 +3 ^0) Skolemization, multiple rules
CSR087 ( -0 +3 ^0) Just one rule that cannot be satisfied
CSR088 ( -0 +3 ^0) Overlapping and meeting time
CSR089 ( -0 +3 ^0) Overlapping and meeting space
CSR090 ( -0 +3 ^0) Pieces of time
CSR091 ( -0 +3 ^0) Therapeutic process
CSR092 ( -0 +3 ^0) Ancestry
CSR093 ( -0 +3 ^0) Distant ancestry
CSR094 ( -0 +3 ^0) Class subsumption
CSR095 ( -0 +3 ^0) Case elimination
CSR096 ( -0 +3 ^0) Case elimination
CSR097 ( -0 +3 ^0) A gaseous object
CSR098 ( -0 +3 ^0) Equality reasoning
CSR099 ( -0 +3 ^0) Reasoning about class equality
CSR100 ( -0 +3 ^0) Circular subclass subsumption reasoning
CSR101 ( -0 +3 ^0) An "intensional" query requiring circular subclass reasoning
CSR102 ( -0 +3 ^0) Every physical object has some positive mass
CSR103 ( -0 +3 ^0) Every term is an instance of Entity
CSR104 ( -0 +3 ^0) Temporal point and interval reasoning
CSR105 ( -0 +3 ^0) Temporal interval reasoning
CSR106 ( -0 +3 ^0) Temporal point and interval reasoning
CSR107 ( -0 +3 ^0) Temporal point and interval reasoning
CSR108 ( -0 +3 ^0) Defines a new predicate of 10 arguments
CSR109 ( -0 +3 ^0) Skolemization of a deep class hierarchy, with subsumption
CSR110 ( -0 +3 ^0) The SUMO axioms
CSR111 ( -0 +5 ^0) 1131 axioms from Cyc
-------------------------------------------------------------------------------
Domain FLD = Fields.
279 problems (99 abstract, 279 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
FLD001 ( -1 +0 ^0) Transformation additive relation --> multiplicative relation
FLD002 ( -1 +0 ^0) Transformation multiplicative relation --> additive relation
FLD003 ( -1 +0 ^0) Elimination of an additive term/inverse term - pair
FLD004 ( -1 +0 ^0) Elimination of an multiplicative term/inverse term - pair
FLD005 ( -2 +0 ^0) Every linear equation in the additive group has a solution
FLD006 ( -2 +0 ^0) In the additive group it holds: inverse(identity)=identity
FLD007 ( -2 +0 ^0) The additive inverse fulfills the involution property
FLD008 ( -4 +0 ^0) Compatibility of operation and inverse in the additive group
FLD009 ( -2 +0 ^0) Linear equations in the multiplicative group have a solution
FLD010 ( -3 +0 ^0) In the multiplicative group inverse(identity)=identity
FLD011 ( -2 +0 ^0) The multiplicative inverse fulfills the involution property
FLD012 ( -4 +0 ^0) Compatibility of operation and inverse in multiplicative group
FLD013 ( -5 +0 ^0) The resulting equation of the summation of two equations
FLD014 ( -2 +0 ^0) Compatibility of additive inverses with the equality, part 1
FLD015 ( -2 +0 ^0) Compatibility of additive inverses with the equality, part 2
FLD016 ( -3 +0 ^0) Solutions of linear equations in the additive group are unique
FLD017 ( -2 +0 ^0) Substitution of an element in additive equations
FLD018 ( -2 +0 ^0) If a is zero, the additive inverse of a is also zero 
FLD019 ( -2 +0 ^0) If the additive inverse of a is zero, a itself is zero
FLD020 ( -2 +0 ^0) The additive identity is unique
FLD021 ( -2 +0 ^0) Every element equal to zero is an additive identity 
FLD022 ( -2 +0 ^0) Elimination of a summation in an equation
FLD023 ( -2 +0 ^0) Side Change of a term in an equation, part 1
FLD024 ( -2 +0 ^0) Side Change of a term in an equation, part 2
FLD025 ( -5 +0 ^0) The resulting equation of a multiplication of two equations
FLD026 ( -2 +0 ^0) Compatibility of multiplicative inverses with equality 
FLD027 ( -2 +0 ^0) Elimination of multiplicative inverses in an equation
FLD028 ( -2 +0 ^0) The solution of a multiplicative linear equation is unique 
FLD029 ( -2 +0 ^0) The solution of a multiplicative linear equation is unique
FLD030 ( -4 +0 ^0) Compatibility of multiplication and equality relation
FLD031 ( -3 +0 ^0) If a is one, then the multiplicative inverse of a is also one
FLD032 ( -2 +0 ^0) If the multiplicative inverse of a is one, then a is one itself
FLD033 ( -2 +0 ^0) The multiplicative identity is unique
FLD034 ( -2 +0 ^0) Every element equal one is a multiplicative identity
FLD035 ( -2 +0 ^0) Elimination of a multiplication in an equation
FLD036 ( -2 +0 ^0) Only a multiplication by zero can make elements equal
FLD037 ( -2 +0 ^0) Side change of a term in an equation by multiplication, part 1
FLD038 ( -2 +0 ^0) Side change of a term in an equation by multiplication, part 2
FLD039 ( -2 +0 ^0) In a field with two or more elements, 1 and 0 must be different
FLD040 ( -3 +0 ^0) If a is not 0, then the multiplicative inverse of a is not 0
FLD041 ( -4 +0 ^0) If a,b are not 0, the the product of a and b is not 0
FLD043 ( -3 +0 ^0) The multiplication with 0 yields 0
FLD044 ( -4 +0 ^0) Compatibility of multiplication and additive inverses
FLD045 ( -4 +0 ^0) Compatibility of multiplication and additive inverses
FLD046 ( -2 +0 ^0) Compatibility of the additive and the multiplicative inverse
FLD047 ( -4 +0 ^0) Fraction calculation, part 1
FLD048 ( -4 +0 ^0) Fraction calculation, part 2 
FLD049 ( -4 +0 ^0) Fraction calculation, part 3
FLD050 ( -4 +0 ^0) Fraction calculation, part 4
FLD051 ( -4 +0 ^0) Fraction calculation, part 5
FLD052 ( -4 +0 ^0) Fraction calculation, part 6
FLD053 ( -4 +0 ^0) Fraction calculation, part 7
FLD054 ( -4 +0 ^0) Fraction calculation, part 8
FLD055 ( -2 +0 ^0) Compatibility of order and equality relation
FLD056 ( -2 +0 ^0) Reflexivity of the order relation
FLD057 ( -2 +0 ^0) 0 is less than 1
FLD058 ( -2 +0 ^0) If a greater 0 and b greater or equal a the b greater 0
FLD059 ( -4 +0 ^0) If a greater or equal 0, then 2a greater or equal 0
FLD060 ( -4 +0 ^0) If b greater or equal b, then 2b greater or equal 2a
FLD061 ( -4 +0 ^0) The resulting inequality of a summation of two inequalities
FLD062 ( -2 +0 ^0) Compatibility of the order relation and additive inverses
FLD063 ( -2 +0 ^0) Elimination of additive inverses in an order relation
FLD064 ( -2 +0 ^0) Side change of a term in an order relation, part 1
FLD065 ( -2 +0 ^0) Side change of a term in an order relation, part 2
FLD066 ( -2 +0 ^0) Elimination of a summation in an order relation
FLD067 ( -4 +0 ^0) Side change in an order relation, part 1
FLD068 ( -4 +0 ^0) Side change of a term in an order relation, part 2
FLD069 ( -2 +0 ^0) If b > 0 and a >= 0, then a + b not 0
FLD070 ( -4 +0 ^0) One-sided addition of two order relations
FLD071 ( -4 +0 ^0) One-sided multiplication of two order relations, part 1
FLD072 ( -4 +0 ^0) One-sided multiplication of two order relations, part 2
FLD073 ( -4 +0 ^0) One-sided multiplication of two order relations, part 3
FLD074 ( -4 +0 ^0) Two-sided multiplication in an order relation, part 1
FLD075 ( -4 +0 ^0) Two-sided multiplication in an order relation, part 2
FLD076 ( -4 +0 ^0) Two-sided multiplication in an order relation, part 3
FLD077 ( -4 +0 ^0) Elimination of a product in an order relation, part 1
FLD078 ( -4 +0 ^0) Side change in an order relation, multiplicative part 1
FLD079 ( -4 +0 ^0) Side change in an order relation, multiplicative part 2
FLD080 ( -4 +0 ^0) The square of an element is always greater or equal 0
FLD081 ( -4 +0 ^0) Two-sided multiplication of two order relations
FLD082 ( -2 +0 ^0) Compatibility of order and multiplicative inverses, part 1
FLD083 ( -2 +0 ^0) Compatibility of order and multiplicative inverses, part 2
FLD084 ( -2 +0 ^0) Elimination of multiplicative inverses in an order, part 1
FLD085 ( -2 +0 ^0) Elimination of multiplicative inverses in an order, part 2
FLD086 ( -2 +0 ^0) Compatibility of order and multiplicative inverses, part 1
FLD087 ( -2 +0 ^0) Elimination of a multiplicative inverse in an order, part 1
FLD088 ( -2 +0 ^0) Compatibility of order and multiplicative inverses, part 2
FLD089 ( -2 +0 ^0) Elimination of a multiplicative inverse in an order, part 2
FLD090 ( -2 +0 ^0) A characterization of 1 with help of the order relation
FLD091 ( -2 +0 ^0) One-sided Elimination of a multiplicative inverse, part 1
FLD092 ( -2 +0 ^0) One-sided Elimination of a multiplicative inverse, part 2
FLD093 ( -2 +0 ^0) One-sided Elimination of a multiplicative inverse, part 3
FLD094 ( -2 +0 ^0) One-sided Elimination of a multiplicative inverse, part 4
FLD095 ( -4 +0 ^0) Difficult inequality
FLD096 ( -4 +0 ^0) Difficult inequality
FLD097 ( -4 +0 ^0) Difficult inequality
FLD098 ( -4 +0 ^0) Difficult inequality
FLD099 ( -4 +0 ^0) Difficult inequality
FLD100 ( -4 +0 ^0) Difficult inequality
-------------------------------------------------------------------------------
Domain GEO = Geometry.
489 problems (263 abstract, 253 CNF, 236 FOF, 0 THF)
-------------------------------------------------------------------------------
GEO001 ( -4 +0 ^0) Betweenness is symmetric in its outer arguments
GEO002 ( -4 +0 ^0) For all points x and y, x is between x and y
GEO003 ( -3 +0 ^0) For all points x and y, y is between x and y
GEO004 ( -2 +0 ^0) Every line segment has a midpoint
GEO005 ( -2 +0 ^0) Isosceles triangle based on line segment
GEO006 ( -3 +0 ^0) Betweenness for 3 points on a line
GEO007 ( -3 +0 ^0) Betweenness for 4 points on a line
GEO008 ( -3 +0 ^0) Betweenness for 5 points on a line (Five point theorem)
GEO009 ( -3 +0 ^0) First inner connectivity property of betweenness
GEO010 ( -3 +0 ^0) Collinearity is invariant
GEO011 ( -5 +0 ^0) The axiom set points are not collinear
GEO012 ( -3 +0 ^0) Collinearity for 4 points
GEO013 ( -3 +0 ^0) Collinearity for 5 points
GEO014 ( -1 +0 ^0) Ordinary reflexivity of equidistance
GEO015 ( -2 +0 ^0) Equidistance is symmetric between its argument pairs
GEO016 ( -2 +0 ^0) Equidistance is symmetric within its argument pairs
GEO017 ( -2 +0 ^0) Corollary 1 to symmetries of equidistance
GEO018 ( -2 +0 ^0) Corollary 2 to symmetries of equidistance
GEO019 ( -2 +0 ^0) Corollary 3 to symmetries of equidistance
GEO020 ( -2 +0 ^0) Corollary 4 to symmetries of equidistance
GEO021 ( -2 +0 ^0) Corollary 5 to symmetries of equidistance
GEO022 ( -2 +0 ^0) Ordinary transitivity of equidistance
GEO024 ( -2 +0 ^0) All null segments are congruent
GEO025 ( -2 +0 ^0) Addition of equal segments
GEO026 ( -2 +0 ^0) Extension is unique
GEO027 ( -2 +0 ^0) Corollary 1 to unique extension
GEO028 ( -2 +0 ^0) Corollary 2 to unique extension
GEO029 ( -2 +0 ^0) Corollary 3 to unique extension
GEO030 ( -2 +0 ^0) Corollary to the outer five-segment axiom
GEO031 ( -2 +0 ^0) Second inner five-segment theorem
GEO032 ( -2 +0 ^0) Equal difference between pairs of equal length line segments
GEO033 ( -2 +0 ^0) First inner five-segment theorem
GEO034 ( -2 +0 ^0) Corollary to the first inner five-segment theorem
GEO035 ( -2 +0 ^0) A null extension does not extend a line
GEO036 ( -2 +0 ^0) The 3 axiom set points are distinct
GEO037 ( -2 +0 ^0) A segment can be extended
GEO038 ( -2 +0 ^0) Corollary 1 to the segment contruction axiom
GEO039 ( -2 +0 ^0) Corollary the identity axiom for betweenness
GEO040 ( -2 +0 ^0) Antisymmetry of betweenness in its first two arguments
GEO041 ( -2 +0 ^0) Corollary to antisymmetry of betweenness in first 2 arguments
GEO042 ( -2 +0 ^0) First inner transitivity property of betweenness
GEO043 ( -2 +0 ^0) Corollary to first inner transitivity property of betweenness
GEO044 ( -2 +0 ^0) First outer transitivity property for betweenness
GEO045 ( -2 +0 ^0) Second outer transitivity property of betweenness
GEO046 ( -2 +0 ^0) Second inner transitivity property of betweenness
GEO047 ( -2 +0 ^0) Corollary to second inner inner transitivity of betweenness
GEO048 ( -2 +0 ^0) Inner points of triangle
GEO049 ( -2 +0 ^0) Theorem of similar situations
GEO050 ( -2 +0 ^0) First outer connectivity property of betweenness
GEO051 ( -2 +0 ^0) Second outer connectivity property of betweenness
GEO052 ( -2 +0 ^0) Second inner connectivity property of betweenness
GEO053 ( -2 +0 ^0) Unique endpoint
GEO054 ( -2 +0 ^0) Corollary 2 to the segment construction axiom
GEO055 ( -2 +0 ^0) Corollary 3 to the segment construction axiom
GEO056 ( -2 +0 ^0) Corollary 1 to null extension
GEO057 ( -2 +0 ^0) Corollary 2 of null extension
GEO058 ( -2 +0 ^0) U is the only fixed point of reflection(U,V)
GEO059 ( -2 +0 ^0) Congruence for double reflection
GEO060 ( -1 +0 ^0) Reflection is an involution
GEO061 ( -2 +0 ^0) Theorem of point insertion
GEO062 ( -2 +0 ^0) Insertion identity
GEO063 ( -2 +0 ^0) Insertion respects congruence in its last two arguments
GEO064 ( -2 +0 ^0) Corollary 1 to collinearity
GEO065 ( -2 +0 ^0) Corollary 2 to collinearity
GEO066 ( -2 +0 ^0) Corollary 3 to collinearity
GEO067 ( -2 +0 ^0) Any two points are collinear
GEO068 ( -2 +0 ^0) Theorem of similar situations for collinear U, V, W
GEO069 ( -2 +0 ^0) A property of collinearity
GEO070 ( -2 +0 ^0) Non-collinear points in the bisecting diagonal theorem
GEO071 ( -2 +0 ^0) Corollary 1 to non-collinear points theorem
GEO072 ( -2 +0 ^0) Corollary 2 to non-collinear points theorem
GEO073 ( -3 +0 ^0) The diagonals of a non-degenerate rectancle bisect
GEO074 ( -1 +0 ^0) Prove the Outer Pasch Axiom
GEO075 ( -1 +0 ^0) Show reflexivity for equidistance is dependent
GEO076 ( -1 +0 ^0) There is no point on every line
GEO077 ( -1 +0 ^0) Three points not collinear if not on line
GEO078 ( -4 +0 ^0) Every plane contains 3 noncollinear points
GEO079 ( -1 +0 ^0) The alternate interior angles in a trapezoid are equal
GEO080 ( -1 +1 ^0) Reflexivity of part_of
GEO081 ( -1 +1 ^0) Transitivity of part_of
GEO082 ( -1 +1 ^0) Antisymmetry of part_of
GEO083 ( -1 +1 ^0) Sum is monotone, part 1
GEO084 ( -1 +1 ^0) Sum is monotone, part 2
GEO085 ( -1 +1 ^0) Every open curve has at least two endpoints
GEO086 ( -1 +1 ^0) Every sub-curve of an open curve is open
GEO087 ( -1 +1 ^0) If one curve is part of another curve then they cannot meet
GEO088 ( -1 +1 ^0) Endpoint of subcurve or curve
GEO089 ( -1 +1 ^0) Inner points of a sub-curve of a curve are inner points
GEO090 ( -1 +1 ^0) Meeting point of curves on a subcurve
GEO091 ( -1 +1 ^0) Two points determine subcurve
GEO092 ( -1 +1 ^0) Common point of open sum is the meeting point
GEO093 ( -1 +1 ^0) Sum of meeting open curves is open
GEO094 ( -1 +1 ^0) Meeting point is not an endpoint of contianing curve
GEO095 ( -1 +1 ^0) Endpoints of open sum are endpoints of curves
GEO096 ( -1 +1 ^0) Endpoints of curves are endpoints of sum
GEO097 ( -1 +1 ^0) A subcurves connects any two points on a curve
GEO098 ( -1 +1 ^0) For closed curves, there are two complementary sub-curves
GEO099 ( -1 +1 ^0) Open subcurves can be complemented to form the sum
GEO100 ( -1 +1 ^0) Subcurves with common endpoint can be complemented
GEO101 ( -1 +1 ^0) Intensification of GEO100+1
GEO102 ( -1 +1 ^0) Common endpoint of subcurves means inclusion
GEO103 ( -1 +1 ^0) Common endpoint of subcurves and another point means inclusion
GEO104 ( -1 +1 ^0) Subcurves with common endpoint meet or include
GEO105 ( -1 +1 ^0) If subcurves meet at an endpoint then there's a meeting
GEO106 ( -1 +1 ^0) Two common endpoints means identical or sum to whole
GEO107 ( -1 +1 ^0) Equivalence of betweenness definitions 1 and 2
GEO108 ( -1 +1 ^0) Equivalence of betweenness definitions 1 and 3
GEO109 ( -1 +1 ^0) Every endpoint of an open curve is not between any other points
GEO110 ( -1 +1 ^0) Betweenness for closed curves
GEO111 ( -1 +1 ^0) Basic property of orderings on linear structures 1
GEO112 ( -1 +1 ^0) Basic property of orderings on linear structures 2
GEO113 ( -1 +1 ^0) Basic property of orderings on linear structures 3
GEO114 ( -1 +1 ^0) Basic property of orderings on linear structures 4
GEO115 ( -1 +1 ^0) Basic property of orderings on linear structures 5
GEO116 ( -1 +1 ^0) Open curve betweenness property for three points
GEO117 ( -1 +1 ^0) Precedence on oriented curves is irreflexive
GEO118 ( -1 +1 ^0) Precedence on oriented curves is asymmetric
GEO119 ( -1 +1 ^0) Oriented curve starting point is endpoint of underlying curve
GEO120 ( -1 +1 ^0) Oriented curve finishing point is endpoint of underlying curve
GEO121 ( -1 +1 ^0) Endpoints are either starting or finishing points
GEO122 ( -1 +1 ^0) Every curve has a finishing point
GEO123 ( -1 +1 ^0) Every oriented curve orders all points on it
GEO124 ( -1 +1 ^0) Every oriented curve has at most one starting point
GEO125 ( -1 +1 ^0) Every oriented curve has at most one finishing point
GEO126 ( -1 +1 ^0) Every oriented curve orders some points
GEO127 ( -1 +1 ^0) Incidence on oriented curves can be defined using precedence
GEO128 ( -1 +1 ^0) Precedence of three points, of whoich two are ordered
GEO129 ( -1 +1 ^0) Precedence on an oriented curve is a transitive relation
GEO130 ( -1 +1 ^0) Betweenness and precedence for three points
GEO131 ( -1 +1 ^0) Betweenness and precedence for three points, corollary
GEO132 ( -1 +1 ^0) Betweenness and precedence property 1
GEO133 ( -1 +1 ^0) Betweenness and precedence property 2
GEO134 ( -1 +1 ^0) Betweenness and precedence property 3
GEO135 ( -1 +1 ^0) Ordering can be determined by betweenness and incidence
GEO136 ( -1 +1 ^0) Underlying curve and one pair of points sufficient for ordering
GEO137 ( -1 +1 ^0) Identical oriented lines
GEO138 ( -1 +1 ^0) Curve and ordered points determine oriented curve
GEO139 ( -1 +1 ^0) Oppositely oriented curve exists
GEO140 ( -1 +1 ^0) Unique oppositely oriented curve 1
GEO141 ( -1 +1 ^0) Unique oppositely oriented curve 2
GEO142 ( -1 +1 ^0) Unique oppositely oriented curve 3
GEO143 ( -1 +1 ^0) Unique oppositely oriented curve 4
GEO144 ( -1 +1 ^0) Unique oppositely oriented curve 5
GEO145 ( -1 +1 ^0) Starting point and precedence
GEO146 ( -1 +1 ^0) Symmetry of connect
GEO147 ( -1 +1 ^0) Meeting is possible only if there is a common position
GEO148 ( -1 +1 ^0) No meeting if someone has already passed
GEO149 ( -1 +1 ^0) Condition for meeting at two points
GEO150 ( -1 +1 ^0) Objects cannot be at two places simultaneously
GEO151 ( -1 +1 ^0) Object stays still while one moves
GEO152 ( -1 +1 ^0) Ordered meeting places
GEO153 ( -2 +0 ^0) Tarski geometry axioms
GEO154 ( -2 +0 ^0) Colinearity axioms for the GEO001 geometry axioms
GEO155 ( -1 +0 ^0) Reflection axioms for the GEO002 geometry axioms
GEO156 ( -1 +0 ^0) Insertion axioms for the GEO003 geometry axioms
GEO157 ( -1 +0 ^0) Hilbert geometry axioms
GEO158 ( -1 +1 ^0) Simple curve axioms
GEO159 ( -1 +1 ^0) Betweenness for simple curves
GEO160 ( -1 +1 ^0) Oriented curves
GEO161 ( -1 +1 ^0) Trajectories
GEO162 ( -1 +0 ^0) Hilbert geometry axioms, adapted to respect multi-sortedness
GEO163 ( -1 +0 ^0) Not enough axioms to prove collinearity of a finite set of points
GEO164 ( -0 +1 ^0) Hessenberg's Theorem
GEO165 ( -0 +1 ^0) Case 2 in Cronheim's proof of Hessenberg's Theorem
GEO166 ( -0 +1 ^0) Case 1 in Cronheim's proof of Hessenberg's Theorem
GEO167 ( -0 +1 ^0) Pappus1 implies Pappus2
GEO168 ( -0 +1 ^0) Pappus2 implies Pappus1
GEO169 ( -0 +2 ^0) Reduction of 8 cases to 2 in Cronheim's proof of Hessenberg
GEO170 ( -0 +2 ^0) Uniqueness of constructed lines
GEO171 ( -0 +2 ^0) Two convergent lines are distinct 
GEO172 ( -0 +2 ^0) Uniqueness of constructed points
GEO173 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO174 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO175 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO176 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO177 ( -0 +2 ^0) Symmetry of apartness
GEO178 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO179 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO180 ( -0 +2 ^0) Triangle axiom 1
GEO181 ( -0 +2 ^0) Triangle axiom 2
GEO182 ( -0 +2 ^0) Triangle axiom 3
GEO183 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO184 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO185 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO186 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO187 ( -0 +2 ^0) Symmetry of incidence
GEO188 ( -0 +2 ^0) Collary to symmetry of incidence
GEO189 ( -0 +2 ^0) Collary to symmetry of incidence
GEO190 ( -0 +2 ^0) Collary to symmetry of incidence
GEO191 ( -0 +2 ^0) Symmetry of apartness
GEO192 ( -0 +2 ^0) Lemma on symmetry and apartness
GEO193 ( -0 +2 ^0) Corollary to symmetry of apartness
GEO194 ( -0 +2 ^0) Corollary to symmetry of apartness
GEO195 ( -0 +2 ^0) Corollary to symmetry of apartness
GEO196 ( -0 +2 ^0) Symmetry of incidence
GEO197 ( -0 +2 ^0) Corollary to symmetry of incidence
GEO198 ( -0 +2 ^0) Corollary to symmetry of incidence
GEO199 ( -0 +2 ^0) Corollary to symmetry of incidence
GEO200 ( -0 +2 ^0) Line equals its converse
GEO201 ( -0 +2 ^0) Distinct ends means distinct lines
GEO202 ( -0 +2 ^0) Diverging lines have equal ends
GEO203 ( -0 +2 ^0) Equal lines from points
GEO204 ( -0 +2 ^0) Distinct points and equal lines
GEO205 ( -0 +2 ^0) Convergent lines and equal points
GEO206 ( -0 +2 ^0) Point on parallel lines
GEO207 ( -0 +2 ^0) Irreflexivity of line convergence
GEO208 ( -0 +2 ^0) Point on both parallel lines
GEO209 ( -0 +2 ^0) Pont and three parallel lines
GEO210 ( -0 +2 ^0) Uniqueness of orthogonality
GEO211 ( -0 +2 ^0) A line is not orthogonal to itself
GEO212 ( -0 +2 ^0) Non-orthogonal lines and a third line
GEO213 ( -0 +2 ^0) Corollary to non-orthogonal lines and a third line
GEO214 ( -0 +2 ^0) Corollary to non-orthogonal lines and a third line
GEO215 ( -0 +2 ^0) Third line not orthogonal to two convergent lines
GEO216 ( -0 +2 ^0) A line is not orthogonal to itself
GEO217 ( -0 +2 ^0) Transitivity of parallel
GEO218 ( -0 +2 ^0) Transitivity of parallel and orthogonal
GEO219 ( -0 +2 ^0) Transitivity of orthogonal and parallel
GEO220 ( -0 +2 ^0) Transitivity of orthogonal
GEO221 ( -0 +2 ^0) Lemma on orthogonality
GEO222 ( -0 +2 ^0) Parallel to orthogonal to orthogonal
GEO223 ( -0 +2 ^0) Corollary to uniqueness of parallels
GEO224 ( -0 +2 ^0) Find point incident to line
GEO225 ( -0 +2 ^0) Existence of line joining distinct points
GEO226 ( -0 +2 ^0) Existence of point incident to line
GEO227 ( -0 +1 ^0) Lines not directed and opposite
GEO228 ( -0 +1 ^0) Obervability of equal or opposite direction
GEO229 ( -0 +1 ^0) Uniqueness of reversed lines
GEO230 ( -0 +1 ^0) Reversed lines are equal and conversely directed
GEO231 ( -0 +1 ^0) Oppositely and equally directed lines
GEO232 ( -0 +1 ^0) A line is not oppositely directed to itself
GEO233 ( -0 +1 ^0) Reverse is idempotent for direction
GEO234 ( -0 +1 ^0) Unequally directed lines
GEO235 ( -0 +1 ^0) Left and right apart leads to distinctness of points
GEO236 ( -0 +1 ^0) Left and right apart leads to distinctness of lines
GEO237 ( -0 +1 ^0) Axiom of Pasch
GEO238 ( -0 +1 ^0) Strengthened axiom of Pasch
GEO239 ( -0 +1 ^0) Lemma on oriented intersection of lines with plane
GEO240 ( -0 +1 ^0) Lemma on oriented intersection of lines with plane
GEO241 ( -0 +1 ^0) Lemma on oriented intersection of lines with plane
GEO242 ( -0 +1 ^0) Lemma on oriented intersection of lines with plane
GEO243 ( -0 +1 ^0) Configurations in terms of apartness
GEO244 ( -0 +1 ^0) Configurations in terms of apartness
GEO245 ( -0 +1 ^0) Configurations in terms of apartness
GEO246 ( -0 +1 ^0) Configurations in terms of apartness
GEO247 ( -0 +1 ^0) A point in each region formed by intersecting lines
GEO248 ( -0 +1 ^0) A point in each region formed by parallel lines
GEO249 ( -0 +1 ^0) A point in each region formed by parallel lines
GEO250 ( -0 +1 ^0) A point in each region formed by parallel lines
GEO251 ( -0 +1 ^0) A point in each region formed by parallel lines
GEO252 ( -0 +1 ^0) Jordan-type result for half planes
GEO253 ( -0 +1 ^0) Characteristic property of parallel lines
GEO254 ( -0 +1 ^0) Order on a line is observable
GEO255 ( -0 +1 ^0) Property of order and betweeness
GEO256 ( -0 +1 ^0) Property of order and betweeness
GEO257 ( -0 +1 ^0) Transitivity of order on a line
GEO258 ( -0 +1 ^0) Betweeness
GEO259 ( -0 +1 ^0) Betweeness
GEO260 ( -0 +1 ^0) Betweeness
GEO261 ( -0 +1 ^0) Lemma for parallel projection preserves or reverses order
GEO262 ( -0 +1 ^0) Lemma for parallel projection preserves or reverses order
GEO263 ( -0 +1 ^0) Parallel projection preserves or reverses order
GEO264 ( -0 +1 ^0) Traingle divides plane into seven regions
-------------------------------------------------------------------------------
Domain GRA = Graph Theory.
126 problems (74 abstract, 1 CNF, 32 FOF, 93 THF)
-------------------------------------------------------------------------------
GRA001 ( -1 +0 ^0) Clauses from a labelled graph
GRA002 ( -0 +4 ^0) Maximal shortest path length in terms of triangles
GRA003 ( -0 +1 ^0) Parts of paths
GRA004 ( -0 +1 ^0) Maximal shortest path length in terms of triangles
GRA005 ( -0 +1 ^0) Maximal shortest path length in terms of triangles
GRA006 ( -0 +1 ^0) Maximal shortest path length in terms of triangles
GRA007 ( -0 +2 ^0) Maximal shortest path length in terms of triangles
GRA008 ( -0 +2 ^0) Maximal shortest path length in terms of triangles
GRA009 ( -0 +2 ^0) Maximal shortest path length in terms of triangles
GRA010 ( -0 +2 ^0) Maximal shortest path length in terms of triangles
GRA011 ( -0 +1 ^0) Maximal shortest path length in terms of triangles
GRA012 ( -0 +1 ^0) Maximal shortest path length in terms of triangles
GRA013 ( -0 +1 ^0) 2-colored completed graph size 5 without subgraph of size 3 
GRA014 ( -0 +1 ^0) 2-colored completed graph size 6 without subgraph of size 3 
GRA015 ( -0 +1 ^0) 2-colored completed graph size 11 without subgraph of size 4 
GRA016 ( -0 +1 ^0) 2-colored completed graph size 12 without subgraph of size 4 
GRA017 ( -0 +1 ^0) 2-colored completed graph size 13 without subgraph of size 4 
GRA018 ( -0 +1 ^0) 2-colored completed graph size 17 without subgraph of size 4 
GRA019 ( -0 +1 ^0) 2-colored completed graph size 18 without subgraph of size 4 
GRA020 ( -0 +1 ^0) 2-colored completed graph size 11 without subgraph of size 5 
GRA021 ( -0 +1 ^0) 2-colored completed graph size 12 without subgraph of size 5 
GRA022 ( -0 +1 ^0) 2-colored completed graph size 13 without subgraph of size 5 
GRA023 ( -0 +1 ^0) 2-colored completed graph size 16 without subgraph of size 5 
GRA024 ( -0 +1 ^0) 2-colored completed graph size 11 without subgraph of size 6 
GRA025 ( -0 +1 ^0) 2-colored completed graph size 14 without subgraph of size 6 
GRA026 ( -0 +1 ^0) 2-colored completed graph size 20 without subgraph of size 6 
GRA027 ( -0 +0 ^1) R(3,3) > 4
GRA028 ( -0 +0 ^1) R(2,4) <= 4
GRA029 ( -0 +0 ^2) R(4,4) > 16
GRA030 ( -0 +0 ^1) R(2,5) > 4
GRA031 ( -0 +0 ^2) R(3,5) <= 16
GRA032 ( -0 +0 ^2) R(3,6) > 16
GRA033 ( -0 +0 ^2) R(6,6) <= 256
GRA034 ( -0 +0 ^2) R(6,7) > 256
GRA035 ( -0 +0 ^2) R(6,7) <= 256
GRA036 ( -0 +0 ^2) R(7,7) > 256
GRA037 ( -0 +0 ^2) R(7,7) <= 256
GRA038 ( -0 +0 ^2) R(5,8) <= 256
GRA039 ( -0 +0 ^2) R(6,8) > 256
GRA040 ( -0 +0 ^2) R(6,8) <= 256
GRA041 ( -0 +0 ^2) R(7,8) > 256
GRA042 ( -0 +0 ^2) R(7,8) <= 256
GRA043 ( -0 +0 ^2) R(8,8) > 256
GRA044 ( -0 +0 ^2) R(5,9) > 256
GRA045 ( -0 +0 ^2) R(5,9) <= 256
GRA046 ( -0 +0 ^2) R(6,9) > 256
GRA047 ( -0 +0 ^2) R(6,9) <= 256
GRA048 ( -0 +0 ^2) R(7,9) > 256
GRA049 ( -0 +0 ^2) R(7,9) <= 256
GRA050 ( -0 +0 ^2) R(5,10) > 256
GRA051 ( -0 +0 ^2) R(5,10) <= 256
GRA052 ( -0 +0 ^2) R(6,10) > 256
GRA053 ( -0 +0 ^2) R(6,10) <= 256
GRA054 ( -0 +0 ^2) R(7,10) > 256
GRA055 ( -0 +0 ^2) R(5,11) > 256
GRA056 ( -0 +0 ^2) R(5,11) <= 256
GRA057 ( -0 +0 ^2) R(6,11) > 256
GRA058 ( -0 +0 ^2) R(6,11) <= 256
GRA059 ( -0 +0 ^2) R(4,12) <= 256
GRA060 ( -0 +0 ^2) R(5,12) > 256
GRA061 ( -0 +0 ^2) R(5,12) <= 256
GRA062 ( -0 +0 ^2) R(6,12) > 256
GRA063 ( -0 +0 ^2) R(4,13) > 256
GRA064 ( -0 +0 ^2) R(4,13) <= 256
GRA065 ( -0 +0 ^2) R(5,13) > 256
GRA066 ( -0 +0 ^2) R(5,13) <= 256
GRA067 ( -0 +0 ^2) R(4,14) > 256
GRA068 ( -0 +0 ^2) R(4,14) <= 256
GRA069 ( -0 +0 ^2) R(5,14) > 256
GRA070 ( -0 +0 ^2) R(5,14) <= 256
GRA071 ( -0 +0 ^2) R(3,15) <= 256
GRA072 ( -0 +0 ^2) R(4,15) > 256
GRA073 ( -0 +0 ^2) R(4,15) <= 256
GRA074 ( -0 +0 ^2) R(5,15) > 256
-------------------------------------------------------------------------------
Domain GRP = Groups.
941 problems (653 abstract, 792 CNF, 149 FOF, 0 THF)
-------------------------------------------------------------------------------
GRP001 ( -5 +1 ^0) X^2 = identity => commutativity
GRP002 ( -4 +0 ^0) Commutator equals identity in groups of order 3
GRP003 ( -2 +0 ^0) The left identity is also a right identity
GRP004 ( -2 +0 ^0) Left inverse and identity => Right inverse exists
GRP005 ( -1 +0 ^0) Identity is in this subset of a group
GRP006 ( -1 +0 ^0) Inverse is in this group
GRP007 ( -1 +0 ^0) The identity element is unique
GRP008 ( -1 +0 ^0) Unknown meaning
GRP009 ( -1 +0 ^0) The left inverse of an element is unique
GRP010 ( -2 +0 ^0) Inverse is a symmetric relationship
GRP011 ( -1 +0 ^0) Left cancellation
GRP012 ( -4 +1 ^0) Inverse of products = Product of inverses
GRP013 ( -1 +0 ^0) Commutator equals identity in these conditions
GRP014 ( -1 +0 ^0) Product is associative in this group theory
GRP015 ( -1 +0 ^0) x,<<x x,X> x,X> is a group
GRP016 ( -1 +0 ^0) There is a homomorphism from a group to itself
GRP017 ( -1 +0 ^0) The inverse of each element is unique
GRP018 ( -1 +0 ^0) X times identity is X
GRP019 ( -1 +0 ^0) Identity times X is X
GRP020 ( -1 +0 ^0) Inverse of X times X is the identity
GRP021 ( -1 +0 ^0) X times inverse of X is the identity
GRP022 ( -2 +0 ^0) Inverse is an involution
GRP023 ( -2 +0 ^0) The inverse of the identity is the identity
GRP024 ( -2 +0 ^0) Associativity of commutator
GRP025 ( -4 +0 ^0) All groups of order 2 are isomorphic
GRP026 ( -4 +0 ^0) All groups of order 3 are isomorphic
GRP027 ( -2 +0 ^0) All groups of order 5 are cyclic
GRP028 ( -4 +0 ^0) In semigroups, left and right solutions => right id exists
GRP029 ( -2 +0 ^0) In semigroups, left id and inverse => right id exists
GRP030 ( -1 +0 ^0) In semigroups, left id and inverse => left id=right id
GRP031 ( -2 +0 ^0) In semigroups, left inverse and id => right inverse exists
GRP032 ( -1 +0 ^0) In subgroups, there is an identity
GRP033 ( -2 +0 ^0) In subgroups, the identity is the group identity
GRP034 ( -2 +0 ^0) In subgroups, inverse is closed
GRP035 ( -1 +0 ^0) In subgroups, product is closed
GRP036 ( -1 +0 ^0) In subgroups, the identity element is unique
GRP037 ( -1 +0 ^0) In subgroups, the inverse of an element is unique
GRP038 ( -1 +0 ^0) In subgroups, if a and b are members, then a.b^-1 is a member
GRP039 ( -7 +0 ^0) Subgroups of index 2 are normal
GRP040 ( -2 +0 ^0) In subgroups of order 2, inverse is an involution
GRP041 ( -1 +0 ^0) Reflexivity is dependent
GRP042 ( -1 +0 ^0) Symmetry is dependent
GRP043 ( -1 +0 ^0) Transitivity is dependent
GRP044 ( -1 +0 ^0) Product subsitution 1 is dependent
GRP045 ( -1 +0 ^0) Product subsitution 2 is dependent
GRP046 ( -1 +0 ^0) Multiply substitution 1 is dependent
GRP047 ( -1 +0 ^0) Multiply substitution 2 is dependent
GRP048 ( -1 +0 ^0) Inverse substitution is dependent
GRP049 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP050 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP051 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP052 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP053 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP054 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP055 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP056 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP057 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP058 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP059 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP060 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP061 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP062 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP063 ( -1 +0 ^0) Single axiom for group theory, in division
GRP064 ( -1 +0 ^0) Single axiom for group theory, in division
GRP065 ( -1 +0 ^0) Single axiom for group theory, in division
GRP066 ( -1 +0 ^0) Single axiom for group theory, in division and identity
GRP067 ( -1 +0 ^0) Single axiom for group theory, in division and identity
GRP068 ( -1 +0 ^0) Single axiom for group theory, in division and identity
GRP069 ( -1 +0 ^0) Single axiom for group theory, in division and identity
GRP070 ( -1 +0 ^0) Single axiom for group theory, in division and inverse
GRP071 ( -1 +0 ^0) Single axiom for group theory, in division and inverse
GRP072 ( -1 +0 ^0) Single axiom for group theory, in division and inverse
GRP073 ( -1 +0 ^0) Single axiom for group theory, in division and inverse
GRP074 ( -1 +0 ^0) Single axiom for group theory, in division and inverse
GRP075 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP076 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP077 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP078 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP079 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP080 ( -1 +0 ^0) Single axiom for group theory, in double division and identity
GRP081 ( -1 +0 ^0) Single axiom for group theory, in double division and inverse
GRP082 ( -1 +0 ^0) Single axiom for group theory, in double division and inverse
GRP083 ( -1 +0 ^0) Single axiom for group theory, in double division and inverse
GRP084 ( -1 +0 ^0) Single axiom for Abelian group theory, in product and inverse
GRP085 ( -1 +0 ^0) Single axiom for Abelian group theory, in product and inverse
GRP086 ( -1 +0 ^0) Single axiom for Abelian group theory, in product and inverse
GRP087 ( -1 +0 ^0) Single axiom for Abelian group theory, in product and inverse
GRP088 ( -1 +0 ^0) Single axiom for Abelian group theory, in division
GRP089 ( -1 +0 ^0) Single axiom for Abelian group theory, in division
GRP090 ( -1 +0 ^0) Single axiom for Abelian group theory, in division
GRP091 ( -1 +0 ^0) Single axiom for Abelian group theory, in division
GRP092 ( -1 +0 ^0) Single axiom for Abelian group theory, in division
GRP093 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and identity
GRP094 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and identity
GRP095 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and identity
GRP096 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and inverse
GRP097 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and inverse
GRP098 ( -1 +0 ^0) Single axiom for Abelian group theory, in division and inverse
GRP099 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and id
GRP100 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and id
GRP101 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and id
GRP102 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and id
GRP103 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and id
GRP104 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP105 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP106 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP107 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP108 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP109 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP110 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP111 ( -1 +0 ^0) Single axiom for Abelian group theory, in double div and inv
GRP112 ( -1 +0 ^0) Single axiom for group theory, in product & inverse
GRP113 ( -1 +0 ^0) Lemma for proving all groups of order 4 are cyclic
GRP114 ( -1 +0 ^0) Product of positive and negative parts of X equals X
GRP115 ( -1 +0 ^0) Derive order 3 from a single axiom for groups order 3
GRP116 ( -1 +0 ^0) Derive left identity from a single axiom for groups order 3
GRP117 ( -1 +0 ^0) Derive right identity from a single axiom for groups order 3
GRP118 ( -1 +0 ^0) Derive associativity from a single axiom for groups order 3
GRP119 ( -1 +0 ^0) Derive order 4 from a single axiom for groups order 4
GRP120 ( -1 +0 ^0) Derive left identity from a single axiom for groups order 4
GRP121 ( -1 +0 ^0) Derive right identity from a single axiom for groups order 4
GRP122 ( -1 +0 ^0) Derive associativity from a single axiom for groups order 4
GRP123 (-16 +0 ^0) (3,2,1) conjugate orthogonality
GRP124 (-16 +0 ^0) (3,1,2) conjugate orthogonality
GRP125 ( -8 +0 ^0) (a.b).(b.a) = a
GRP126 ( -8 +0 ^0) (a.b).(b.a) = b
GRP127 ( -8 +0 ^0) ((b.a).b).b) = a
GRP128 ( -8 +0 ^0) (a.b).b = a.(a.b)
GRP129 ( -8 +0 ^0) a.(b.a) = (b.a).b
GRP130 ( -8 +0 ^0) (a.(a.b)).b = a
GRP131 ( -4 +0 ^0) (3,2,1) conjugate orthogonality, no idempotence
GRP132 ( -4 +0 ^0) (3,1,2) conjugate orthogonality, no idempotence
GRP133 ( -4 +0 ^0) (a.b).(b.a) = a, no idempotence
GRP134 ( -4 +0 ^0) (a.b).(b.a) = b, no idempotence
GRP135 ( -4 +0 ^0) ((b.a).b).b) = a, no idempotence
GRP136 ( -1 +0 ^0) Prove anti-symmetry axiom using the LUB transformation
GRP137 ( -1 +0 ^0) Prove anti-symmetry axiom using the GLB transformation
GRP138 ( -1 +0 ^0) Prove greatest lower-bound axiom using the LUB transformation
GRP139 ( -1 +0 ^0) Prove greatest lower-bound axiom using the GLB transformation
GRP140 ( -1 +0 ^0) Prove greatest lower-bound axiom using a transformation
GRP141 ( -1 +0 ^0) Prove greatest lower-bound axiom using a transformation
GRP142 ( -1 +0 ^0) Prove greatest lower-bound axiom using the LUB transformation
GRP143 ( -1 +0 ^0) Prove greatest lower-bound axiom using the GLB transformation
GRP144 ( -1 +0 ^0) Prove greatest lower-bound axiom using the LUB transformation
GRP145 ( -1 +0 ^0) Prove greatest lower-bound axiom using the GLB transformation
GRP146 ( -1 +0 ^0) Prove least upper-bound axiom using the LUB transformation
GRP147 ( -1 +0 ^0) Prove least upper-bound axiom using the GLB transformation
GRP148 ( -1 +0 ^0) Prove least upper-bound axiom using a transformation
GRP149 ( -1 +0 ^0) Prove least upper-bound axiom using a transformation
GRP150 ( -1 +0 ^0) Prove least upper-bound axiom using the LUB transformation
GRP151 ( -1 +0 ^0) Prove least upper-bound axiom using the GLB transformation
GRP152 ( -1 +0 ^0) Prove least upper-bound axiom using the LUB transformation
GRP153 ( -1 +0 ^0) Prove least upper-bound axiom using the GLB transformation
GRP154 ( -1 +0 ^0) Prove monotonicity axiom using the LUB transformation
GRP155 ( -1 +0 ^0) Prove monotonicity axiom using the GLB transformation
GRP156 ( -1 +0 ^0) Prove monotonicity axiom using a transformation
GRP157 ( -1 +0 ^0) Prove monotonicity axiom using the LUB transformation
GRP158 ( -1 +0 ^0) Prove monotonicity axiom using the GLB transformation
GRP159 ( -1 +0 ^0) Prove monotonicity axiom using a transformation
GRP160 ( -1 +0 ^0) Prove reflexivity axiom using the LUB transformation
GRP161 ( -1 +0 ^0) Prove reflexivity axiom using the GLB transformation
GRP162 ( -1 +0 ^0) Prove transitivity axiom using the LUB transformation
GRP163 ( -1 +0 ^0) Prove transitivity axiom using the GLB transformation
GRP164 ( -2 +0 ^0) The lattice of each LOG is distributive
GRP165 ( -2 +0 ^0) An application of monotonicity
GRP166 ( -4 +0 ^0) Multiplication with a positive element increases a value
GRP167 ( -5 +0 ^0) Product of positive and negative parts
GRP168 ( -2 +0 ^0) Inner group automorphisms are order preserving
GRP169 ( -2 +0 ^0) Inverses reverse inequalities
GRP170 ( -4 +0 ^0) General form of monotonicity
GRP171 ( -2 +0 ^0) Positive elements form a semigroup
GRP172 ( -2 +0 ^0) Negative elements form a semigroup
GRP173 ( -1 +0 ^0) Each subgroup of negative elements is trivial
GRP174 ( -1 +0 ^0) Each subgroup of positive elements is trivial
GRP175 ( -4 +0 ^0) Positivity is preserved under inner automorphisms
GRP176 ( -2 +0 ^0) General form of distributivity
GRP177 ( -2 +0 ^0) A consequence of monotonicity
GRP178 ( -2 +0 ^0) A consequence of monotonicity
GRP179 ( -3 +0 ^0) For converting between GLB and LUB
GRP180 ( -2 +0 ^0) Consequence of converting between GLB and LUB
GRP181 ( -4 +0 ^0) Distributivity of a lattice
GRP182 ( -4 +0 ^0) Positive part of the negative part is identity
GRP183 ( -4 +0 ^0) Orthogonal elements form a subgroup with orthogonal parts
GRP184 ( -4 +0 ^0) Orthogonal elements commute and form a subgroup
GRP185 ( -4 +0 ^0) Application of monotonicity and distributivity
GRP186 ( -4 +0 ^0) Application of distributivity and group theory
GRP187 ( -1 +0 ^0) Orthogonal elements commute
GRP188 ( -2 +0 ^0) Consequence of lattice theory
GRP189 ( -2 +0 ^0) Consequence of lattice theory
GRP190 ( -2 +0 ^0) Something useful for estimations
GRP191 ( -2 +0 ^0) Something useful for estimations
GRP192 ( -1 +0 ^0) Even elements implies trivial group
GRP193 ( -2 +0 ^0) A combination of distributivity and monotonicity
GRP194 ( -0 +1 ^0) In semigroups, a surjective homomorphism maps the zero
GRP195 ( -1 +0 ^0) In semigroups, xyy=yyx -> (uv)^4 = u^4v^4.
GRP196 ( -1 +0 ^0) In semigroups, xyyy=yyyx -> (uy)^9 = u^9v^9.
GRP197 ( -1 +0 ^0) In cancellative semigroups, xxxyy=yxxyx -> bbaaa = abaab.
GRP198 ( -1 +0 ^0) In cancellative semigroups, xyyyxy=yyyyxx -> babbba=aabbbb.
GRP199 ( -1 +0 ^0) Nilpotent CS satisfy the quotient condition.
GRP200 ( -1 +0 ^0) In Loops, Moufang-1 => Moufang-2.
GRP201 ( -1 +0 ^0) In Loops, Moufang-2 => Moufang-3.
GRP202 ( -1 +0 ^0) In Loops, Moufang-3 => Moufang-1.
GRP203 ( -1 +0 ^0) Left identity, left inverse, Moufang-3 => Moufang-2
GRP204 ( -1 +0 ^0) A non-basis for Moufang loops.
GRP205 ( -1 +0 ^0) In Loops, Moufang-3 => Moufang-4.
GRP206 ( -1 +0 ^0) In Loops, Moufang-4 => Moufang-1.
GRP207 ( -1 +0 ^0) Single non-axiom for group theory, in product & inverse
GRP208 ( -1 +0 ^0) An identity generated by HR, number 00335
GRP209 ( -1 +0 ^0) An identity generated by HR, number 00336
GRP210 ( -1 +0 ^0) An identity generated by HR, number 00348
GRP211 ( -1 +0 ^0) An identity generated by HR, number 00349
GRP212 ( -1 +0 ^0) An identity generated by HR, number 00360
GRP213 ( -1 +0 ^0) An identity generated by HR, number 00385
GRP214 ( -1 +0 ^0) An identity generated by HR, number 00387
GRP215 ( -1 +0 ^0) An identity generated by HR, number 00396
GRP216 ( -1 +0 ^0) An identity generated by HR, number 00407
GRP217 ( -1 +0 ^0) An identity generated by HR, number 00443
GRP218 ( -1 +0 ^0) An identity generated by HR, number 00446
GRP219 ( -1 +0 ^0) An identity generated by HR, number 00448
GRP220 ( -1 +0 ^0) An identity generated by HR, number 00450
GRP221 ( -1 +0 ^0) An identity generated by HR, number 00451
GRP222 ( -1 +0 ^0) An identity generated by HR, number 00453
GRP223 ( -1 +0 ^0) An identity generated by HR, number 00456
GRP224 ( -1 +0 ^0) An identity generated by HR, number 00457
GRP225 ( -1 +0 ^0) An identity generated by HR, number 00459
GRP226 ( -1 +0 ^0) An identity generated by HR, number 00460
GRP227 ( -1 +0 ^0) An identity generated by HR, number 00461
GRP228 ( -1 +0 ^0) An identity generated by HR, number 00462
GRP229 ( -1 +0 ^0) An identity generated by HR, number 00463
GRP230 ( -1 +0 ^0) An identity generated by HR, number 00466
GRP231 ( -1 +0 ^0) An identity generated by HR, number 00478
GRP232 ( -1 +0 ^0) An identity generated by HR, number 00512
GRP233 ( -1 +0 ^0) An identity generated by HR, number 00536
GRP234 ( -1 +0 ^0) An identity generated by HR, number 00574
GRP235 ( -1 +0 ^0) An identity generated by HR, number 00597
GRP236 ( -1 +0 ^0) An identity generated by HR, number 00602
GRP237 ( -1 +0 ^0) An identity generated by HR, number 00605
GRP238 ( -1 +0 ^0) An identity generated by HR, number 00606
GRP239 ( -1 +0 ^0) An identity generated by HR, number 00607
GRP240 ( -1 +0 ^0) An identity generated by HR, number 00638
GRP241 ( -1 +0 ^0) An identity generated by HR, number 00639
GRP242 ( -1 +0 ^0) An identity generated by HR, number 00702
GRP243 ( -1 +0 ^0) An identity generated by HR, number 00712
GRP244 ( -1 +0 ^0) An identity generated by HR, number 00713
GRP245 ( -1 +0 ^0) An identity generated by HR, number 00714
GRP246 ( -1 +0 ^0) An identity generated by HR, number 00715
GRP247 ( -1 +0 ^0) An identity generated by HR, number 00716
GRP248 ( -1 +0 ^0) An identity generated by HR, number 00717
GRP249 ( -1 +0 ^0) An identity generated by HR, number 00718
GRP250 ( -1 +0 ^0) An identity generated by HR, number 00719
GRP251 ( -1 +0 ^0) An identity generated by HR, number 00720
GRP252 ( -1 +0 ^0) An identity generated by HR, number 00721
GRP253 ( -1 +0 ^0) An identity generated by HR, number 00722
GRP254 ( -1 +0 ^0) An identity generated by HR, number 00723
GRP255 ( -1 +0 ^0) An identity generated by HR, number 00747
GRP256 ( -1 +0 ^0) An identity generated by HR, number 00799
GRP257 ( -1 +0 ^0) An identity generated by HR, number 00800
GRP258 ( -1 +0 ^0) An identity generated by HR, number 00802
GRP259 ( -1 +0 ^0) An identity generated by HR, number 00839
GRP260 ( -1 +0 ^0) An identity generated by HR, number 00925
GRP261 ( -1 +0 ^0) An identity generated by HR, number 00926
GRP262 ( -1 +0 ^0) An identity generated by HR, number 00951
GRP263 ( -1 +0 ^0) An identity generated by HR, number 01004
GRP264 ( -1 +0 ^0) An identity generated by HR, number 01099
GRP265 ( -1 +0 ^0) An identity generated by HR, number 01100
GRP266 ( -1 +0 ^0) An identity generated by HR, number 01104
GRP267 ( -1 +0 ^0) An identity generated by HR, number 01105
GRP268 ( -1 +0 ^0) An identity generated by HR, number 01106
GRP269 ( -1 +0 ^0) An identity generated by HR, number 01109
GRP270 ( -1 +0 ^0) An identity generated by HR, number 01179
GRP271 ( -1 +0 ^0) An identity generated by HR, number 01316
GRP272 ( -1 +0 ^0) An identity generated by HR, number 01392
GRP273 ( -1 +0 ^0) An identity generated by HR, number 01542
GRP274 ( -1 +0 ^0) An identity generated by HR, number 01608
GRP275 ( -1 +0 ^0) An identity generated by HR, number 01744
GRP276 ( -1 +0 ^0) An identity generated by HR, number 01746
GRP277 ( -1 +0 ^0) An identity generated by HR, number 01755
GRP278 ( -1 +0 ^0) An identity generated by HR, number 02518
GRP279 ( -1 +0 ^0) An identity generated by HR, number 02737
GRP280 ( -1 +0 ^0) An identity generated by HR, number 02916
GRP281 ( -1 +0 ^0) An identity generated by HR, number 02922
GRP282 ( -1 +0 ^0) An identity generated by HR, number 02924
GRP283 ( -1 +0 ^0) An identity generated by HR, number 02941
GRP284 ( -1 +0 ^0) An identity generated by HR, number 02999
GRP285 ( -1 +0 ^0) An identity generated by HR, number 03055
GRP286 ( -1 +0 ^0) An identity generated by HR, number 03163
GRP287 ( -1 +0 ^0) An identity generated by HR, number 03165
GRP288 ( -1 +0 ^0) An identity generated by HR, number 03168
GRP289 ( -1 +0 ^0) An identity generated by HR, number 03169
GRP290 ( -1 +0 ^0) An identity generated by HR, number 03227
GRP291 ( -1 +0 ^0) An identity generated by HR, number 03387
GRP292 ( -1 +0 ^0) An identity generated by HR, number 03445
GRP293 ( -1 +0 ^0) An identity generated by HR, number 03543
GRP294 ( -1 +0 ^0) An identity generated by HR, number 03545
GRP295 ( -1 +0 ^0) An identity generated by HR, number 03549
GRP296 ( -1 +0 ^0) An identity generated by HR, number 03605
GRP297 ( -1 +0 ^0) An identity generated by HR, number 03730
GRP298 ( -1 +0 ^0) An identity generated by HR, number 03742
GRP299 ( -1 +0 ^0) An identity generated by HR, number 03746
GRP300 ( -1 +0 ^0) An identity generated by HR, number 03748
GRP301 ( -1 +0 ^0) An identity generated by HR, number 03786
GRP302 ( -1 +0 ^0) An identity generated by HR, number 04549
GRP303 ( -1 +0 ^0) An identity generated by HR, number 04703
GRP304 ( -1 +0 ^0) An identity generated by HR, number 05204
GRP305 ( -1 +0 ^0) An identity generated by HR, number 05617
GRP306 ( -1 +0 ^0) An identity generated by HR, number 17237
GRP307 ( -1 +0 ^0) An identity generated by HR, number 17387
GRP308 ( -1 +0 ^0) An identity generated by HR, number 17388
GRP309 ( -1 +0 ^0) An identity generated by HR, number 17391
GRP310 ( -1 +0 ^0) An identity generated by HR, number 17399
GRP311 ( -1 +0 ^0) An identity generated by HR, number 17454
GRP312 ( -1 +0 ^0) An identity generated by HR, number 18125
GRP313 ( -1 +0 ^0) An identity generated by HR, number 18127
GRP314 ( -1 +0 ^0) An identity generated by HR, number 18186
GRP315 ( -1 +0 ^0) An identity generated by HR, number 18383
GRP316 ( -1 +0 ^0) An identity generated by HR, number 18432
GRP317 ( -1 +0 ^0) An identity generated by HR, number 18541
GRP318 ( -1 +0 ^0) An identity generated by HR, number 18617
GRP319 ( -1 +0 ^0) An identity generated by HR, number 18618
GRP320 ( -1 +0 ^0) An identity generated by HR, number 18620
GRP321 ( -1 +0 ^0) An identity generated by HR, number 18621
GRP322 ( -1 +0 ^0) An identity generated by HR, number 18627
GRP323 ( -1 +0 ^0) An identity generated by HR, number 18628
GRP324 ( -1 +0 ^0) An identity generated by HR, number 18630
GRP325 ( -1 +0 ^0) An identity generated by HR, number 18669
GRP326 ( -1 +0 ^0) An identity generated by HR, number 18694
GRP327 ( -1 +0 ^0) An identity generated by HR, number 18695
GRP328 ( -1 +0 ^0) An identity generated by HR, number 18700
GRP329 ( -1 +0 ^0) An identity generated by HR, number 18789
GRP330 ( -1 +0 ^0) An identity generated by HR, number 18793
GRP331 ( -1 +0 ^0) An identity generated by HR, number 18987
GRP332 ( -1 +0 ^0) An identity generated by HR, number 19000
GRP333 ( -1 +0 ^0) An identity generated by HR, number 19058
GRP334 ( -1 +0 ^0) An identity generated by HR, number 19095
GRP335 ( -1 +0 ^0) An identity generated by HR, number 19295
GRP336 ( -1 +0 ^0) An identity generated by HR, number 19511
GRP337 ( -1 +0 ^0) An identity generated by HR, number 19514
GRP338 ( -1 +0 ^0) An identity generated by HR, number 19518
GRP339 ( -1 +0 ^0) An identity generated by HR, number 19533
GRP340 ( -1 +0 ^0) An identity generated by HR, number 19567
GRP341 ( -1 +0 ^0) An identity generated by HR, number 19569
GRP342 ( -1 +0 ^0) An identity generated by HR, number 19583
GRP343 ( -1 +0 ^0) An identity generated by HR, number 19584
GRP344 ( -1 +0 ^0) An identity generated by HR, number 19587
GRP345 ( -1 +0 ^0) An identity generated by HR, number 19603
GRP346 ( -1 +0 ^0) An identity generated by HR, number 19604
GRP347 ( -1 +0 ^0) An identity generated by HR, number 19607
GRP348 ( -1 +0 ^0) An identity generated by HR, number 19633
GRP349 ( -1 +0 ^0) An identity generated by HR, number 19761
GRP350 ( -1 +0 ^0) An identity generated by HR, number 22551
GRP351 ( -1 +0 ^0) An identity generated by HR, number 22711
GRP352 ( -1 +0 ^0) An identity generated by HR, number 22712
GRP353 ( -1 +0 ^0) An identity generated by HR, number 22878
GRP354 ( -1 +0 ^0) An identity generated by HR, number 22891
GRP355 ( -1 +0 ^0) An identity generated by HR, number 22926
GRP356 ( -1 +0 ^0) An identity generated by HR, number 22946
GRP357 ( -1 +0 ^0) An identity generated by HR, number 23345
GRP358 ( -1 +0 ^0) An identity generated by HR, number 23528
GRP359 ( -1 +0 ^0) An identity generated by HR, number 23534
GRP360 ( -1 +0 ^0) An identity generated by HR, number 23564
GRP361 ( -1 +0 ^0) An identity generated by HR, number 23574
GRP362 ( -1 +0 ^0) An identity generated by HR, number 23870
GRP363 ( -1 +0 ^0) An identity generated by HR, number 24611
GRP364 ( -1 +0 ^0) An identity generated by HR, number 27037
GRP365 ( -1 +0 ^0) An identity generated by HR, number 27038
GRP366 ( -1 +0 ^0) An identity generated by HR, number 27075
GRP367 ( -1 +0 ^0) An identity generated by HR, number 27078
GRP368 ( -1 +0 ^0) An identity generated by HR, number 27097
GRP369 ( -1 +0 ^0) An identity generated by HR, number 27187
GRP370 ( -1 +0 ^0) An identity generated by HR, number 27192
GRP371 ( -1 +0 ^0) An identity generated by HR, number 27194
GRP372 ( -1 +0 ^0) An identity generated by HR, number 27631
GRP373 ( -1 +0 ^0) An identity generated by HR, number 27856
GRP374 ( -1 +0 ^0) An identity generated by HR, number 27861
GRP375 ( -1 +0 ^0) An identity generated by HR, number 28530
GRP376 ( -1 +0 ^0) An identity generated by HR, number 28643
GRP377 ( -1 +0 ^0) An identity generated by HR, number 28737
GRP378 ( -1 +0 ^0) An identity generated by HR, number 30775
GRP379 ( -1 +0 ^0) An identity generated by HR, number 35362
GRP380 ( -1 +0 ^0) An identity generated by HR, number 35444
GRP381 ( -1 +0 ^0) An identity generated by HR, number 35657
GRP382 ( -1 +0 ^0) An identity generated by HR, number 37018
GRP383 ( -1 +0 ^0) An identity generated by HR, number 37052
GRP384 ( -1 +0 ^0) An identity generated by HR, number 37124
GRP385 ( -1 +0 ^0) An identity generated by HR, number 37357
GRP386 ( -1 +0 ^0) An identity generated by HR, number 37389
GRP387 ( -1 +0 ^0) An identity generated by HR, number 37390
GRP388 ( -1 +0 ^0) An identity generated by HR, number 40940
GRP389 ( -1 +0 ^0) An identity generated by HR, number 45739
GRP390 ( -1 +0 ^0) An identity generated by HR, number 45740
GRP391 ( -1 +0 ^0) An identity generated by HR, number 45750
GRP392 ( -1 +0 ^0) Monoid axioms
GRP393 ( -2 +0 ^0) Semigroup axioms
GRP394 ( -3 +1 ^0) Group theory (equality) axioms
GRP395 ( -1 +0 ^0) Group theory (Named groups) axioms
GRP396 ( -0 +1 ^0) Group theory (Named Semigroups) axioms
GRP397 ( -1 +0 ^0) Cancellative semigroups axioms
GRP398 ( -3 +0 ^0) Subgroup axioms for the GRP003 group theory axioms
GRP399 ( -1 +0 ^0) Lattice ordered group (equality) axioms
GRP400 ( -1 +0 ^0) Prove associativity implies distribution in cancellative semigroup
GRP401 ( -1 +0 ^0) Prove distributivity implies nilpotent in cancellative semigroup
GRP402 ( -1 +0 ^0) Prove nilpotent implies associativity in cancellative semigroup
GRP403 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP404 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP405 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP406 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP407 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP408 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP409 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP410 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP411 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP412 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP413 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP414 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP415 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP416 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP417 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP418 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP419 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP420 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP421 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP422 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP423 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP424 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP425 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP426 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP427 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP428 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP429 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP430 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP431 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP432 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP433 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP434 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP435 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP436 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP437 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP438 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP439 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP440 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP441 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP442 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 1
GRP443 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 2
GRP444 ( -1 +0 ^0) Axiom for group theory, in product & inverse, part 3
GRP445 ( -1 +0 ^0) Axiom for group theory, in division, part 1
GRP446 ( -1 +0 ^0) Axiom for group theory, in division, part 2
GRP447 ( -1 +0 ^0) Axiom for group theory, in division, part 3
GRP448 ( -1 +0 ^0) Axiom for group theory, in division, part 1
GRP449 ( -1 +0 ^0) Axiom for group theory, in division, part 2
GRP450 ( -1 +0 ^0) Axiom for group theory, in division, part 3
GRP451 ( -1 +0 ^0) Axiom for group theory, in division, part 1
GRP452 ( -1 +0 ^0) Axiom for group theory, in division, part 2
GRP453 ( -1 +0 ^0) Axiom for group theory, in division, part 3
GRP454 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 1
GRP455 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 2
GRP456 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 3
GRP457 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 1
GRP458 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 2
GRP459 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 3
GRP460 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 1
GRP461 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 2
GRP462 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 3
GRP463 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 1
GRP464 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 2
GRP465 ( -1 +0 ^0) Axiom for group theory, in division and identity, part 3
GRP466 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 1
GRP467 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 2
GRP468 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 3
GRP469 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 1
GRP470 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 2
GRP471 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 3
GRP472 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 1
GRP473 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 2
GRP474 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 3
GRP475 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 1
GRP476 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 2
GRP477 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 3
GRP478 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 1
GRP479 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 2
GRP480 ( -1 +0 ^0) Axiom for group theory, in division and inverse, part 3
GRP481 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP482 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP483 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP484 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP485 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP486 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP487 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP488 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP489 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP490 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP491 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP492 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP493 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP494 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP495 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP496 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 1
GRP497 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 2
GRP498 ( -1 +0 ^0) Axiom for group theory, in double division and identity, part 3
GRP499 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 1
GRP500 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 2
GRP501 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 3
GRP502 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 1
GRP503 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 2
GRP504 ( -1 +0 ^0) Axiom for group theory, in double division and inverse, part 3
GRP505 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 1
GRP506 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 2
GRP507 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 3
GRP508 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 4
GRP509 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 1
GRP510 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 2
GRP511 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 3
GRP512 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 4
GRP513 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 1
GRP514 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 2
GRP515 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 3
GRP516 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 4
GRP517 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 1
GRP518 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 2
GRP519 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 3
GRP520 ( -1 +0 ^0) Axiom for Abelian group theory, in product and inverse, part 4
GRP521 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 1
GRP522 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 2
GRP523 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 3
GRP524 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 4
GRP525 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 1
GRP526 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 2
GRP527 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 3
GRP528 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 4
GRP529 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 1
GRP530 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 2
GRP531 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 3
GRP532 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 4
GRP533 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 1
GRP534 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 2
GRP535 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 3
GRP536 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 4
GRP537 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 1
GRP538 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 2
GRP539 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 3
GRP540 ( -1 +0 ^0) Axiom for Abelian group theory, in division, part 4
GRP541 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 1
GRP542 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 2
GRP543 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 3
GRP544 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 4
GRP545 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 1
GRP546 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 2
GRP547 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 3
GRP548 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 4
GRP549 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 1
GRP550 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 2
GRP551 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 3
GRP552 ( -1 +0 ^0) Axiom for Abelian group theory, in division and identity, part 4
GRP553 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 1
GRP554 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 2
GRP555 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 3
GRP556 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 4
GRP557 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 1
GRP558 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 2
GRP559 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 3
GRP560 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 4
GRP561 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 1
GRP562 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 2
GRP563 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 3
GRP564 ( -1 +0 ^0) Axiom for Abelian group theory, in division and inverse, part 4
GRP565 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 1
GRP566 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 2
GRP567 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 3
GRP568 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 4
GRP569 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 1
GRP570 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 2
GRP571 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 3
GRP572 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 4
GRP573 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 1
GRP574 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 2
GRP575 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 3
GRP576 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 4
GRP577 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 1
GRP578 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 2
GRP579 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 3
GRP580 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 4
GRP581 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 1
GRP582 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 2
GRP583 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 3
GRP584 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and id, part 4
GRP585 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP586 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP587 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP588 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP589 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP590 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP591 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP592 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP593 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP594 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP595 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP596 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP597 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP598 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP599 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP600 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP601 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP602 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP603 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP604 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP605 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP606 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP607 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP608 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP609 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP610 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP611 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP612 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP613 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 1
GRP614 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 2
GRP615 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 3
GRP616 ( -1 +0 ^0) Axiom for Abelian group theory, in double div and inv, part 4
GRP617 ( -1 +0 ^0) PQEx lemma
GRP618 ( -0 +4 ^0) On the Group of Inner Automorphisms T01
GRP619 ( -0 +4 ^0) On the Group of Inner Automorphisms T03
GRP620 ( -0 +4 ^0) On the Group of Inner Automorphisms T07
GRP621 ( -0 +4 ^0) On the Group of Inner Automorphisms T08
GRP622 ( -0 +4 ^0) On the Group of Inner Automorphisms T12
GRP623 ( -0 +4 ^0) On the Group of Inner Automorphisms T14
GRP624 ( -0 +4 ^0) On the Group of Inner Automorphisms T15
GRP625 ( -0 +4 ^0) On the Group of Inner Automorphisms T16
GRP626 ( -0 +4 ^0) On the Group of Inner Automorphisms T17
GRP627 ( -0 +4 ^0) On the Group of Inner Automorphisms T18
GRP628 ( -0 +4 ^0) On the Group of Inner Automorphisms T22
GRP629 ( -0 +4 ^0) On the Group of Inner Automorphisms T26
GRP630 ( -0 +4 ^0) On the Group of Inner Automorphisms T28
GRP631 ( -0 +4 ^0) On the Group of Inner Automorphisms T29
GRP632 ( -0 +4 ^0) On the Group of Inner Automorphisms T30
GRP633 ( -0 +4 ^0) On the Group of Inner Automorphisms T31
GRP634 ( -0 +4 ^0) On the Group of Inner Automorphisms T32
GRP635 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T06
GRP636 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T07
GRP637 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T10
GRP638 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T11
GRP639 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T12
GRP640 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T13
GRP641 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T19
GRP642 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T20
GRP643 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T21
GRP644 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T22
GRP645 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T24
GRP646 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T25
GRP647 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T26
GRP648 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T31
GRP649 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T32
GRP650 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T33
GRP651 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T34
GRP652 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T35
GRP653 ( -0 +4 ^0) On the Lattice of Subgroups of a Group T38
-------------------------------------------------------------------------------
Domain HAL = Homological Alg.
9 problems (6 abstract, 0 CNF, 9 FOF, 0 THF)
-------------------------------------------------------------------------------
HAL001 ( -0 +2 ^0) Short Five Lemma, Part 1
HAL002 ( -0 +1 ^0) Equivalence of injection axioms
HAL003 ( -0 +3 ^0) Short Five Lemma, Part 2
HAL004 ( -0 +1 ^0) Lemma for the short Five Lemma, Part 2
HAL005 ( -0 +1 ^0) Lemma for the short Five Lemma, Part 2
HAL006 ( -0 +1 ^0) Lemma for the short Five Lemma, Part 2
-------------------------------------------------------------------------------
Domain HEN = Henkin Models.
67 problems (13 abstract, 67 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
HEN001 ( -3 +0 ^0) X/identity = zero
HEN002 ( -5 +0 ^0) zero/X = zero
HEN003 ( -5 +0 ^0) X/X = zero
HEN004 ( -6 +0 ^0) X/zero = X
HEN005 ( -6 +0 ^0) The relation less_equal is transitive
HEN006 ( -7 +0 ^0) X/Y <= Z => X/Z <= Y
HEN007 ( -6 +0 ^0) X <= Y => Z/Y <= Z/X
HEN008 ( -6 +0 ^0) X <= Y => X/Z <= Y/Z
HEN009 ( -6 +0 ^0) Define X' as identity/X. Then X' = X'''
HEN010 ( -7 +0 ^0) Define X' as identity/X. Then X' = X'/(identity/X')
HEN011 ( -5 +0 ^0) This operation is commutative
HEN012 ( -2 +0 ^0) X <= X
HEN013 ( -3 +0 ^0) Henkin model axioms
-------------------------------------------------------------------------------
Domain HWC = Hardware Creation.
6 problems (4 abstract, 6 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
HWC001 ( -1 +0 ^0) Design an OR gate using NAND gates
HWC002 ( -1 +0 ^0) Interchange inputs to outputs
HWC003 ( -2 +0 ^0) Invert 3 inputs with 2 not gates
HWC004 ( -2 +0 ^0) Definitions of AND, OR and NOT
-------------------------------------------------------------------------------
Domain HWV = Hardware Verification.
83 problems (38 abstract, 83 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
HWV001 ( -1 +0 ^0) Interchange inputs to outputs
HWV002 ( -1 +0 ^0) Invert 3 inputs with 2 not gates
HWV003 ( -3 +0 ^0) One bit Full Adder
HWV004 ( -1 +0 ^0) Two bit Full Adder
HWV005 ( -2 +0 ^0) A halfadder built from and, or and not gates
HWV006 ( -2 +0 ^0) A fulladder built from two halfadders and an or gate
HWV007 ( -2 +0 ^0) A fulladder built from two halfadders and an or gate
HWV008 ( -4 +0 ^0) 1 bit ripple carry adder
HWV009 ( -4 +0 ^0) Safelogic VHDL design verification obligation
HWV010 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV011 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV012 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV013 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV014 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV015 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV016 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV017 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV018 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV019 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV020 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV021 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV022 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV023 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV024 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV025 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV026 ( -3 +0 ^0) Safelogic VHDL design verification obligation
HWV027 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV028 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV029 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV030 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV031 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV032 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV033 ( -2 +0 ^0) Safelogic VHDL design verification obligation
HWV034 ( -2 +0 ^0) Connections, faults, and gates.
HWV035 ( -2 +0 ^0) Half-adder.
HWV036 ( -2 +0 ^0) Full-adder.
HWV037 ( -1 +0 ^0) Axioms from a VHDL design description
HWV038 ( -1 +0 ^0) Axioms from a VHDL design description
-------------------------------------------------------------------------------
Domain KRS = Knowledge Representation.
175 problems (175 abstract, 17 CNF, 158 FOF, 0 THF)
-------------------------------------------------------------------------------
KRS001 ( -1 +0 ^0) Paramasivam problem T-Box 1a
KRS002 ( -1 +0 ^0) Paramasivam problem T-Box 1b
KRS003 ( -1 +0 ^0) Paramasivam problem T-Box 1c
KRS004 ( -1 +0 ^0) Paramasivam problem T-Box 1d
KRS005 ( -1 +0 ^0) Paramasivam problem T-Box 2a
KRS006 ( -1 +0 ^0) Paramasivam problem T-Box 2b
KRS007 ( -1 +0 ^0) Paramasivam problem T-Box 3a
KRS008 ( -1 +0 ^0) Paramasivam problem T-Box 3b
KRS009 ( -1 +0 ^0) Paramasivam problem T-Box 3c
KRS010 ( -1 +0 ^0) Paramasivam problem T-Box 3d
KRS011 ( -1 +0 ^0) Paramasivam problem T-Box 3e
KRS012 ( -1 +0 ^0) Paramasivam problem T-Box 4a
KRS013 ( -1 +0 ^0) Paramasivam problem T-Box 4b
KRS014 ( -1 +0 ^0) Paramasivam problem T-Box 5a
KRS015 ( -1 +0 ^0) Paramasivam problem T-Box 5b
KRS016 ( -1 +0 ^0) Paramasivam problem T-Box 5c
KRS017 ( -1 +0 ^0) Paramasivam problem T-Box 7a
KRS018 ( -0 +1 ^0) Nothing can be defined using OWL Lite restrictions
KRS019 ( -0 +1 ^0) The complement of a class can be defined using OWL Lite 
KRS020 ( -0 +1 ^0) The union of two classes can be defined using OWL Lite 
KRS021 ( -0 +1 ^0) Informal semantics for RDF container are not respected by OWL
KRS022 ( -0 +1 ^0) Informal semantics for RDF container are not respected by OWL
KRS023 ( -0 +1 ^0) A minimal OWL Lite version of I5.3-005
KRS024 ( -0 +1 ^0) An OWL Lite version of I5.3-007
KRS025 ( -0 +1 ^0) Classes can be the object of annotation properties
KRS026 ( -0 +1 ^0) The extension of OWL Thing may be a singleton in OWL DL
KRS027 ( -0 +1 ^0) An example of use
KRS028 ( -0 +1 ^0) DL Test: fact4.2
KRS029 ( -0 +1 ^0) DL Test: t1.1
KRS030 ( -0 +1 ^0) DL Test: t10.1
KRS031 ( -0 +1 ^0) DL Test: t2.1
KRS032 ( -0 +1 ^0) DL Test: t3.1
KRS033 ( -0 +1 ^0) DL Test: t3a.1
KRS034 ( -0 +1 ^0) DL Test: t3a.2
KRS035 ( -0 +1 ^0) DL Test: t5.1 Non-finite model example from paper
KRS036 ( -0 +1 ^0) DL Test: t5f.1 Non-finite model example from paper
KRS037 ( -0 +1 ^0) DL Test: t7.1
KRS038 ( -0 +1 ^0) DL Test: t7f.1
KRS039 ( -0 +1 ^0) DL Test: t8.1
KRS040 ( -0 +1 ^0) Example of use
KRS041 ( -0 +1 ^0) A different encoding of description-logic-501
KRS042 ( -0 +1 ^0) DL Test: fact4.2
KRS043 ( -0 +1 ^0) DL Test: t1.1
KRS044 ( -0 +1 ^0) DL Test: t10.1
KRS045 ( -0 +1 ^0) DL Test: t2.1
KRS046 ( -0 +1 ^0) DL Test: t5.1 Non-finite model example from paper
KRS047 ( -0 +1 ^0) DL Test: t5f.1 Non-finite model example from paper
KRS048 ( -0 +1 ^0) DL Test: t7.1
KRS049 ( -0 +1 ^0) DL Test: t7f.1
KRS050 ( -0 +1 ^0) DL Test: t8.1
KRS051 ( -0 +1 ^0) Integer multiplication in OWL DL
KRS052 ( -0 +1 ^0) Integer multiplication in OWL DL, interacting with infinity
KRS053 ( -0 +1 ^0) owl:disjointWith edges may be within OWL DL
KRS054 ( -0 +1 ^0) owl:disjointWith edges may be within OWL DL
KRS055 ( -0 +1 ^0) owl:disjointWith edges may be within OWL DL
KRS056 ( -0 +1 ^0) owl:disjointWith edges may be within OWL DL
KRS057 ( -0 +1 ^0) A possible mapping of the EquivalentClasses axiom
KRS058 ( -0 +1 ^0) A simple test for infinite loops in imports processing code
KRS059 ( -0 +1 ^0) Abstract syntax restrictions with multiple components
KRS060 ( -0 +1 ^0) Description cannot be expressed as a multicomponent restriction 
KRS061 ( -0 +1 ^0) User labels in a variety of languages with ruby annotation
KRS062 ( -0 +1 ^0) dc:creator may be declared as an annotation property
KRS063 ( -0 +1 ^0) An example combining owl:oneOf and owl:inverseOf
KRS064 ( -0 +1 ^0) Something of type owl:Nothing
KRS065 ( -0 +1 ^0) The syntax for using the same restriction twice in OWL Lite
KRS066 ( -0 +1 ^0) The extension of OWL Thing may not be emtpy in OWL Lite
KRS067 ( -0 +1 ^0) DL Test: fact1.1
KRS068 ( -0 +1 ^0) DL Test: fact2.1
KRS069 ( -0 +1 ^0) DL Test: fact3.1
KRS070 ( -0 +1 ^0) DL Test: fact4.1
KRS071 ( -0 +1 ^0) DL Test: t1.2
KRS072 ( -0 +1 ^0) DL Test: t1.3
KRS073 ( -0 +1 ^0) DL Test: t10.2
KRS074 ( -0 +1 ^0) DL Test: t10.3
KRS075 ( -0 +1 ^0) DL Test: t10.4
KRS076 ( -0 +1 ^0) DL Test: t10.5
KRS077 ( -0 +1 ^0) DL Test: t11.1
KRS078 ( -0 +1 ^0) DL Test: t12.1
KRS079 ( -0 +1 ^0) DL Test: t2.2
KRS080 ( -0 +1 ^0) DL Test: t3.2
KRS081 ( -0 +1 ^0) DL Test: t3a.3
KRS082 ( -0 +1 ^0) DL Test: t4.1 Dynamic blocking example
KRS083 ( -0 +1 ^0) DL Test: t6.1 Double blocking example
KRS084 ( -0 +1 ^0) DL Test: t6f.1 Double blocking example
KRS085 ( -0 +1 ^0) DL Test: t7.2
KRS086 ( -0 +1 ^0) DL Test: t7.3
KRS087 ( -0 +1 ^0) DL Test: t7f.2
KRS088 ( -0 +1 ^0) DL Test: t7f.3
KRS089 ( -0 +1 ^0) A test for the interaction of one-of and inverse 
KRS090 ( -0 +1 ^0) A pattern comes up a lot in more complex ontologies
KRS091 ( -0 +1 ^0) DL Test: heinsohn1.1
KRS092 ( -0 +1 ^0) DL Test: heinsohn1.2
KRS093 ( -0 +1 ^0) DL Test: heinsohn1.3
KRS094 ( -0 +1 ^0) DL Test: heinsohn1.4
KRS095 ( -0 +1 ^0) DL Test: heinsohn2.1
KRS096 ( -0 +1 ^0) DL Test: heinsohn2.2
KRS097 ( -0 +1 ^0) DL Test: heinsohn3.1
KRS098 ( -0 +1 ^0) DL Test: heinsohn3.2
KRS099 ( -0 +1 ^0) DL Test: heinsohn3c.1
KRS100 ( -0 +1 ^0) DL Test: heinsohn4.1
KRS101 ( -0 +1 ^0) DL Test: heinsohn4.2
KRS102 ( -0 +1 ^0) This is the classic 3 SAT problem
KRS103 ( -0 +1 ^0) A different encoding of description-logic-502
KRS104 ( -0 +1 ^0) DL Test: fact1.1
KRS105 ( -0 +1 ^0) DL Test: fact2.1
KRS106 ( -0 +1 ^0) DL Test: fact3.1
KRS107 ( -0 +1 ^0) DL Test: fact4.1
KRS108 ( -0 +1 ^0) DL Test: t1.3
KRS109 ( -0 +1 ^0) DL Test: t10.2
KRS110 ( -0 +1 ^0) DL Test: t10.3
KRS111 ( -0 +1 ^0) DL Test: t10.4
KRS112 ( -0 +1 ^0) DL Test: t10.5
KRS113 ( -0 +1 ^0) DL Test: t11.1
KRS114 ( -0 +1 ^0) DL Test: t12.1
KRS115 ( -0 +1 ^0) DL Test: t2.2
KRS116 ( -0 +1 ^0) DL Test: t4.1 Dynamic blocking example
KRS117 ( -0 +1 ^0) DL Test: t6.1 Double blocking example
KRS118 ( -0 +1 ^0) DL Test: t6f.1 Double blocking example
KRS119 ( -0 +1 ^0) DL Test: t7.2
KRS120 ( -0 +1 ^0) DL Test: t7.3
KRS121 ( -0 +1 ^0) DL Test: t7f.2
KRS122 ( -0 +1 ^0) DL Test: t7f.3
KRS123 ( -0 +1 ^0) DL Test: heinsohn1.1
KRS124 ( -0 +1 ^0) DL Test: heinsohn1.2
KRS125 ( -0 +1 ^0) DL Test: heinsohn1.3
KRS126 ( -0 +1 ^0) DL Test: heinsohn1.4
KRS127 ( -0 +1 ^0) DL Test: heinsohn2.2
KRS128 ( -0 +1 ^0) DL Test: heinsohn4.1
KRS129 ( -0 +1 ^0) An example combinging owl:oneOf and owl:inverseOf
KRS130 ( -0 +1 ^0) owl:Nothing can be defined using OWL Lite restrictions
KRS131 ( -0 +1 ^0) The complement of a class can be defined
KRS132 ( -0 +1 ^0) The union of two classes can be defined
KRS133 ( -0 +1 ^0) How to express mutual disjointness between classes
KRS134 ( -0 +1 ^0) This is a typical definition of range from description logic
KRS135 ( -0 +1 ^0) This is a typical definition of range from description logic
KRS136 ( -0 +1 ^0) Some set theory
KRS137 ( -0 +1 ^0) A variation of equivalentClass-001
KRS138 ( -0 +1 ^0) Extensional semantics of owl:SymmetricProperty
KRS139 ( -0 +1 ^0) A Lite version of test SymmetricProperty-001
KRS140 ( -0 +1 ^0) Test illustrating extensional semantics of owl:TransitiveProperty
KRS141 ( -0 +1 ^0) A simple example
KRS142 ( -0 +1 ^0) An owl:cardinality constraint is simply shorthand
KRS143 ( -0 +1 ^0) An owl:cardinality constraint is simply shorthand
KRS144 ( -0 +1 ^0) An owl:cardinality constraint is simply shorthand
KRS145 ( -0 +1 ^0) An owl:cardinality constraint is simply shorthand
KRS146 ( -0 +1 ^0) DL Test: k_branch ABox test from DL98 systems comparison
KRS147 ( -0 +1 ^0) DL Test: k_d4 ABox test from DL98 systems comparison
KRS148 ( -0 +1 ^0) DL Test: k_dum ABox test from DL98 systems comparison
KRS149 ( -0 +1 ^0) DL Test: k_grz ABox test from DL98 systems comparison
KRS150 ( -0 +1 ^0) DL Test: k_lin ABox test from DL98 systems comparison
KRS151 ( -0 +1 ^0) DL Test: k_path ABox test from DL98 systems comparison
KRS152 ( -0 +1 ^0) DL Test: k_ph ABox test from DL98 systems comparison
KRS153 ( -0 +1 ^0) DL Test: k_poly ABox test from DL98 systems comparison
KRS154 ( -0 +1 ^0) DL Test: k_branch ABox test from DL98 systems comparison
KRS155 ( -0 +1 ^0) DL Test: k_d4 ABox test from DL98 systems comparison
KRS156 ( -0 +1 ^0) DL Test: k_dum ABox test from DL98 systems comparison
KRS157 ( -0 +1 ^0) ABox test from DL98 systems comparison
KRS158 ( -0 +1 ^0) DL Test: k_lin ABox test from DL98 systems comparison
KRS159 ( -0 +1 ^0) DL Test: k_path ABox test from DL98 systems comparison
KRS160 ( -0 +1 ^0) DL Test: k_ph ABox test from DL98 systems comparison
KRS161 ( -0 +1 ^0) DL Test: k_poly ABox test from DL98 systems comparison
KRS162 ( -0 +1 ^0) Entailment for three natural numbers
KRS163 ( -0 +1 ^0) Disjoint classes have different members
KRS164 ( -0 +1 ^0) Two classes may have the same class extension
KRS165 ( -0 +1 ^0) Two classes may be different names for the same set of individuals
KRS166 ( -0 +1 ^0) Two classes may be different names for the same set of individuals
KRS167 ( -0 +1 ^0) Two classes with the same complete description are equivalent
KRS168 ( -0 +1 ^0) De Morgan's law
KRS169 ( -0 +1 ^0) hasLeader may be stated as the owl:equivalentProperty of hasHead
KRS170 ( -0 +1 ^0) Deduction from hasLeader
KRS171 ( -0 +1 ^0) The inverse entailment of test 002 also holds
KRS172 ( -0 +1 ^0) The same property extension means equivalentProperty
KRS173 ( -0 +1 ^0) A simple infinite loop for implementors to avoid
KRS174 ( -0 +1 ^0) Sets with appropriate extensions are related by unionOf
KRS175 ( -0 +1 ^0) An inverse to test unionOf-003
-------------------------------------------------------------------------------
Domain LAT = Lattices.
707 problems (380 abstract, 310 CNF, 397 FOF, 0 THF)
-------------------------------------------------------------------------------
LAT001 ( -1 +0 ^0) If X' = U v V and Y' = U ^ V, then U' = X v (Y ^ V)
LAT002 ( -1 +0 ^0) If X' = U v V and Y' = U ^ V, then U' exists
LAT003 ( -1 +0 ^0) A fairly complex equation to establish
LAT004 ( -1 +0 ^0) A fairly complex equation to establish
LAT005 ( -6 +0 ^0) SAM's lemma
LAT006 ( -1 +0 ^0) Sholander's basis for distributive lattices, part 2 (of 6).
LAT007 ( -1 +0 ^0) Sholander's basis for distributive lattices, part 5 (of 6).
LAT008 ( -1 +0 ^0) Sholander's basis for distributive lattices, part 5 (of 6).
LAT009 ( -1 +0 ^0) A self-dual form of distributivity for lattice theory.
LAT010 ( -1 +0 ^0) McKenzie's basis for the variety generated by N5.
LAT011 ( -1 +0 ^0) Uniqueness of meet (dually join) in lattice theory
LAT012 ( -1 +0 ^0) McKenzie's 4-basis for lattice theory, part 1 (of 3)
LAT013 ( -1 +0 ^0) McKenzie's 4-basis for lattice theory, part 2 (of 3)
LAT014 ( -1 +0 ^0) McKenzie's 4-basis for lattice theory, part 3 (of 3)
LAT015 ( -1 +0 ^0) Single axiom for lattice theory
LAT016 ( -1 +0 ^0) E1 fails for Ortholattices.
LAT017 ( -1 +0 ^0) E2 holds in Ortholattices.
LAT018 ( -1 +0 ^0) E3 holds in Ortholattices.
LAT019 ( -1 +0 ^0) In quasilattices, a distributive law implies its dual.
LAT020 ( -1 +0 ^0) Self-dual distributivity for quasilattices.
LAT021 ( -1 +0 ^0) Bowden's inequality gives distributivity in lattice theory.
LAT022 ( -1 +0 ^0) Self-dual modularity for quasilattices.
LAT023 ( -1 +0 ^0) Yet another modularity equation for quasilattices.
LAT024 ( -1 +0 ^0) Meet (dually join) is not necessarily unique for quasilattices.
LAT025 ( -1 +0 ^0) Non-uniqueness of meet (dually join) in TNL
LAT026 ( -1 +0 ^0) WAL + absorption gives LT, part 1.
LAT027 ( -1 +0 ^0) WAL + absorption gives LT, part 2.
LAT028 ( -1 +0 ^0) Uniqueness of meet (dually join) in WAL
LAT029 ( -1 +0 ^0) Absorption basis for WAL
LAT030 ( -1 +0 ^0) Single axiom for weakly associative lattices (WAL)
LAT031 ( -1 +0 ^0) Distributivity of meet implies distributivity of join
LAT032 ( -1 +0 ^0) Distributivity of join implies distributivity of meet 
LAT033 ( -1 +0 ^0) Idempotency of join
LAT034 ( -1 +0 ^0) Idempotency of meet
LAT035 ( -1 +0 ^0) Composition to form a join hemimorphism
LAT036 ( -1 +0 ^0) Property of a distributive lattive with an antimorphism
LAT037 ( -1 +0 ^0) Uniqueness of complement
LAT038 ( -1 +0 ^0) Simplification rule in a distributive lattice
LAT039 ( -2 +0 ^0) Every distributive lattice is modular
LAT040 ( -1 +0 ^0) Another simplification rule for distributive lattices
LAT041 ( -1 +0 ^0) A hyperbase for type <2,2> lattice hyperidentities
LAT042 ( -1 +0 ^0) Lattice modularity from Boolean algebra
LAT043 ( -1 +0 ^0) Lattice compatability from Boolean algebra
LAT044 ( -1 +0 ^0) Lattice weak orthomodular law from orthomodular lattice
LAT045 ( -1 +0 ^0) Lattice orthomodular law from modular lattice
LAT046 ( -1 +0 ^0) Modular ortholattice is not Boolean algebra
LAT047 ( -1 +0 ^0) Lattice is not modular lattice
LAT048 ( -1 +0 ^0) Weakly orthomodular lattice is not orthomodular lattice
LAT049 ( -1 +0 ^0) Ortholattice is not weakly orthomodular lattice
LAT050 ( -1 +0 ^0) Orthomodular lattice is not modular lattice
LAT051 ( -1 +0 ^0) Lattice is not ortholattice
LAT052 ( -1 +0 ^0) Modular lattice is not modular ortholattice
LAT053 ( -1 +0 ^0) Countermodel for Megill equation for weakly orthomodular lattices
LAT054 ( -1 +0 ^0) Countermodel for Megill equation for ortholattices
LAT055 ( -2 +0 ^0) Lattice theory axioms
LAT056 ( -1 +0 ^0) Lattice theory modularity (equality) axioms
LAT057 ( -1 +0 ^0) Lattice theory complement (equality) axioms
LAT058 ( -1 +0 ^0) Lattice theory unique complement (equality) axioms
LAT059 ( -1 +0 ^0) Ortholattice theory (equality) axioms
LAT060 ( -1 +0 ^0) Quasilattice theory (equality) axioms
LAT061 ( -1 +0 ^0) Weakly Associative Lattices theory (equality) axioms
LAT062 ( -1 +0 ^0) E51 does not necessarily hold in ortholattices
LAT063 ( -1 +0 ^0) E62 does not necessarily hold in ortholattices
LAT064 ( -1 +0 ^0) Weak property 94-6 to make a uniquely complemented lattice Boolean
LAT065 ( -1 +0 ^0) Weak property 94-37 to make uniquely complemented lattice Boolean
LAT066 ( -1 +0 ^0) Weak property G61 to make a uniquely complemented lattice Boolean
LAT067 ( -1 +0 ^0) Weak property 94-3 to make a uniquely complemented lattice Boolean
LAT068 ( -1 +0 ^0) Weak property F53 to make a uniquely complemented lattice Boolean
LAT069 ( -1 +0 ^0) Weak property G113 to make a uniquely complemented lattice Boolean
LAT070 ( -1 +0 ^0) Given single axiom OL-23A, prove associativity
LAT071 ( -1 +0 ^0) Given single axiom OML-21C, prove associativity
LAT072 ( -1 +0 ^0) Given single axiom OML-23A, prove associativity
LAT073 ( -1 +0 ^0) Given single axiom MOL-23C, prove modularity
LAT074 ( -1 +0 ^0) Given single axiom MOL-25A, prove associativity
LAT075 ( -1 +0 ^0) Given single axiom MOL-25A, prove modularity
LAT076 ( -1 +0 ^0) Given single axiom MOL-27B1, prove associativity
LAT077 ( -1 +0 ^0) Given single axiom MOL-27B1, prove modularity
LAT078 ( -1 +0 ^0) Given single axiom MOL-27B2, prove associativity
LAT079 ( -1 +0 ^0) Given single axiom MOL-27B2, prove modularity
LAT080 ( -1 +0 ^0) Axiom for lattice theory, part 1
LAT081 ( -1 +0 ^0) Axiom for lattice theory, part 2
LAT082 ( -1 +0 ^0) Axiom for lattice theory, part 3
LAT083 ( -1 +0 ^0) Axiom for lattice theory, part 4
LAT084 ( -1 +0 ^0) Axiom for lattice theory, part 5
LAT085 ( -1 +0 ^0) Axiom for lattice theory, part 6
LAT086 ( -1 +0 ^0) Axiom for lattice theory, part 7
LAT087 ( -1 +0 ^0) Axiom for lattice theory, part 8
LAT088 ( -1 +0 ^0) Absorption basis for WAL, part 1
LAT089 ( -1 +0 ^0) Absorption basis for WAL, part 2
LAT090 ( -1 +0 ^0) Absorption basis for WAL, part 3
LAT091 ( -1 +0 ^0) Absorption basis for WAL, part 4
LAT092 ( -1 +0 ^0) Axiom for weakly associative lattices (WAL), part 1
LAT093 ( -1 +0 ^0) Axiom for weakly associative lattices (WAL), part 2
LAT094 ( -1 +0 ^0) Axiom for weakly associative lattices (WAL), part 3
LAT095 ( -1 +0 ^0) Axiom for weakly associative lattices (WAL), part 4
LAT096 ( -1 +0 ^0) Axiom for weakly associative lattices (WAL), part 5
LAT097 ( -1 +0 ^0) Single axiom for weakly associative lattices (WAL), part 6
LAT098 ( -1 +0 ^0) Huntington equation H3 is independent of H2
LAT099 ( -1 +0 ^0) Huntington equation H2 is independent of H3
LAT100 ( -1 +0 ^0) Huntington equation H4 is independent of H6
LAT101 ( -1 +0 ^0) Huntington equation H10 is independent of H6
LAT102 ( -1 +0 ^0) Huntington equation H4 is independent of H7
LAT103 ( -1 +0 ^0) Huntington equation H6 is independent of H10
LAT104 ( -1 +0 ^0) Huntington equation H3 is independent of H21
LAT105 ( -1 +0 ^0) Huntington equation H10 is independent of H21
LAT106 ( -1 +0 ^0) Huntington equation H3 is independent of H22
LAT107 ( -1 +0 ^0) Huntington equation H17 is independent of H22
LAT108 ( -1 +0 ^0) Huntington equation H42 is independent of H31
LAT109 ( -1 +0 ^0) Huntington equation H40 is independent of H37
LAT110 ( -1 +0 ^0) Huntington equation H42 is independent of H37
LAT111 ( -1 +0 ^0) Huntington equation H40 is independent of H45
LAT112 ( -1 +0 ^0) Huntington equation H42 is independent of H47
LAT113 ( -1 +0 ^0) Huntington equation H40 is independent of H50
LAT114 ( -1 +0 ^0) Huntington equation H56 is independent of H55
LAT115 ( -1 +0 ^0) Huntington equation H59 is independent of H55
LAT116 ( -1 +0 ^0) Huntington equation H60 is independent of H55
LAT117 ( -1 +0 ^0) Huntington equation H69 is independent of H65
LAT118 ( -1 +0 ^0) Huntington equation H69 is independent of H79
LAT119 ( -1 +0 ^0) Huntington equation H3 is independent of H82
LAT120 ( -1 +0 ^0) Huntington equation H58 is independent of H10_dual
LAT121 ( -1 +0 ^0) Huntington equation H55 is independent of H18_dual
LAT122 ( -1 +0 ^0) Huntington equation H55 is independent of H21_dual
LAT123 ( -1 +0 ^0) Huntington equation H55 is independent of H22_dual
LAT124 ( -1 +0 ^0) Huntington equation H69 is independent of H32_dual
LAT125 ( -1 +0 ^0) Huntington equation H69 is independent of H34_dual
LAT126 ( -1 +0 ^0) Huntington equation H69 is independent of H39_dual
LAT127 ( -1 +0 ^0) Huntington equation H6 is independent of H55_dual
LAT128 ( -1 +0 ^0) Huntington equation H3 is independent of H58_dual
LAT129 ( -1 +0 ^0) Huntington equation H10 is independent of H58_dual
LAT130 ( -1 +0 ^0) Huntington equation H39 is independent of H68_dual
LAT131 ( -1 +0 ^0) Huntington equation H42 is independent of H68_dual
LAT132 ( -1 +0 ^0) Huntington equation H42 is independent of H69_dual
LAT133 ( -1 +0 ^0) Huntington equation H6_dual is independent of H55
LAT134 ( -1 +0 ^0) Huntington equation H22_dual is independent of H61
LAT135 ( -1 +0 ^0) Huntington equation H39_dual is independent of H68
LAT136 ( -1 +0 ^0) Huntington equation H39_dual is independent of H69
LAT137 ( -1 +0 ^0) Huntington equation H40_dual is independent of H69
LAT138 ( -1 +0 ^0) Huntington equation H7 implies H6
LAT139 ( -1 +0 ^0) Huntington equation H11 implies H10
LAT140 ( -1 +0 ^0) Huntington equation H21 implies H2
LAT141 ( -1 +0 ^0) Huntington equation H21 implies H6
LAT142 ( -1 +0 ^0) Huntington equation H22 implies H6
LAT143 ( -1 +0 ^0) Huntington equation H24 implies H15
LAT144 ( -1 +0 ^0) Huntington equation H32 implies H2
LAT145 ( -1 +0 ^0) Huntington equation H32 implies H6
LAT146 ( -1 +0 ^0) Huntington equation H34 implies H28
LAT147 ( -1 +0 ^0) Huntington equation H34 implies H45
LAT148 ( -1 +0 ^0) Huntington equation H34 implies H7
LAT149 ( -1 +0 ^0) Huntington equation H37 implies H43
LAT150 ( -1 +0 ^0) Huntington equation H39 implies H40
LAT151 ( -1 +0 ^0) Huntington equation H39 implies H42
LAT152 ( -1 +0 ^0) Huntington equation H40 implies H6
LAT153 ( -1 +0 ^0) Huntington equation H40 implies H7
LAT154 ( -1 +0 ^0) Huntington equation H42 implies H6
LAT155 ( -1 +0 ^0) Huntington equation H49 implies H2
LAT156 ( -1 +0 ^0) Huntington equation H49 implies H6
LAT157 ( -1 +0 ^0) Huntington equation H50 implies H2
LAT158 ( -1 +0 ^0) Huntington equation H50 implies H49
LAT159 ( -1 +0 ^0) Huntington equation H50 implies H7
LAT160 ( -1 +0 ^0) Huntington equation H52 implies H51
LAT161 ( -1 +0 ^0) Huntington equation H58 implies H59
LAT162 ( -1 +0 ^0) Huntington equation H68 implies H73
LAT163 ( -1 +0 ^0) Huntington equation H76 implies H32
LAT164 ( -1 +0 ^0) Huntington equation H76 implies H6
LAT165 ( -1 +0 ^0) Huntington equation H76 implies H77
LAT166 ( -1 +0 ^0) Huntington equation H77 implies H78
LAT167 ( -1 +0 ^0) Huntington equation H78 implies H77
LAT168 ( -1 +0 ^0) Huntington equation H18_dual implies H58
LAT169 ( -1 +0 ^0) Huntington equation H21_dual implies H58
LAT170 ( -1 +0 ^0) Huntington equation H49_dual implies H58
LAT171 ( -1 +0 ^0) Huntington equation H61_dual implies H6
LAT172 ( -1 +0 ^0) Huntington equation H76_dual implies H32
LAT173 ( -1 +0 ^0) Huntington equation H76_dual implies H40
LAT174 ( -1 +0 ^0) Huntington equation H76_dual implies H6
LAT175 ( -1 +0 ^0) Huntington equation H79_dual implies H32
LAT176 ( -1 +0 ^0) Huntington equation H79_dual implies H42
LAT177 ( -1 +0 ^0) Huntington equation H79_dual implies H6
LAT178 ( -1 +0 ^0) Equation H1 is Huntington by distributivity
LAT179 ( -1 +0 ^0) Equation H2 is Huntington by distributivity
LAT180 ( -1 +0 ^0) Equation H3 is Huntington by distributivity
LAT181 ( -1 +0 ^0) Equation H4 is Huntington by distributivity
LAT182 ( -1 +0 ^0) Equation H6 is Huntington by distributivity
LAT183 ( -1 +0 ^0) Equation H7 is Huntington by distributivity
LAT184 ( -1 +0 ^0) Equation H8 is Huntington by distributivity
LAT185 ( -1 +0 ^0) Equation H10 is Huntington by distributivity
LAT186 ( -1 +0 ^0) Equation H11 is Huntington by distributivity
LAT187 ( -1 +0 ^0) Equation H15 is Huntington by distributivity
LAT188 ( -1 +0 ^0) Equation H16 is Huntington by distributivity
LAT189 ( -1 +0 ^0) Equation H17 is Huntington by distributivity
LAT190 ( -1 +0 ^0) Equation H18 is Huntington by distributivity
LAT191 ( -1 +0 ^0) Equation H21 is Huntington by distributivity
LAT192 ( -1 +0 ^0) Equation H22 is Huntington by distributivity
LAT193 ( -1 +0 ^0) Equation H24 is Huntington by distributivity
LAT194 ( -1 +0 ^0) Equation H32 is Huntington by distributivity
LAT195 ( -1 +0 ^0) Equation H34 is Huntington by distributivity
LAT196 ( -1 +0 ^0) Equation H39 is Huntington by distributivity
LAT197 ( -1 +0 ^0) Equation H40 is Huntington by distributivity
LAT198 ( -1 +0 ^0) Equation H42 is Huntington by distributivity
LAT199 ( -1 +0 ^0) Equation H49 is Huntington by distributivity
LAT200 ( -1 +0 ^0) Equation H50 is Huntington by distributivity
LAT201 ( -1 +0 ^0) Equation H51 is Huntington by distributivity
LAT202 ( -1 +0 ^0) Equation H55 is Huntington by distributivity
LAT203 ( -1 +0 ^0) Equation H57 is Huntington by distributivity
LAT204 ( -1 +0 ^0) Equation H58 is Huntington by distributivity
LAT205 ( -1 +0 ^0) Equation H59 is Huntington by distributivity
LAT206 ( -1 +0 ^0) Equation H60 is Huntington by distributivity
LAT207 ( -1 +0 ^0) Equation H61 is Huntington by distributivity
LAT208 ( -1 +0 ^0) Equation H63 is Huntington by distributivity
LAT209 ( -1 +0 ^0) Equation H64 is Huntington by distributivity
LAT210 ( -1 +0 ^0) Equation H68 is Huntington by distributivity
LAT211 ( -1 +0 ^0) Equation H69 is Huntington by distributivity
LAT212 ( -1 +0 ^0) Equation H70 is Huntington by distributivity
LAT213 ( -1 +0 ^0) Equation H76 is Huntington by distributivity
LAT214 ( -1 +0 ^0) Equation H79 is Huntington by distributivity
LAT215 ( -1 +0 ^0) Equation H80 is Huntington by distributivity
LAT216 ( -1 +0 ^0) Equation H81 is Huntington by distributivity
LAT217 ( -1 +0 ^0) Equation H82 is Huntington by distributivity
LAT218 ( -1 +0 ^0) Equation H1 is Huntington by implication
LAT219 ( -1 +0 ^0) Equation H2 is Huntington by implication
LAT220 ( -1 +0 ^0) Equation H3 is Huntington by implication
LAT221 ( -1 +0 ^0) Equation H4 is Huntington by implication
LAT222 ( -1 +0 ^0) Equation H6 is Huntington by implication
LAT223 ( -1 +0 ^0) Equation H7 is Huntington by implication
LAT224 ( -1 +0 ^0) Equation H8 is Huntington by implication
LAT225 ( -1 +0 ^0) Equation H10 is Huntington by implication
LAT226 ( -1 +0 ^0) Equation H11 is Huntington by implication
LAT227 ( -1 +0 ^0) Equation H15 is Huntington by implication
LAT228 ( -1 +0 ^0) Equation H16 is Huntington by implication
LAT229 ( -1 +0 ^0) Equation H17 is Huntington by implication
LAT230 ( -1 +0 ^0) Equation H18 is Huntington by implication
LAT231 ( -1 +0 ^0) Equation H21 is Huntington by implication
LAT232 ( -1 +0 ^0) Equation H22 is Huntington by implication
LAT233 ( -1 +0 ^0) Equation H24 is Huntington by implication
LAT234 ( -1 +0 ^0) Equation H32 is Huntington by implication
LAT235 ( -1 +0 ^0) Equation H34 is Huntington by implication
LAT236 ( -1 +0 ^0) Equation H39 is Huntington by implication
LAT237 ( -1 +0 ^0) Equation H40 is Huntington by implication
LAT238 ( -1 +0 ^0) Equation H42 is Huntington by implication
LAT239 ( -1 +0 ^0) Equation H49 is Huntington by implication
LAT240 ( -1 +0 ^0) Equation H50 is Huntington by implication
LAT241 ( -1 +0 ^0) Equation H51 is Huntington by implication
LAT242 ( -1 +0 ^0) Equation H55 is Huntington by implication
LAT243 ( -1 +0 ^0) Equation H57 is Huntington by implication
LAT244 ( -1 +0 ^0) Equation H58 is Huntington by implication
LAT245 ( -1 +0 ^0) Equation H59 is Huntington by implication
LAT246 ( -1 +0 ^0) Equation H60 is Huntington by implication
LAT247 ( -1 +0 ^0) Equation H61 is Huntington by implication
LAT248 ( -1 +0 ^0) Equation H63 is Huntington by implication
LAT249 ( -1 +0 ^0) Equation H64 is Huntington by implication
LAT250 ( -1 +0 ^0) Equation H68 is Huntington by implication
LAT251 ( -1 +0 ^0) Equation H69 is Huntington by implication
LAT252 ( -1 +0 ^0) Equation H70 is Huntington by implication
LAT253 ( -1 +0 ^0) Equation H76 is Huntington by implication
LAT254 ( -1 +0 ^0) Equation H79 is Huntington by implication
LAT255 ( -1 +0 ^0) Equation H80 is Huntington by implication
LAT256 ( -1 +0 ^0) Equation H81 is Huntington by implication
LAT257 ( -1 +0 ^0) Equation H82 is Huntington by implication
LAT258 ( -0 +1 ^0) A duality result on distributivity in lattices
LAT259 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT260 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT261 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT262 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT263 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT264 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT265 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT266 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT267 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT268 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT269 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT270 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT271 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT272 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT273 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT274 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT275 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT276 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT277 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT278 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT279 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT280 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT281 ( -2 +0 ^0) Problem about Tarski's fixed point theorem
LAT282 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T10
LAT283 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T11
LAT284 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T12
LAT285 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T14
LAT286 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T15
LAT287 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T16
LAT288 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T19
LAT289 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T27
LAT290 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T30
LAT291 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T37
LAT292 ( -0 +4 ^0) Representation Theorem for Boolean Algebras T44
LAT293 ( -0 +4 ^0) Ideals T02
LAT294 ( -0 +4 ^0) Ideals T04
LAT295 ( -0 +4 ^0) Ideals T08
LAT296 ( -0 +4 ^0) Ideals T12
LAT297 ( -0 +4 ^0) Ideals T13
LAT298 ( -0 +4 ^0) Ideals T16
LAT299 ( -0 +4 ^0) Ideals T17
LAT300 ( -0 +4 ^0) Ideals T24
LAT301 ( -0 +4 ^0) Ideals T25
LAT302 ( -0 +4 ^0) Ideals T26
LAT303 ( -0 +4 ^0) Ideals T27
LAT304 ( -0 +4 ^0) Ideals T28
LAT305 ( -0 +4 ^0) Ideals T31
LAT306 ( -0 +4 ^0) Ideals T32
LAT307 ( -0 +4 ^0) Ideals T34
LAT308 ( -0 +4 ^0) Ideals T35
LAT309 ( -0 +4 ^0) Ideals T36
LAT310 ( -0 +4 ^0) Ideals T39
LAT311 ( -0 +4 ^0) Ideals T40
LAT312 ( -0 +4 ^0) Ideals T41
LAT313 ( -0 +4 ^0) Ideals T43
LAT314 ( -0 +4 ^0) Ideals T48
LAT315 ( -0 +4 ^0) Ideals T49
LAT316 ( -0 +4 ^0) Ideals T50
LAT317 ( -0 +4 ^0) Ideals T51
LAT318 ( -0 +4 ^0) Ideals T52
LAT319 ( -0 +4 ^0) Ideals T54
LAT320 ( -0 +4 ^0) Ideals T56
LAT321 ( -0 +4 ^0) Ideals T57
LAT322 ( -0 +4 ^0) Ideals T58
LAT323 ( -0 +4 ^0) Ideals T59
LAT324 ( -0 +4 ^0) Ideals T60
LAT325 ( -0 +4 ^0) Ideals T61
LAT326 ( -0 +4 ^0) Ideals T62
LAT327 ( -0 +4 ^0) Ideals T64
LAT328 ( -0 +4 ^0) Ideals T65
LAT329 ( -0 +4 ^0) Ideals T66
LAT330 ( -0 +4 ^0) Ideals T67
LAT331 ( -0 +4 ^0) Ideals T68
LAT332 ( -0 +4 ^0) Ideals T72
LAT333 ( -0 +4 ^0) Ideals T76
LAT334 ( -0 +4 ^0) Ideals T77
LAT335 ( -0 +4 ^0) Ideals T79
LAT336 ( -0 +4 ^0) Ideals T85
LAT337 ( -0 +4 ^0) Ideals T87
LAT338 ( -0 +4 ^0) Dual Concept Lattices T04
LAT339 ( -0 +4 ^0) Dual Concept Lattices T05
LAT340 ( -0 +4 ^0) Dual Concept Lattices T06
LAT341 ( -0 +4 ^0) Dual Concept Lattices T07
LAT342 ( -0 +4 ^0) Dual Concept Lattices T08
LAT343 ( -0 +4 ^0) Dual Concept Lattices T11
LAT344 ( -0 +4 ^0) Dual Concept Lattices T16
LAT345 ( -0 +4 ^0) Dual Concept Lattices T20
LAT346 ( -0 +4 ^0) Dual Concept Lattices T22
LAT347 ( -0 +4 ^0) Representation Theorem for Free Continuous Lattices T01
LAT348 ( -0 +4 ^0) Representation Theorem for Free Continuous Lattices T06
LAT349 ( -0 +4 ^0) Representation Theorem for Free Continuous Lattices T12
LAT350 ( -0 +4 ^0) Representation Theorem for Free Continuous Lattices T13
LAT351 ( -0 +4 ^0) Representation Theorem for Free Continuous Lattices T18
LAT352 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T02
LAT353 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T03
LAT354 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T04
LAT355 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T05
LAT356 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T07
LAT357 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T08
LAT358 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T09
LAT359 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T12
LAT360 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T17
LAT361 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T19
LAT362 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T20
LAT363 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T26
LAT364 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T29
LAT365 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T35
LAT366 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T37
LAT367 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T38
LAT368 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T41
LAT369 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T42
LAT370 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T43
LAT371 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T44
LAT372 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T45
LAT373 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T46
LAT374 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T49
LAT375 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T51
LAT376 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T57
LAT377 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T59
LAT378 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T63
LAT379 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T65
LAT380 ( -0 +4 ^0) Duality Based on Galois Connection - Part I T71
-------------------------------------------------------------------------------
Domain LCL = Logic Calculi.
763 problems (637 abstract, 566 CNF, 136 FOF, 61 THF)
-------------------------------------------------------------------------------
LCL001 ( -1 +0 ^0) The Whitehead-Russell system => the Meredith axiom
LCL002 ( -1 +0 ^0) AN-CAMerideth => AN-1
LCL003 ( -1 +0 ^0) AN-CAMerideth => AN-2
LCL004 ( -1 +0 ^0) AN-CAMerideth => AN-3
LCL005 ( -1 +0 ^0) AN-CAMerideth => AN-4
LCL006 ( -1 +0 ^0) EC-1 depends on the Wajsberg system
LCL007 ( -1 +0 ^0) EC-2 depends on the Wajsberg system
LCL008 ( -1 +0 ^0) EC-4 depends on YQL
LCL009 ( -1 +0 ^0) EC-5 depends on YQL
LCL010 ( -1 +0 ^0) YQL depends on YQF
LCL011 ( -1 +0 ^0) YQF depends on YQJ
LCL012 ( -1 +0 ^0) YQJ depends on UM
LCL013 ( -1 +0 ^0) UM depends on XGF
LCL014 ( -1 +0 ^0) XGF depends on WN
LCL015 ( -1 +0 ^0) WN depends on YRM
LCL016 ( -1 +0 ^0) YRM depends on YRO
LCL017 ( -1 +0 ^0) YRO depends on PYO
LCL018 ( -1 +0 ^0) PYO depends on PYM
LCL019 ( -1 +0 ^0) PYM depends on XGK
LCL020 ( -1 +0 ^0) XGK depends on XHK
LCL021 ( -1 +0 ^0) XHK depends on XHN
LCL022 ( -1 +0 ^0) EC-1 depends on YQL
LCL023 ( -1 +0 ^0) EC-2 depends on YQL
LCL024 ( -1 +0 ^0) PYO depends on XGK
LCL025 ( -1 +0 ^0) C0-1 depends on the Church system
LCL026 ( -1 +0 ^0) C0-3 depends on the Church system
LCL027 ( -1 +0 ^0) C0-4 depends on the Church system
LCL028 ( -1 +0 ^0) C0-CAMerideth depends on the Church system
LCL029 ( -1 +0 ^0) C0-5 depends on the Tarski-Bernays system
LCL030 ( -1 +0 ^0) C0-6 depends on the Tarski-Bernays system
LCL031 ( -1 +0 ^0) C0-CAMerideth depends on the Tarski-Bernays system
LCL032 ( -1 +0 ^0) C0-1 depends on the Merideth axiom
LCL033 ( -1 +0 ^0) C0-2 depends on the Merideth axiom
LCL034 ( -1 +0 ^0) C0-3 depends on the Merideth axiom
LCL035 ( -1 +0 ^0) C0-4 depends on the Merideth axiom
LCL036 ( -1 +0 ^0) C0-5 depends on the Merideth axiom
LCL037 ( -1 +0 ^0) C0-6 depends on the Merideth axiom
LCL038 ( -1 +0 ^0) C0-1 depends on a single axiom
LCL039 ( -1 +0 ^0) A theorem from Morgan
LCL040 ( -1 +0 ^0) CN-21 depends on the rest of Frege's system
LCL041 ( -1 +0 ^0) CN-30 depends on the rest of Hilbert's system
LCL042 ( -1 +0 ^0) CN-35 depends on Hilbert's system
LCL043 ( -1 +0 ^0) CN-39 depends on Hilbert's system
LCL044 ( -1 +0 ^0) CN-40 depends on Hilbert's system
LCL045 ( -1 +0 ^0) CN-46 depends on Hilbert's system
LCL046 ( -1 +0 ^0) CN-16 depends on the Lukasiewicz system
LCL047 ( -1 +0 ^0) CN-18 depends on the Lukasiewicz system
LCL048 ( -1 +0 ^0) CN-19 depends on the Lukasiewicz system
LCL049 ( -1 +0 ^0) CN-20 depends on the Lukasiewicz system
LCL050 ( -1 +0 ^0) CN-21 depends on the Lukasiewicz system
LCL051 ( -1 +0 ^0) CN-22 depends on the Lukasiewicz system
LCL052 ( -1 +0 ^0) CN-24 depends on the Lukasiewicz system
LCL053 ( -1 +0 ^0) CN-30 depends on the Lukasiewicz system
LCL054 ( -1 +0 ^0) CN-35 depends on the Lukasiewicz system
LCL055 ( -1 +0 ^0) CN-37 depends on the Lukasiewicz system
LCL056 ( -1 +0 ^0) CN-39 depends on the Lukasiewicz system
LCL057 ( -1 +0 ^0) CN-40 depends on the Lukasiewicz system
LCL058 ( -1 +0 ^0) CN-46 depends on the Lukasiewicz system
LCL059 ( -1 +0 ^0) CN-49 depends on the Lukasiewicz system
LCL060 ( -1 +0 ^0) CN-54 depends on the Lukasiewicz system
LCL061 ( -1 +0 ^0) CN-59 depends on the Lukasiewicz system
LCL062 ( -1 +0 ^0) CN-60 depends on the Lukasiewicz system
LCL063 ( -1 +0 ^0) CN-CAMerideth depends on the Lukasiewicz system
LCL064 ( -2 +0 ^0) CN-1 depends on the Church system
LCL065 ( -1 +0 ^0) CN-2 depends on the Church system
LCL066 ( -1 +0 ^0) CN-3 depends on the Church system
LCL067 ( -1 +0 ^0) CN-1 depends on the second Lukasiewicz system
LCL068 ( -1 +0 ^0) CN-2 depends on the second Lukasiewicz system
LCL069 ( -1 +0 ^0) CN-3 depends on the second Lukasiewicz system
LCL070 ( -1 +0 ^0) CN-1 depends on the Wos system
LCL071 ( -1 +0 ^0) CN-2 depends on the Wos system
LCL072 ( -1 +0 ^0) CN-3 depends on the Wos system
LCL073 ( -1 +0 ^0) CN-1 depends on the single Merideth axiom
LCL074 ( -1 +0 ^0) CN-2 depends on the single Merideth axiom
LCL075 ( -1 +0 ^0) CN-3 depends on the single Merideth axiom
LCL076 ( -3 +0 ^0) CN-40 depends on the Church system
LCL077 ( -2 +0 ^0) CN-39 depends on the Church system
LCL078 ( -1 +0 ^0) CN-40 depends on CN-18 CN-35 CN-46
LCL079 ( -1 +0 ^0) Transitivity can be derived from Church's system
LCL080 ( -2 +0 ^0) The 1st Lukasiewicz axiom depends on Tarski-Bernays system
LCL081 ( -1 +0 ^0) IC-1 depends on the 1st Lukasiewicz axiom
LCL082 ( -1 +0 ^0) IC-2 depends on the 1st Lukasiewicz axiom
LCL083 ( -2 +0 ^0) IC-3 depends on the 1st Lukasiewicz axiom
LCL084 ( -2 +0 ^0) IC-4 depends on the 1st Lukasiewicz axiom
LCL085 ( -1 +0 ^0) IC-5 depends on the 1st Lukasiewicz axiom
LCL086 ( -1 +0 ^0) IC-1 depends on the 4th Lukasiewicz axiom
LCL087 ( -1 +0 ^0) IC-2 depends on the 4th Lukasiewicz axiom
LCL088 ( -1 +0 ^0) IC-3 depends on the 4th Lukasiewicz axiom
LCL089 ( -1 +0 ^0) IC-4 depends on the 4th Lukasiewicz axiom
LCL090 ( -1 +0 ^0) IC-1 depends on the 5th Lukasiewicz axiom
LCL091 ( -1 +0 ^0) IC-2 depends on the 5th Lukasiewicz axiom
LCL092 ( -1 +0 ^0) IC-3 depends on the 5th Lukasiewicz axiom
LCL093 ( -1 +0 ^0) IC-4 depends on the 5th Lukasiewicz axiom
LCL094 ( -1 +0 ^0) IC-5 depends on the 4th Lukasiewicz axiom
LCL095 ( -1 +0 ^0) IC-5 depends on the 5th Lukasiewicz axiom
LCL096 ( -1 +0 ^0) LG-1 depends on LG-2, LG-3, LG-4
LCL097 ( -1 +0 ^0) LG-4 depends on LG-2, LG-3
LCL098 ( -1 +0 ^0) LG-4 depends on LG-3
LCL099 ( -1 +0 ^0) LG-5 depends on the 1st McCune system
LCL100 ( -1 +0 ^0) LG-3 depends on the 2nd McCune system
LCL101 ( -1 +0 ^0) P-1 depends on the 3rd McCune system
LCL102 ( -1 +0 ^0) P-1 depends on the 4th McCune system
LCL103 ( -1 +0 ^0) LG-2 depends on the 5th McCune system
LCL104 ( -1 +0 ^0) P-1 depends on the 6th McCune system
LCL105 ( -1 +0 ^0) LG-2 depends on the 7th McCune system
LCL106 ( -1 +0 ^0) Q-2 depends on Q-1, Q-4
LCL107 ( -1 +0 ^0) P-1 depends on the single McCune axiom
LCL108 ( -1 +0 ^0) Q-3 depends on the single McCune axiom
LCL109 ( -6 +0 ^0) MV-4 depends on the Merideth system
LCL110 ( -2 +0 ^0) MV-24 depnds on the Merideth system
LCL111 ( -2 +0 ^0) MV-25 depends on the Merideth system
LCL112 ( -2 +0 ^0) MV-29 depnds on the Merideth system
LCL113 ( -2 +0 ^0) MV-33 depnds on the Merideth system
LCL114 ( -2 +0 ^0) MV-36 depnds on the Merideth system
LCL115 ( -2 +0 ^0) MV-39 depnds on the Merideth system
LCL116 ( -2 +0 ^0) MV-50 depnds on the Merideth system
LCL117 ( -1 +0 ^0) QYF depends on YQM
LCL118 ( -1 +0 ^0) YQM depends on WO
LCL119 ( -1 +0 ^0) WO depends on XGJ
LCL120 ( -1 +0 ^0) XGJ depends on QYF
LCL121 ( -1 +0 ^0) LG-1 depends on LG-2
LCL122 ( -1 +0 ^0) LG-3 depends on LG-2
LCL123 ( -1 +0 ^0) LG-4 depends on LG-2
LCL124 ( -1 +0 ^0) LG-5 depends on LG-2
LCL125 ( -1 +0 ^0) LG-2 depends on the 1st McCune system
LCL126 ( -1 +0 ^0) Q-2 depends on the 2nd McCune system
LCL127 ( -1 +0 ^0) LG-2 depends on S-2
LCL128 ( -1 +0 ^0) LG-2 depends on S-3
LCL129 ( -1 +0 ^0) LG-2 depends on S-4
LCL130 ( -1 +0 ^0) LG-2 depends on P-4
LCL131 ( -1 +0 ^0) LG-2 depends on S-6
LCL132 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL133 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL134 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL135 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL136 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL137 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL138 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL139 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL140 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL141 ( -1 +0 ^0) A lemma in Wajsberg algebras
LCL142 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL143 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL144 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL145 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL146 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL147 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL148 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL149 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL150 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL151 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL152 ( -1 +0 ^0) A theorem in the lattice structure of Wajsberg algebras
LCL153 ( -1 +0 ^0) The 1st alternative Wajsberg algebra axiom
LCL154 ( -1 +0 ^0) The 2nd alternative Wajsberg algebra axiom
LCL155 ( -1 +0 ^0) The 3rd alternative Wajsberg algebra axiom
LCL156 ( -1 +0 ^0) The 4th alternative Wajsberg algebra axiom
LCL157 ( -1 +0 ^0) The 5th alternative Wajsberg algebra axiom
LCL158 ( -1 +0 ^0) The 6th alternative Wajsberg algebra axiom
LCL159 ( -1 +0 ^0) The 7th alternative Wajsberg algebra axiom
LCL160 ( -1 +0 ^0) The 8th alternative Wajsberg algebra axiom
LCL161 ( -1 +0 ^0) The 1st Wajsberg algebra axiom, from the alternative axioms
LCL162 ( -1 +0 ^0) The 2nd Wajsberg algebra axiom, from the alternative axioms
LCL163 ( -1 +0 ^0) The 3rd Wajsberg algebra axiom, from the alternative axioms
LCL164 ( -1 +0 ^0) The 4th Wajsberg algebra axiom, from the alternative axioms
LCL165 ( -1 +0 ^0) A theorem in Wajsberg algebras
LCL166 ( -1 +0 ^0) UM depends on XHN
LCL167 ( -1 +0 ^0) YRO depends on XHK
LCL168 ( -1 +0 ^0) XEH is not a single axiom for the R-calculus
LCL169 ( -2 +0 ^0) Principia Mathematica 2.01
LCL170 ( -2 +0 ^0) Principia Mathematica 2.02
LCL171 ( -2 +0 ^0) Principia Mathematica 2.03
LCL172 ( -2 +0 ^0) Principia Mathematica 2.04
LCL173 ( -2 +0 ^0) Principia Mathematica 2.05
LCL174 ( -2 +0 ^0) Principia Mathematica 2.06
LCL175 ( -2 +0 ^0) Principia Mathematica 2.07
LCL176 ( -2 +0 ^0) Principia Mathematica 2.1 and 2.08
LCL177 ( -1 +0 ^0) Principia Mathematica 2.11
LCL178 ( -2 +0 ^0) Principia Mathematica 2.12
LCL179 ( -1 +0 ^0) Principia Mathematica 2.13
LCL180 ( -2 +0 ^0) Principia Mathematica 2.14
LCL181 ( -3 +1 ^0) Principia Mathematica 2.15
LCL182 ( -2 +0 ^0) Principia Mathematica 2.16
LCL183 ( -2 +0 ^0) Principia Mathematica 2.17
LCL184 ( -1 +0 ^0) Principia Mathematica 2.18
LCL185 ( -2 +0 ^0) Principia Mathematica 2.2
LCL186 ( -2 +0 ^0) Principia Mathematica 2.21
LCL187 ( -2 +0 ^0) Principia Mathematica 2.24
LCL188 ( -2 +0 ^0) Principia Mathematica 2.25
LCL189 ( -2 +0 ^0) Principia Mathematica 2.26 and 2.27
LCL190 ( -2 +0 ^0) Principia Mathematica 2.3
LCL191 ( -2 +0 ^0) Principia Mathematica 2.31
LCL192 ( -2 +0 ^0) Principia Mathematica 2.32 and 2.33
LCL193 ( -2 +0 ^0) Principia Mathematica 2.36
LCL194 ( -2 +0 ^0) Principia Mathematica 2.37
LCL195 ( -2 +0 ^0) Principia Mathematica 2.38
LCL196 ( -2 +0 ^0) Principia Mathematica 2.4
LCL197 ( -2 +0 ^0) Principia Mathematica 2.41
LCL198 ( -2 +0 ^0) Principia Mathematica 2.42 and 2.43
LCL199 ( -2 +0 ^0) Principia Mathematica 2.45
LCL200 ( -1 +0 ^0) Principia Mathematica 2.46
LCL201 ( -2 +0 ^0) Principia Mathematica 2.47
LCL202 ( -2 +0 ^0) Principia Mathematica 2.48
LCL203 ( -2 +0 ^0) Principia Mathematica 2.49
LCL204 ( -1 +0 ^0) Principia Mathematica 2.5
LCL205 ( -2 +0 ^0) Principia Mathematica 2.51
LCL206 ( -2 +0 ^0) Principia Mathematica 2.52
LCL207 ( -2 +0 ^0) Principia Mathematica 2.521
LCL208 ( -2 +0 ^0) Principia Mathematica 2.53
LCL209 ( -2 +0 ^0) Principia Mathematica 2.54
LCL210 ( -2 +0 ^0) Principia Mathematica 2.55
LCL211 ( -2 +0 ^0) Principia Mathematica 2.56
LCL212 ( -2 +0 ^0) Principia Mathematica 2.6
LCL213 ( -2 +0 ^0) Principia Mathematica 2.61
LCL214 ( -2 +0 ^0) Principia Mathematica 2.61
LCL215 ( -2 +0 ^0) Principia Mathematica 2.62 and 2.63
LCL216 ( -2 +0 ^0) Principia Mathematica 2.64
LCL217 ( -2 +0 ^0) Principia Mathematica 2.65
LCL218 ( -2 +0 ^0) Principia Mathematica 2.67
LCL219 ( -2 +0 ^0) Principia Mathematica 2.68
LCL220 ( -2 +0 ^0) Principia Mathematica 2.69
LCL221 ( -2 +0 ^0) Principia Mathematica 2.73
LCL222 ( -2 +0 ^0) Principia Mathematica 2.74
LCL223 ( -2 +0 ^0) Principia Mathematica 2.75
LCL224 ( -2 +0 ^0) Principia Mathematica 2.76
LCL225 ( -2 +0 ^0) Principia Mathematica 2.77
LCL226 ( -2 +0 ^0) Principia Mathematica 2.8
LCL227 ( -2 +0 ^0) Principia Mathematica 2.81
LCL228 ( -2 +0 ^0) Principia Mathematica 2.82
LCL229 ( -2 +0 ^0) Principia Mathematica 2.83
LCL230 ( -3 +1 ^0) Principia Mathematica 2.85
LCL231 ( -2 +0 ^0) Principia Mathematica 2.86
LCL234 ( -2 +0 ^0) Principia Mathematica 3.2 and 3.12
LCL235 ( -2 +0 ^0) Principia Mathematica 3.13
LCL236 ( -2 +0 ^0) Principia Mathematica 3.14
LCL237 ( -2 +0 ^0) Principia Mathematica 3.21
LCL238 ( -2 +0 ^0) Principia Mathematica 3.22
LCL239 ( -2 +0 ^0) Principia Mathematica 3.24
LCL240 ( -2 +0 ^0) Principia Mathematica 3.26
LCL241 ( -2 +0 ^0) Principia Mathematica 3.27
LCL242 ( -2 +0 ^0) Principia Mathematica 3.3
LCL243 ( -2 +0 ^0) Principia Mathematica 3.31
LCL244 ( -1 +0 ^0) Principia Mathematica 3.33
LCL245 ( -2 +0 ^0) Principia Mathematica 3.34
LCL246 ( -2 +0 ^0) Principia Mathematica 3.35
LCL247 ( -2 +0 ^0) Principia Mathematica 3.37
LCL248 ( -2 +0 ^0) Principia Mathematica 3.4
LCL249 ( -2 +0 ^0) Principia Mathematica 3.41
LCL250 ( -2 +0 ^0) Principia Mathematica 3.42
LCL251 ( -2 +0 ^0) Principia Mathematica 3.43
LCL252 ( -2 +0 ^0) Principia Mathematica 3.44
LCL253 ( -2 +0 ^0) Principia Mathematica 3.45
LCL254 ( -2 +0 ^0) Principia Mathematica 3.47
LCL255 ( -2 +0 ^0) Principia Mathematica 3.48
LCL256 ( -1 +0 ^0) A formula that can be derived from the Lukasiewicz system
LCL257 ( -1 +0 ^0) XHN depends on YQL
LCL258 ( -1 +0 ^0) Principia Mathematica 2.27
LCL259 ( -1 +0 ^0) Principia Mathematica 2.43
LCL260 ( -1 +0 ^0) Principia Mathematica 2.63
LCL261 ( -1 +0 ^0) Principia Mathematica 3.12
LCL262 ( -1 +0 ^0) Principia Mathematica 4.10
LCL263 ( -1 +0 ^0) Principia Mathematica 4.11
LCL264 ( -1 +0 ^0) Principia Mathematica 4.12
LCL265 ( -1 +0 ^0) Principia Mathematica 4.13
LCL266 ( -1 +0 ^0) Principia Mathematica 4.14
LCL267 ( -1 +0 ^0) Principia Mathematica 4.15
LCL268 ( -1 +0 ^0) Principia Mathematica 4.2
LCL269 ( -1 +0 ^0) Principia Mathematica 4.21
LCL270 ( -1 +0 ^0) Principia Mathematica 4.22
LCL271 ( -1 +0 ^0) Principia Mathematica 4.24
LCL272 ( -1 +0 ^0) Principia Mathematica 4.25
LCL273 ( -1 +0 ^0) Principia Mathematica 4.3
LCL274 ( -1 +0 ^0) Principia Mathematica 4.31
LCL275 ( -1 +0 ^0) Principia Mathematica 4.32
LCL276 ( -1 +0 ^0) Principia Mathematica 4.33
LCL277 ( -1 +0 ^0) Principia Mathematica 4.36
LCL278 ( -1 +0 ^0) Principia Mathematica 4.37
LCL279 ( -1 +0 ^0) Principia Mathematica 4.38
LCL280 ( -1 +0 ^0) Principia Mathematica 4.39
LCL281 ( -1 +0 ^0) Principia Mathematica 4.4
LCL282 ( -1 +0 ^0) Principia Mathematica 4.41
LCL283 ( -1 +0 ^0) Principia Mathematica 4.42
LCL284 ( -1 +0 ^0) Principia Mathematica 4.43
LCL285 ( -1 +0 ^0) Principia Mathematica 4.44
LCL286 ( -1 +0 ^0) Principia Mathematica 4.45
LCL287 ( -1 +0 ^0) Principia Mathematica 4.5
LCL288 ( -1 +0 ^0) Principia Mathematica 4.52
LCL289 ( -1 +0 ^0) Principia Mathematica 4.53
LCL290 ( -1 +0 ^0) Principia Mathematica 4.54
LCL291 ( -1 +0 ^0) Principia Mathematica 4.55
LCL292 ( -1 +0 ^0) Principia Mathematica 4.56
LCL293 ( -1 +0 ^0) Principia Mathematica 4.57
LCL294 ( -1 +0 ^0) Principia Mathematica 4.6
LCL295 ( -1 +0 ^0) Principia Mathematica 4.61
LCL296 ( -1 +0 ^0) Principia Mathematica 4.62
LCL297 ( -1 +0 ^0) Principia Mathematica 4.63
LCL298 ( -1 +0 ^0) Principia Mathematica 4.51
LCL299 ( -1 +0 ^0) Principia Mathematica 4.65
LCL300 ( -1 +0 ^0) Principia Mathematica 4.66
LCL301 ( -1 +0 ^0) Principia Mathematica 4.67
LCL302 ( -1 +0 ^0) Principia Mathematica 4.7
LCL303 ( -1 +0 ^0) Principia Mathematica 4.71
LCL304 ( -1 +0 ^0) Principia Mathematica 4.72
LCL305 ( -1 +0 ^0) Principia Mathematica 4.73
LCL306 ( -1 +0 ^0) Principia Mathematica 4.74
LCL307 ( -1 +0 ^0) Principia Mathematica 4.76
LCL308 ( -1 +0 ^0) Principia Mathematica 4.77
LCL309 ( -1 +0 ^0) Principia Mathematica 4.78
LCL310 ( -1 +0 ^0) Principia Mathematica 4.79
LCL311 ( -1 +0 ^0) Principia Mathematica 4.8
LCL312 ( -1 +0 ^0) Principia Mathematica 4.81
LCL313 ( -1 +0 ^0) Principia Mathematica 4.82
LCL314 ( -1 +0 ^0) Principia Mathematica 4.83
LCL315 ( -1 +0 ^0) Principia Mathematica 4.84
LCL316 ( -1 +0 ^0) Principia Mathematica 4.85
LCL317 ( -1 +0 ^0) Principia Mathematica 4.86
LCL318 ( -1 +0 ^0) Principia Mathematica 4.87
LCL319 ( -1 +0 ^0) Principia Mathematica 5.1
LCL320 ( -1 +0 ^0) Principia Mathematica 5.11
LCL321 ( -1 +0 ^0) Principia Mathematica 5.12
LCL322 ( -1 +0 ^0) Principia Mathematica 5.13
LCL323 ( -1 +0 ^0) Principia Mathematica 5.14
LCL324 ( -1 +0 ^0) Principia Mathematica 5.16
LCL325 ( -1 +0 ^0) Principia Mathematica 5.17
LCL326 ( -1 +0 ^0) Principia Mathematica 5.19
LCL327 ( -1 +0 ^0) Principia Mathematica 5.21
LCL328 ( -1 +0 ^0) Principia Mathematica 5.23
LCL329 ( -1 +0 ^0) Principia Mathematica 5.24
LCL330 ( -1 +0 ^0) Principia Mathematica 5.25
LCL331 ( -1 +0 ^0) Principia Mathematica 5.3
LCL332 ( -1 +0 ^0) Principia Mathematica 5.31
LCL333 ( -1 +0 ^0) Principia Mathematica 5.32
LCL334 ( -1 +0 ^0) Principia Mathematica 5.33
LCL335 ( -1 +0 ^0) Principia Mathematica 5.35
LCL336 ( -1 +0 ^0) Principia Mathematica 5.36
LCL337 ( -1 +0 ^0) Principia Mathematica 5.4
LCL338 ( -1 +0 ^0) Principia Mathematica 5.41
LCL339 ( -1 +0 ^0) Principia Mathematica 5.42
LCL340 ( -1 +0 ^0) Principia Mathematica 5.44
LCL341 ( -1 +0 ^0) Principia Mathematica 5.5
LCL342 ( -1 +0 ^0) Principia Mathematica 5.501
LCL343 ( -1 +0 ^0) Principia Mathematica 5.53
LCL344 ( -1 +0 ^0) Principia Mathematica 5.54
LCL345 ( -1 +0 ^0) Principia Mathematica 5.55
LCL346 ( -1 +0 ^0) Principia Mathematica 5.6
LCL347 ( -1 +0 ^0) Principia Mathematica 5.61
LCL348 ( -1 +0 ^0) Principia Mathematica 5.62
LCL349 ( -1 +0 ^0) Principia Mathematica 5.63
LCL350 ( -1 +0 ^0) Principia Mathematica 5.7
LCL351 ( -1 +0 ^0) Principia Mathematica 5.71
LCL352 ( -1 +0 ^0) Principia Mathematica 5.74
LCL353 ( -1 +0 ^0) Principia Mathematica 5.75
LCL354 ( -0 +1 ^0) Independence of an Axiom for Temporal Intervals
LCL355 ( -1 +0 ^0) CN-04 depends on the Lukasiewicz system
LCL356 ( -1 +0 ^0) CN-05 depends on the Lukasiewicz system
LCL357 ( -1 +0 ^0) CN-06 depends on the Lukasiewicz system
LCL358 ( -1 +0 ^0) CN-07 depends on the Lukasiewicz system
LCL359 ( -1 +0 ^0) CN-08 depends on the Lukasiewicz system
LCL360 ( -1 +0 ^0) CN-09 depends on the Lukasiewicz system
LCL361 ( -1 +0 ^0) CN-10 depends on the Lukasiewicz system
LCL362 ( -1 +0 ^0) CN-11 depends on the Lukasiewicz system
LCL363 ( -1 +0 ^0) CN-12 depends on the Lukasiewicz system
LCL364 ( -1 +0 ^0) CN-13 depends on the Lukasiewicz system
LCL365 ( -1 +0 ^0) CN-14 depends on the Lukasiewicz system
LCL366 ( -1 +0 ^0) CN-15 depends on the Lukasiewicz system
LCL367 ( -1 +0 ^0) CN-17 depends on the Lukasiewicz system
LCL368 ( -1 +0 ^0) CN-23 depends on the Lukasiewicz system
LCL369 ( -1 +0 ^0) CN-25 depends on the Lukasiewicz system
LCL370 ( -1 +0 ^0) CN-26 depends on the Lukasiewicz system
LCL371 ( -1 +0 ^0) CN-27 depends on the Lukasiewicz system
LCL372 ( -1 +0 ^0) CN-28 depends on the Lukasiewicz system
LCL373 ( -1 +0 ^0) CN-29 depends on the Lukasiewicz system
LCL374 ( -1 +0 ^0) CN-31 depends on the Lukasiewicz system
LCL375 ( -1 +0 ^0) CN-32 depends on the Lukasiewicz system
LCL376 ( -1 +0 ^0) CN-33 depends on the Lukasiewicz system
LCL377 ( -1 +0 ^0) CN-34 depends on the Lukasiewicz system
LCL378 ( -1 +0 ^0) CN-36 depends on the Lukasiewicz system
LCL379 ( -1 +0 ^0) CN-38 depends on the Lukasiewicz system
LCL380 ( -1 +0 ^0) CN-41 depends on the Lukasiewicz system
LCL381 ( -1 +0 ^0) CN-42 depends on the Lukasiewicz system
LCL382 ( -1 +0 ^0) CN-43 depends on the Lukasiewicz system
LCL383 ( -1 +0 ^0) CN-44 depends on the Lukasiewicz system
LCL384 ( -1 +0 ^0) CN-45 depends on the Lukasiewicz system
LCL385 ( -1 +0 ^0) CN-47 depends on the Lukasiewicz system
LCL386 ( -1 +0 ^0) CN-48 depends on the Lukasiewicz system
LCL387 ( -1 +0 ^0) CN-50 depends on the Lukasiewicz system
LCL388 ( -1 +0 ^0) CN-51 depends on the Lukasiewicz system
LCL389 ( -1 +0 ^0) CN-52 depends on the Lukasiewicz system
LCL390 ( -1 +0 ^0) CN-53 depends on the Lukasiewicz system
LCL391 ( -1 +0 ^0) CN-55 depends on the Lukasiewicz system
LCL392 ( -1 +0 ^0) CN-56 depends on the Lukasiewicz system
LCL393 ( -1 +0 ^0) CN-57 depends on the Lukasiewicz system
LCL394 ( -1 +0 ^0) CN-58 depends on the Lukasiewicz system
LCL395 ( -1 +0 ^0) CN-61 depends on the Lukasiewicz system
LCL396 ( -1 +0 ^0) CN-62 depends on the Lukasiewicz system
LCL397 ( -1 +0 ^0) CN-63 depends on the Lukasiewicz system
LCL398 ( -1 +0 ^0) CN-64 depends on the Lukasiewicz system
LCL399 ( -1 +0 ^0) CN-65 depends on the Lukasiewicz system
LCL400 ( -1 +0 ^0) CN-66 depends on the Lukasiewicz system
LCL401 ( -1 +0 ^0) CN-67 depends on the Lukasiewicz system
LCL402 ( -1 +0 ^0) CN-68 depends on the Lukasiewicz system
LCL403 ( -1 +0 ^0) CN-69 depends on the Lukasiewicz system
LCL404 ( -1 +0 ^0) CN-70 depends on the Lukasiewicz system
LCL405 ( -1 +0 ^0) CN-71 depends on the Lukasiewicz system
LCL406 ( -1 +0 ^0) Generate LTL structures of size 4
LCL407 ( -2 +0 ^0) Wajsberg algebra axioms
LCL408 ( -1 +0 ^0) Wajsberg algebra lattice structure definitions
LCL409 ( -1 +0 ^0) Wajsberg algebra AND and OR definitions
LCL410 ( -1 +0 ^0) Alternative Wajsberg algebra definitions
LCL411 ( -2 +0 ^0) Propositional logic deduction axioms
LCL412 ( -1 +0 ^0) Propositional logic deduction axioms for AND
LCL413 ( -1 +0 ^0) Propositional logic deduction axioms for EQUIVALENT
LCL414 ( -1 +1 ^0) Peter Andrews Problem THM147
LCL415 ( -1 +0 ^0) Non-axiom for intuitionistic implication
LCL416 ( -1 +0 ^0) Prove reflexivity from formula XCB by condensed detachment
LCL417 ( -2 +0 ^0) XCB is a single axiom for the equivalential calculus
LCL418 ( -1 +0 ^0) Is formula YQE a single axiom for the right group calculus?
LCL419 ( -1 +0 ^0) Prove AK1 from MV1--MV4
LCL420 ( -1 +0 ^0) Prove AK2 from MV1--MV4
LCL421 ( -1 +0 ^0) Prove KA1 from MV1--MV4
LCL422 ( -1 +0 ^0) Prove KA2 from MV1--MV4
LCL423 ( -1 +0 ^0) Luka-23 is a single axiom
LCL424 ( -1 +0 ^0) Mer-21 is a single axiom for two-valued logic
LCL425 ( -1 +0 ^0) BCI+mingle implies Karpenko by condensed detachment
LCL426 ( -1 +0 ^0) Prove the mingle formula by condensed detachment
LCL427 ( -1 +0 ^0) ORG-D23 is a single axiom for propositional calculus
LCL428 ( -1 +0 ^0) Prove the Harris/Rezus axiom from MV1-MV3 and MV5
LCL429 ( -2 +0 ^0) Problem about propositional logic
LCL430 ( -2 +0 ^0) Problem about propositional logic
LCL431 ( -2 +0 ^0) Problem about propositional logic
LCL432 ( -2 +0 ^0) Problem about propositional logic
LCL433 ( -2 +0 ^0) Problem about propositional logic
LCL434 ( -2 +0 ^0) Problem about propositional logic
LCL435 ( -2 +0 ^0) Problem about propositional logic
LCL436 ( -2 +0 ^0) Problem about propositional logic
LCL437 ( -2 +0 ^0) Problem about propositional logic
LCL438 ( -2 +0 ^0) Problem about propositional logic
LCL439 ( -2 +0 ^0) Problem about propositional logic
LCL440 ( -2 +0 ^0) Problem about propositional logic
LCL441 ( -2 +0 ^0) Problem about propositional logic
LCL442 ( -2 +0 ^0) Problem about propositional logic
LCL443 ( -2 +0 ^0) Problem about propositional logic
LCL444 ( -2 +0 ^0) Problem about propositional logic
LCL445 ( -2 +0 ^0) Problem about propositional logic
LCL446 ( -2 +0 ^0) Problem about propositional logic
LCL447 ( -2 +0 ^0) Problem about propositional logic
LCL448 ( -0 +1 ^0) Redundant axiom in Principia axiomatization
LCL449 ( -0 +1 ^0) Congruence of equiv, to admit substitution of equivalents
LCL450 ( -0 +2 ^0) Congruence of equiv lemmas, to admit substitution of equivalents
LCL451 ( -0 +1 ^0) Prove Lukasiewicz's cn1 axiom from Hilbert's axiomatization
LCL452 ( -0 +1 ^0) Prove Lukasiewicz's cn2 axiom from Hilbert's axiomatization
LCL453 ( -0 +1 ^0) Prove Lukasiewicz's cn3 axiom from Hilbert's axiomatization
LCL454 ( -0 +1 ^0) Prove Principia's r1 axiom from Hilbert's axiomatization
LCL455 ( -0 +1 ^0) Prove Principia's r2 axiom from Hilbert's axiomatization
LCL456 ( -0 +1 ^0) Prove Principia's r3 axiom from Hilbert's axiomatization
LCL457 ( -0 +1 ^0) Prove Principia's r4 axiom from Hilbert's axiomatization
LCL458 ( -0 +1 ^0) Prove Principia's r5 axiom from Hilbert's axiomatization
LCL459 ( -0 +1 ^0) Prove Rosser's kn1 axiom from Hilbert's axiomatization
LCL460 ( -0 +1 ^0) Prove Rosser's kn2 axiom from Hilbert's axiomatization
LCL461 ( -0 +1 ^0) Prove Rosser's kn3 axiom from Hilbert's axiomatization
LCL462 ( -0 +1 ^0) Prove Hilbert's modus_tollens axiom from Lukasiewicz's system
LCL463 ( -0 +1 ^0) Prove Hilbert's implies_1 axiom from Lukasiewicz's axiomatization
LCL464 ( -0 +1 ^0) Prove Hilbert's implies_2 axiom from Lukasiewicz's axiomatization
LCL465 ( -0 +1 ^0) Prove Hilbert's implies_3 axiom from Lukasiewicz's axiomatization
LCL466 ( -0 +1 ^0) Prove Hilbert's and_1 axiom from Lukasiewicz's axiomatization
LCL467 ( -0 +1 ^0) Prove Hilbert's and_2 axiom from Lukasiewicz's axiomatization
LCL468 ( -0 +1 ^0) Prove Hilbert's and_3 axiom from Lukasiewicz's axiomatization
LCL469 ( -0 +1 ^0) Prove Hilbert's or_1 axiom from Lukasiewicz's axiomatization
LCL470 ( -0 +1 ^0) Prove Hilbert's or_2 axiom from Lukasiewicz's axiomatization
LCL471 ( -0 +1 ^0) Prove Hilbert's or_3 axiom from Lukasiewicz's axiomatization
LCL472 ( -0 +1 ^0) Prove Hilbert's equivalence_1 axiom from Lukasiewicz's system
LCL473 ( -0 +1 ^0) Prove Hilbert's equivalence_2 axiom from Lukasiewicz's system
LCL474 ( -0 +1 ^0) Prove Hilbert's equivalence_3 axiom from Lukasiewicz's system
LCL475 ( -0 +1 ^0) Prove Principia's r1 axiom from Lukasiewicz's axiomatization
LCL476 ( -0 +1 ^0) Prove Principia's r2 axiom from Lukasiewicz's axiomatization
LCL477 ( -0 +1 ^0) Prove Principia's r3 axiom from Lukasiewicz's axiomatization
LCL478 ( -0 +1 ^0) Prove Principia's r4 axiom from Lukasiewicz's axiomatization
LCL479 ( -0 +1 ^0) Prove Principia's r5 axiom from Lukasiewicz's axiomatization
LCL480 ( -0 +1 ^0) Prove Rosser's kn1 axiom from Lukasiewicz's axiomatization
LCL481 ( -0 +1 ^0) Prove Rosser's kn2 axiom from Lukasiewicz's axiomatization
LCL482 ( -0 +1 ^0) Prove Rosser's kn3 axiom from Lukasiewicz's axiomatization
LCL483 ( -0 +1 ^0) Prove Hilbert's modus_tollens axiom from Principia's system
LCL484 ( -0 +1 ^0) Prove Hilbert's implies_1 axiom from Principia's axiomatization
LCL485 ( -0 +1 ^0) Prove Hilbert's implies_2 axiom from Principia's axiomatization
LCL486 ( -0 +1 ^0) Prove Hilbert's implies_3 axiom from Principia's axiomatization
LCL487 ( -0 +1 ^0) Prove Hilbert's and_1 axiom from Principia's axiomatization
LCL488 ( -0 +1 ^0) Prove Hilbert's and_2 axiom from Principia's axiomatization
LCL489 ( -0 +1 ^0) Prove Hilbert's and_3 axiom from Principia's axiomatization
LCL490 ( -0 +1 ^0) Prove Hilbert's or_1 axiom from Principia's axiomatization
LCL491 ( -0 +1 ^0) Prove Hilbert's or_2 axiom from Principia's axiomatization
LCL492 ( -0 +1 ^0) Prove Hilbert's or_3 axiom from Principia's axiomatization
LCL493 ( -0 +1 ^0) Prove Hilbert's equivalence_1 axiom from Principia's system
LCL494 ( -0 +1 ^0) Prove Hilbert's equivalence_2 axiom from Principia's system
LCL495 ( -0 +1 ^0) Prove Hilbert's equivalence_3 axiom from Principia's system
LCL496 ( -0 +1 ^0) Prove Lukasiewicz's cn1 axiom from Principia's axiomatization
LCL497 ( -0 +1 ^0) Prove Lukasiewicz's cn2 axiom from Principia's axiomatization
LCL498 ( -0 +1 ^0) Prove Lukasiewicz's cn3 axiom from Principia's axiomatization
LCL499 ( -0 +1 ^0) Prove Rosser's kn1 axiom from Principia's axiomatization
LCL500 ( -0 +1 ^0) Prove Rosser's kn2 axiom from Principia's axiomatization
LCL501 ( -0 +1 ^0) Prove Rosser's kn3 axiom from Principia's axiomatization
LCL502 ( -0 +1 ^0) Prove Hilbert's modus_tollens axiom from Rosser's system
LCL503 ( -0 +1 ^0) Prove Hilbert's implies_1 axiom from Rosser's axiomatization
LCL504 ( -0 +1 ^0) Prove Hilbert's implies_2 axiom from Rosser's axiomatization
LCL505 ( -0 +1 ^0) Prove Hilbert's implies_3 axiom from Rosser's axiomatization
LCL506 ( -0 +1 ^0) Prove Hilbert's and_1 axiom from Rosser's axiomatization
LCL507 ( -0 +1 ^0) Prove Hilbert's and_2 axiom from Rosser's axiomatization
LCL508 ( -0 +1 ^0) Prove Hilbert's and_3 axiom from Rosser's axiomatization
LCL509 ( -0 +1 ^0) Prove Hilbert's or_1 axiom from Rosser's axiomatization
LCL510 ( -0 +1 ^0) Prove Hilbert's or_2 axiom from Rosser's axiomatization
LCL511 ( -0 +1 ^0) Prove Hilbert's or_3 axiom from Rosser's axiomatization
LCL512 ( -0 +1 ^0) Prove Hilbert's equivalence_1 axiom from Rosser's system
LCL513 ( -0 +1 ^0) Prove Hilbert's equivalence_2 axiom from Rosser's system
LCL514 ( -0 +1 ^0) Prove Hilbert's equivalence_3 axiom from Rosser's system
LCL515 ( -0 +1 ^0) Prove Lukasiewicz's cn1 axiom from Rosser's axiomatization
LCL516 ( -0 +1 ^0) Prove Lukasiewicz's cn2 axiom from Rosser's axiomatization
LCL517 ( -0 +1 ^0) Prove Lukasiewicz's cn3 axiom from Rosser's axiomatization
LCL518 ( -0 +1 ^0) Prove Principia's r1 axiom from Rosser's axiomatization
LCL519 ( -0 +1 ^0) Prove Principia's r2 axiom from Rosser's axiomatization
LCL520 ( -0 +1 ^0) Prove Principia's r3 axiom from Rosser's axiomatization
LCL521 ( -0 +1 ^0) Prove Principia's r4 axiom from Rosser's axiomatization
LCL522 ( -0 +1 ^0) Prove Principia's r5 axiom from Rosser's axiomatization
LCL523 ( -0 +1 ^0) Prove axiom 4 from KM5 axiomatization of S5
LCL524 ( -0 +1 ^0) Prove axiom B from KM5 axiomatization of S5
LCL525 ( -0 +1 ^0) Prove strict implies modus ponens from KM5 axiomatization of S5
LCL526 ( -0 +1 ^0) Prove SSE from KM5 axiomatization of S5
LCL527 ( -0 +1 ^0) Prove adjunction from KM5 axiomatization of S5
LCL528 ( -0 +1 ^0) Prove axiom m1 from KM5 axiomatization of S5
LCL529 ( -0 +1 ^0) Prove axiom m2 from KM5 axiomatization of S5
LCL530 ( -0 +1 ^0) Prove axiom m3 from KM5 axiomatization of S5
LCL531 ( -0 +1 ^0) Prove axiom m4 from KM5 axiomatization of S5
LCL532 ( -0 +1 ^0) Prove axiom m5 from KM5 axiomatization of S5
LCL533 ( -0 +1 ^0) Prove axiom m6 from KM5 axiomatization of S5
LCL534 ( -0 +1 ^0) Prove axiom s3 from KM5 axiomatization of S5
LCL535 ( -0 +1 ^0) Prove axiom m9 from KM5 axiomatization of S5
LCL536 ( -0 +1 ^0) Prove axiom m10 from KM5 axiomatization of S5
LCL537 ( -0 +1 ^0) Prove axiom 5 from KM4B axiomatization of S5
LCL538 ( -0 +1 ^0) Prove strict implies modus ponens from KM4B axiomatization of S5
LCL539 ( -0 +1 ^0) Prove SSE from KM4B axiomatization of S5
LCL540 ( -0 +1 ^0) Prove adjunction from KM4B axiomatization of S5
LCL541 ( -0 +1 ^0) Prove axiom m1 from KM4B axiomatization of S5
LCL542 ( -0 +1 ^0) Prove axiom m2 from KM4B axiomatization of S5
LCL543 ( -0 +1 ^0) Prove axiom m3 from KM4B axiomatization of S5
LCL544 ( -0 +1 ^0) Prove axiom m4 from KM4B axiomatization of S5
LCL545 ( -0 +1 ^0) Prove axiom m5 from KM4B axiomatization of S5
LCL546 ( -0 +1 ^0) Prove axiom m6 from KM4B axiomatization of S5
LCL547 ( -0 +1 ^0) Prove axiom s3 from KM4B axiomatization of S5
LCL548 ( -0 +1 ^0) Prove axiom m9 from KM4B axiomatization of S5
LCL549 ( -0 +1 ^0) Prove axiom m10 from KM4B axiomatization of S5
LCL550 ( -0 +1 ^0) Prove Hilbert's modus ponens rule from the S1-0 system
LCL551 ( -0 +1 ^0) Prove Hilbert's modus_tollens axiom from the S1-0 system
LCL552 ( -0 +1 ^0) Prove Hilbert's implies_1 axiom from the S1-0 system
LCL553 ( -0 +1 ^0) Prove Hilbert's implies_2 axiom from the S1-0 system
LCL554 ( -0 +1 ^0) Prove Hilbert's implies_3 axiom from the S1-0 system
LCL555 ( -0 +1 ^0) Prove Hilbert's and_1 axiom from the S1-0 system
LCL556 ( -0 +1 ^0) Prove Hilbert's and_2 axiom from the S1-0 system
LCL557 ( -0 +1 ^0) Prove Hilbert's and_3 axiom from the S1-0 system
LCL558 ( -0 +1 ^0) Prove Hilbert's or_1 axiom from the S1-0 system
LCL559 ( -0 +1 ^0) Prove Hilbert's or_2 axiom from the S1-0 system
LCL560 ( -0 +1 ^0) Prove Hilbert's or_3 axiom from the S1-0 system
LCL561 ( -0 +1 ^0) Prove Hilbert's equivalence_1 axiom from the S1-0 system
LCL562 ( -0 +1 ^0) Prove Hilbert's equivalence_2 axiom from the S1-0 system
LCL563 ( -0 +1 ^0) Prove Hilbert's equivalence_3 axiom from the S1-0 system
LCL564 ( -0 +1 ^0) Prove axiom K from the S1-0M6S3M9B axiomatization of S5
LCL565 ( -0 +1 ^0) Prove necessitation from the S1-0M6S3M9B axiomatization of S5
LCL566 ( -0 +1 ^0) Prove axiom M from the S1-0M6S3M9B axiomatization of S5
LCL567 ( -0 +1 ^0) Prove axiom 5 from the S1-0M6S3M9B axiomatization of S5
LCL568 ( -0 +1 ^0) Prove axiom 4 from the S1-0M6S3M9B axiomatization of S5
LCL569 ( -0 +1 ^0) Prove axiom m10 from the S1-0M6S3M9B axiomatization of S5
LCL570 ( -0 +1 ^0) Prove axiom K from the S1-0M10 axiomatization of S5
LCL571 ( -0 +1 ^0) Prove necessitation from the S1-0M10 axiomatization of S5
LCL572 ( -0 +1 ^0) Prove axiom M from the S1-0M10 axiomatization of S5
LCL573 ( -0 +1 ^0) Prove axiom 5 from the S1-0M10 axiomatization of S5
LCL574 ( -0 +1 ^0) Prove axiom 4 from the S1-0M10 axiomatization of S5
LCL575 ( -0 +1 ^0) Prove axiom B from the S1-0M10 axiomatization of S5
LCL576 ( -0 +1 ^0) Prove axiom m6 from the S1-0M10 axiomatization of S5
LCL577 ( -0 +1 ^0) Prove axiom s3 from the S1-0M10 axiomatization of S5
LCL578 ( -0 +1 ^0) Prove axiom m9 from the S1-0M10 axiomatization of S5
LCL579 ( -0 +0 ^1) Leibniz-equality definition means it's an equivalence
LCL580 ( -0 +0 ^1) Popkorn problem 1
LCL581 ( -0 +0 ^1) Popkorn problem 2
LCL582 ( -0 +0 ^1) Popkorn problem 3
LCL583 ( -0 +0 ^1) Popkorn problem 4
LCL584 ( -0 +0 ^1) Popkorn problem 5
LCL585 ( -0 +0 ^1) Popkorn problem 6
LCL586 ( -0 +0 ^1) Popkorn problem 7
LCL587 ( -0 +0 ^1) Popkorn problem 8
LCL588 ( -0 +0 ^1) Popkorn problem 9
LCL589 ( -0 +0 ^1) Popkorn problem 10
LCL590 ( -0 +0 ^1) Popkorn problem 11
LCL591 ( -0 +0 ^1) Axiom N is valid
LCL592 ( -0 +0 ^1) Axiom D is valid
LCL593 ( -0 +0 ^1) Is axiom 4 valid in K?
LCL594 ( -0 +0 ^1) Relation for all propositions making T valid in K
LCL595 ( -0 +0 ^1) Is axiom T equivalent to reflexivity of R in K
LCL596 ( -0 +0 ^1) Is axiom 4 valid in K?
LCL597 ( -0 +0 ^1) Relation and proposition for 4 in K
LCL598 ( -0 +0 ^1) Is axiom 4 equivalent to irreflexivity?
LCL599 ( -0 +0 ^1) Is axiom 4 equivalent to symmetry?
LCL600 ( -0 +0 ^1) Is axiom 4 equivalent to transitivity of R in K?
LCL601 ( -0 +0 ^1) Axiom 4 for all R means all R are valid
LCL602 ( -0 +0 ^1) T and 4 equivalent to reflexivity and transitivity of R in K
LCL603 ( -0 +0 ^1) T and 4 imply reflexivity and transitivity of R in K
LCL604 ( -0 +0 ^1) T and 4 implied by reflexivity and transitivity of R in K
LCL605 ( -0 +0 ^1) LAMBDA^mm_1 validates the K axioms
LCL606 ( -0 +0 ^1) LAMBDA^mm_1 validates the Barcan formula axioms
LCL607 ( -0 +0 ^1) LAMBDA^mm_1 validates the axioms defining possibility
LCL608 ( -0 +0 ^1) LAMBDA^mm_1 validates the modus ponens rule
LCL609 ( -0 +0 ^1) LAMBDA^mm_1 validates the generalization rule
LCL610 ( -0 +0 ^1) LAMBDA^mm_1 validates the modal generalization rule
LCL611 ( -0 +0 ^1) LAMBDA^mm_1 validates the converse Barcan formula
LCL612 ( -0 +0 ^1) Modus Ponens holds in K
LCL613 ( -0 +0 ^1) Simple theorem of K
LCL614 ( -0 +0 ^1) Regularity is a derived rule in K
LCL615 ( -0 +0 ^1) Axiom KB
LCL616 ( -0 +0 ^1) Axiom T
LCL617 ( -0 +0 ^1) Axiom GL
LCL618 ( -0 +0 ^1) Axiom GL implies Axiom K4 in K
LCL619 ( -0 +0 ^1) A simple theorem of K4
LCL620 ( -0 +0 ^1) A simple theorem of propositional logic
LCL621 ( -0 +0 ^1) A simple theorem of K4
LCL622 ( -0 +0 ^1) The Loeb formula
LCL623 ( -0 +0 ^1) The Loeb formula is a theorem in GL
LCL624 ( -0 +0 ^1) A simple theorem of K
LCL625 ( -0 +0 ^1) GL axiom is valid in this frame
LCL626 ( -0 +0 ^1) Loeb axiom is valid in this frame
LCL627 ( -0 +0 ^1) K4 axiom is valid in this frame
LCL628 ( -0 +0 ^1) Normality Scheme holds in K
LCL629 ( -0 +0 ^1) Simple theorem about knowledge
LCL630 ( -0 +0 ^1) The muddy forehead puzzle
LCL631 ( -0 +0 ^1) The muddy forehead puzzle
LCL632 ( -0 +0 ^1) The muddy forehead puzzle
LCL633 ( -0 +0 ^1) Goedel's ontological argument on the existence of God
LCL634 ( -0 +0 ^1) Goedel's ontological argument on the existence of God
LCL690 ( -0 +0 ^1) Prove K in the CS4 translation
LCL691 ( -0 +0 ^1) Prove reflexivity in the CS4 translation
LCL692 ( -0 +0 ^1) Prove transitivity in the CS4 translation
LCL693 ( -0 +0 ^1) Prove the Barcan formula in the CS4 translation
LCL694 ( -0 +0 ^1) Prove the converse Barcan formula in the CS4 translation
-------------------------------------------------------------------------------
Domain LDA = Left Distributive.
23 problems (14 abstract, 23 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
LDA001 ( -1 +0 ^0) Verify 3*2*U = UUU, where U = 2*2
LDA002 ( -1 +0 ^0) Verify 3*2(U2)(UU(UU)) = U1(U3)(UU(UU))
LDA003 ( -1 +0 ^0) Show that 3 is a left segment of U = 2*2
LDA004 ( -1 +0 ^0) Show that 3*2(U2) is a left segment of U1(U3)
LDA005 ( -2 +0 ^0) Let g=cr(t). Show that tt(tsg) < t(tsg) (for any s)
LDA006 ( -2 +0 ^0) Let g = cr(t). Show that tsg is not in the range of t
LDA007 ( -3 +0 ^0) Let g = cr(t). Show that t(tsg) = tt(ts)(tg)
LDA008 ( -2 +0 ^0) Let g = cr(t) = cr(T). If Ta < Tsg, then ta < tsg
LDA009 ( -2 +0 ^0) Let g = cr(t). If g < sg, then st(ts)g < stt(sg)
LDA010 ( -2 +0 ^0) Let g = cr(t). Show that stts(sttt)(stts)g < stt(sg)
LDA011 ( -2 +0 ^0) Let g = cr(t). Show that stts(sttt)(stts)stts(sttt)g < stt(sg)
LDA012 ( -2 +0 ^0) Let g = cr(t). Show that stts(sttt)g = g
LDA013 ( -1 +0 ^0) Let g = cr(t). Show that aag <= ag, t=a
LDA014 ( -1 +0 ^0) Let g = cr(t). Show that aag <= ag, t=a
-------------------------------------------------------------------------------
Domain MED = Medicine.
10 problems (10 abstract, 0 CNF, 10 FOF, 0 THF)
-------------------------------------------------------------------------------
MED001 ( -0 +1 ^0) Sulfonylurea treatment
MED002 ( -0 +1 ^0) Combined biguanide and sulfonylurea treatment
MED003 ( -0 +1 ^0) Insulin treatment
MED004 ( -0 +1 ^0) No suitable therapy for patients with exhausted B-cells
MED005 ( -0 +1 ^0) Unsuccessful diet treatment 
MED006 ( -0 +1 ^0) Unsuccessful s1-qilt27 treatment - single oral anti-diabetic
MED007 ( -0 +1 ^0) Unsuccessful s1-qilt27 treatment next step
MED008 ( -0 +1 ^0) Unsuccessful s1-qige27 treatment
MED009 ( -0 +1 ^0) Unsuccessful s1-qige27 treatment - next step
MED010 ( -0 +1 ^0) Unsuccessful s1-qilt27 treatment - two oral anti-diabetic
-------------------------------------------------------------------------------
Domain MGT = Management.
156 problems (66 abstract, 78 CNF, 78 FOF, 0 THF)
-------------------------------------------------------------------------------
MGT001 ( -1 +1 ^0) Selection favors organizations with high inertia
MGT002 ( -1 +1 ^0) Structural inertia increases monotonically with age. 
MGT003 ( -1 +1 ^0) Organizational death rates decrease with age.
MGT004 ( -1 +1 ^0) Attempts at reorganization increase death rates.
MGT005 ( -2 +2 ^0) Complexity increases the risk of death due to reorganization.
MGT006 ( -1 +1 ^0) Reliability and accountability increase with time.
MGT007 ( -1 +1 ^0) Reproducibility decreases during reorganization.
MGT008 ( -1 +1 ^0) Organizational death rates decrease with size.
MGT009 ( -1 +1 ^0) Large organization have higher reproducibility
MGT010 ( -1 +1 ^0) Large organization have higher reliability and accountability
MGT011 ( -1 +1 ^0) Organizational size cannot decrease without reorganization
MGT012 ( -1 +1 ^0) Complexity of an organization cannot get smaller by age
MGT013 ( -1 +1 ^0) If organization complexity increases, its size cannot decrease 
MGT014 ( -1 +1 ^0) If orgainzation size increases, its complexity cannot decrease
MGT015 ( -1 +1 ^0) Complexity increases the expected duration of reorganisation.
MGT016 ( -1 +1 ^0) More complex organizations have shorter reorganization
MGT017 ( -1 +1 ^0) Length of reoganisation proportional to organization size
MGT018 ( -1 +1 ^0) Larger organizations have shorter reorganization
MGT019 ( -1 +1 ^0) Growth rate of EPs exceeds that of FMs in stable environments
MGT020 ( -1 +1 ^0) First movers exceeds efficient producers disbanding rate
MGT021 ( -1 +1 ^0) Difference between disbanding rates does not decrease
MGT022 ( -2 +2 ^0) Decreasing resource availability affects FMS more than EPs
MGT023 ( -2 +2 ^0) Stable environments have a critical point.
MGT024 ( -1 +1 ^0) Subpopulation growth rates are in equilibria
MGT025 ( -1 +1 ^0) Constant population means opposite growth rates
MGT026 ( -1 +1 ^0) Selection favors efficient producers past the critical point
MGT027 ( -1 +1 ^0) The FM set contracts in stable environments
MGT028 ( -1 +1 ^0) FMs have a negative growth rate in stable environments
MGT029 ( -1 +1 ^0) EPs have positive and FMs have negative growth rates
MGT030 ( -1 +1 ^0) Earliest time point when FM growth rate exceeds EP growth rate
MGT031 ( -1 +1 ^0) First movers appear first in an environment
MGT032 ( -1 +1 ^0) Selection favours EPs above FMs
MGT033 ( -2 +2 ^0) Selection favors FMs above EPs until EPs appear
MGT034 ( -2 +2 ^0) Selection favors FMs above EPs until critical point reached
MGT035 ( -2 +2 ^0) EPs outcompete FMs in stable environments
MGT036 ( -3 +3 ^0) First movers never outcompete efficient producers. 
MGT037 ( -2 +2 ^0) Once appeared, efficient producers do not disappear
MGT038 ( -2 +2 ^0) FMs become extinct in stable environments
MGT039 ( -2 +2 ^0) Selection favours EPs above Fms if change is slow
MGT040 ( -2 +2 ^0) Selection favours FMs above EPs if change is not extreme
MGT041 ( -1 +1 ^0) There are non-FM and non-EP organisations
MGT042 ( -1 +1 ^0) Conditions for a lower hazard of mortality
MGT043 ( -1 +1 ^0) Conditions for a higher hazard of mortality
MGT044 ( -1 +1 ^0) Capability increases monotonically with age
MGT045 ( -1 +1 ^0) Structural position increases monotonically with age
MGT046 ( -1 +1 ^0) Unendowed organization's hazard of mortality declines with age
MGT047 ( -1 +1 ^0) Conditions for changing hazard of mortality
MGT048 ( -1 +1 ^0) Capability decreases monotonically with its age
MGT049 ( -1 +1 ^0) Structural position does not vary with its age
MGT050 ( -1 +1 ^0) Unendowed organization's hazard of mortality increases with age
MGT051 ( -1 +1 ^0) Conditions for constant then increasing hazard of mortality
MGT052 ( -1 +1 ^0) The environment at any time is similar with itself
MGT053 ( -1 +1 ^0) The dissimilarity relation is symmetric
MGT054 ( -1 +1 ^0) Hazard of mortality increases in a drifting environment
MGT055 ( -1 +1 ^0) Conditions for a constant then jumping hazard of mortality 1
MGT056 ( -1 +1 ^0) Conditions for a constant then jumping hazard of mortality 2
MGT057 ( -1 +1 ^0) Conditions for a constant then increasing hazard of mortality
MGT058 ( -1 +1 ^0) An organization's position cannot be both fragile and robust
MGT059 ( -1 +1 ^0) Hazard of mortality is constant during periods of immunity
MGT060 ( -1 +1 ^0) Hazard of mortality is lower during periods of immunity
MGT061 ( -1 +1 ^0) Conditions for an in reasing hazard of mortality
MGT062 ( -1 +1 ^0) Condictions for decreasing hazard of mortality
MGT063 ( -1 +1 ^0) Conditions for increasing then decreasing hazard of mortality
MGT064 ( -1 +1 ^0) Conditions for a decreasing then increasing hazard of mortality
MGT065 ( -1 +1 ^0) Long-run hazard of mortality
MGT066 ( -1 +1 ^0) Inequalities.
-------------------------------------------------------------------------------
Domain MSC = Miscellaneous.
28 problems (16 abstract, 21 CNF, 7 FOF, 0 THF)
-------------------------------------------------------------------------------
MSC001 ( -1 +0 ^0) A Blind Hand Problem
MSC002 ( -2 +0 ^0) A Blind Hand Problem
MSC003 ( -1 +0 ^0) Show that the boy, John, has 2 hands
MSC004 ( -1 +0 ^0) Show that the boy, John, has 10 fingers
MSC005 ( -1 +0 ^0) The evaluation of XOR expressions
MSC006 ( -1 +0 ^0) A "non-obvious" problem
MSC007 ( -2 +0 ^0) Cook pigeon-hole problem
MSC008 ( -3 +0 ^0) The (in)constructability of Graeco-Latin Squares
MSC009 ( -1 +1 ^0) Definitions of a family structure
MSC010 ( -0 +1 ^0) Simple, but hard, obligation from proof verification
MSC011 ( -0 +1 ^0) Drinker paradox
MSC012 ( -0 +1 ^0) A serial and transitive relation inconsistent for non-empty domain
MSC013 ( -0 +1 ^0) Single-valued relation between 5-tuple and domain element
MSC014 ( -0 +1 ^0) Find a model with a functional relation which is injective, n=4
MSC015 ( -8 +0 ^0) Binary counter k=05
MSC016 ( -0 +1 ^0) Problem from question answering system
-------------------------------------------------------------------------------
Domain NLP = Natural Language Processing.
516 problems (258 abstract, 258 CNF, 258 FOF, 0 THF)
-------------------------------------------------------------------------------
NLP001 ( -1 +1 ^0) "The old dirty white Chevy" problem
NLP002 ( -1 +1 ^0) "The old dirty white Chevy" problem 2
NLP003 ( -1 +1 ^0) "The old dirty white Chevy" problem 3
NLP004 ( -1 +1 ^0) "The old dirty white Chevy" problem 4
NLP005 ( -1 +1 ^0) "The old dirty white Chevy" problem 5
NLP006 ( -1 +1 ^0) "The old dirty white Chevy" problem 6
NLP007 ( -1 +1 ^0) "The old dirty white Chevy" problem 7
NLP008 ( -1 +1 ^0) "The old dirty white Chevy" problem 8
NLP009 ( -1 +1 ^0) "The old dirty white Chevy" problem 9
NLP011 ( -1 +1 ^0) "The old dirty white Chevy" problem 11
NLP012 ( -1 +1 ^0) "The old dirty white Chevy" problem 12
NLP013 ( -1 +1 ^0) "The old dirty white Chevy" problem 13
NLP014 ( -1 +1 ^0) "The old dirty white Chevy" problem 14
NLP015 ( -1 +1 ^0) "The old dirty white Chevy" problem 15
NLP016 ( -1 +1 ^0) "The old dirty white Chevy" problem 16
NLP017 ( -1 +1 ^0) "The old dirty white Chevy" problem 17
NLP018 ( -1 +1 ^0) "The old dirty white Chevy" problem 18
NLP019 ( -1 +1 ^0) "The old dirty white Chevy" problem 19
NLP020 ( -1 +1 ^0) "The old dirty white Chevy" problem 20
NLP021 ( -1 +1 ^0) "The old dirty white Chevy" problem 21
NLP022 ( -1 +1 ^0) "The old dirty white Chevy" problem 22
NLP023 ( -1 +1 ^0) Mia wants to dance, problem 1
NLP024 ( -1 +1 ^0) Mia wants to dance, problem 2 
NLP025 ( -1 +1 ^0) Mia wants to dance, problem 3
NLP026 ( -1 +1 ^0) Three young guys, problem 1
NLP027 ( -1 +1 ^0) Three young guys, problem 2
NLP028 ( -1 +1 ^0) Three young guys, problem 3
NLP029 ( -1 +1 ^0) Three young guys, problem 4
NLP030 ( -1 +1 ^0) Three young guys, problem 5
NLP031 ( -1 +1 ^0) Three young guys, problem 6
NLP032 ( -1 +1 ^0) Three young guys, problem 7
NLP033 ( -1 +1 ^0) Three young guys, problem 8
NLP034 ( -1 +1 ^0) Three young guys, problem 9
NLP035 ( -1 +1 ^0) Three young guys, problem 10
NLP036 ( -1 +1 ^0) Three young guys, problem 11
NLP037 ( -1 +1 ^0) Three young guys, problem 12
NLP038 ( -1 +1 ^0) Three young guys, problem 13
NLP039 ( -1 +1 ^0) Three young guys, problem 14
NLP040 ( -1 +1 ^0) Three young guys, problem 15
NLP041 ( -1 +1 ^0) Three young guys, problem 16
NLP042 ( -1 +1 ^0) Mia ordered a shake, problem 1
NLP043 ( -1 +1 ^0) Mia ordered a shake, problem 2
NLP044 ( -1 +1 ^0) Mia ordered a shake, problem 3
NLP045 ( -1 +1 ^0) Mia ordered a shake, problem 4
NLP046 ( -1 +1 ^0) Mia ordered a shake, problem 5
NLP047 ( -1 +1 ^0) Mia ordered a shake, problem 6
NLP048 ( -1 +1 ^0) Mia ordered a shake, problem 7
NLP049 ( -1 +1 ^0) Mia ordered a shake, problem 7
NLP050 ( -1 +1 ^0) Mia ordered a shake, problem 8
NLP051 ( -1 +1 ^0) Mia ordered a shake, problem 9
NLP052 ( -1 +1 ^0) Mia ordered a shake, problem 10
NLP053 ( -1 +1 ^0) Mia ordered a shake, problem 11
NLP054 ( -1 +1 ^0) Mia ordered a shake, problem 12
NLP055 ( -1 +1 ^0) Mia ordered a shake, problem 13
NLP056 ( -1 +1 ^0) Mia ordered a shake, problem 14
NLP057 ( -1 +1 ^0) Mia ordered a shake, problem 15
NLP058 ( -1 +1 ^0) Mia ordered a shake, problem 16
NLP059 ( -1 +1 ^0) A man comes out of the bathroom, problem 1
NLP060 ( -1 +1 ^0) A man comes out of the bathroom, problem 2
NLP061 ( -1 +1 ^0) A man comes out of the bathroom, problem 3
NLP062 ( -1 +1 ^0) A man comes out of the bathroom, problem 4
NLP063 ( -1 +1 ^0) A man comes out of the bathroom, problem 5
NLP064 ( -1 +1 ^0) A man comes out of the bathroom, problem 6
NLP065 ( -1 +1 ^0) A man comes out of the bathroom, problem 7
NLP066 ( -1 +1 ^0) A man comes out of the bathroom, problem 8
NLP067 ( -1 +1 ^0) A man comes out of the bathroom, problem 8
NLP068 ( -1 +1 ^0) A man comes out of the bathroom, problem 9
NLP069 ( -1 +1 ^0) A man comes out of the bathroom, problem 10
NLP070 ( -1 +1 ^0) A man comes out of the bathroom, problem 11
NLP071 ( -1 +1 ^0) A man comes out of the bathroom, problem 12
NLP072 ( -1 +1 ^0) A man comes out of the bathroom, problem 13
NLP073 ( -1 +1 ^0) A man comes out of the bathroom, problem 14
NLP074 ( -1 +1 ^0) A man comes out of the bathroom, problem 15
NLP075 ( -1 +1 ^0) A man comes out of the bathroom, problem 15
NLP076 ( -1 +1 ^0) A man comes out of the bathroom, problem 16
NLP077 ( -1 +1 ^0) A man comes out of the bathroom, problem 17
NLP078 ( -1 +1 ^0) A man comes out of the bathroom, problem 18
NLP079 ( -1 +1 ^0) A man comes out of the bathroom, problem 19
NLP080 ( -1 +1 ^0) A man comes out of the bathroom, problem 20
NLP081 ( -1 +1 ^0) A man comes out of the bathroom, problem 21
NLP082 ( -1 +1 ^0) A man comes out of the bathroom, problem 22
NLP083 ( -1 +1 ^0) A man comes out of the bathroom, problem 23
NLP084 ( -1 +1 ^0) A man comes out of the bathroom, problem 24
NLP085 ( -1 +1 ^0) A man comes out of the bathroom, problem 25
NLP086 ( -1 +1 ^0) A man comes out of the bathroom, problem 26
NLP087 ( -1 +1 ^0) A man comes out of the bathroom, problem 27
NLP088 ( -1 +1 ^0) A man comes out of the bathroom, problem 28
NLP089 ( -1 +1 ^0) A man comes out of the bathroom, problem 29
NLP090 ( -1 +1 ^0) A man comes out of the bathroom, problem 30
NLP091 ( -1 +1 ^0) A man comes out of the bathroom, problem 31
NLP092 ( -1 +1 ^0) A man comes out of the bathroom, problem 32
NLP093 ( -1 +1 ^0) A man comes out of the bathroom, problem 33
NLP094 ( -1 +1 ^0) Every customer in a restaurant, problem 1
NLP095 ( -1 +1 ^0) Every customer in a restaurant, problem 2
NLP096 ( -1 +1 ^0) Every customer in a restaurant, problem 3
NLP097 ( -1 +1 ^0) Every customer in a restaurant, problem 4
NLP098 ( -1 +1 ^0) Every customer in a restaurant, problem 4
NLP099 ( -1 +1 ^0) Every customer in a restaurant, problem 6
NLP100 ( -1 +1 ^0) Every customer in a restaurant, problem 7
NLP101 ( -1 +1 ^0) Every customer in a restaurant, problem 8
NLP102 ( -1 +1 ^0) Every customer in a restaurant, problem 9
NLP103 ( -1 +1 ^0) Every customer in a restaurant, problem 10
NLP104 ( -1 +1 ^0) Every customer in a restaurant, problem 11
NLP105 ( -1 +1 ^0) Every customer in a restaurant, problem 12
NLP106 ( -1 +1 ^0) Every customer in a restaurant, problem 13
NLP107 ( -1 +1 ^0) Every customer in a restaurant, problem 14
NLP108 ( -1 +1 ^0) Every customer in a restaurant, problem 15
NLP109 ( -1 +1 ^0) Every customer in a restaurant, problem 16
NLP110 ( -1 +1 ^0) Every customer in a restaurant, problem 17
NLP111 ( -1 +1 ^0) Every customer in a restaurant, problem 18
NLP112 ( -1 +1 ^0) Every customer in a restaurant, problem 19
NLP113 ( -1 +1 ^0) Every customer in a restaurant, problem 20
NLP114 ( -1 +1 ^0) An old dirty white Chevy, problem 1
NLP115 ( -1 +1 ^0) An old dirty white Chevy, problem 2
NLP116 ( -1 +1 ^0) An old dirty white Chevy, problem 3
NLP117 ( -1 +1 ^0) An old dirty white Chevy, problem 4
NLP118 ( -1 +1 ^0) An old dirty white Chevy, problem 5
NLP119 ( -1 +1 ^0) An old dirty white Chevy, problem 6
NLP120 ( -1 +1 ^0) An old dirty white Chevy, problem 7
NLP121 ( -1 +1 ^0) An old dirty white Chevy, problem 8
NLP122 ( -1 +1 ^0) An old dirty white Chevy, problem 9
NLP123 ( -1 +1 ^0) An old dirty white Chevy, problem 10
NLP124 ( -1 +1 ^0) An old dirty white Chevy, problem 11
NLP125 ( -1 +1 ^0) An old dirty white Chevy, problem 12
NLP126 ( -1 +1 ^0) An old dirty white Chevy, problem 13
NLP127 ( -1 +1 ^0) An old dirty white Chevy, problem 14
NLP128 ( -1 +1 ^0) An old dirty white Chevy, problem 15
NLP129 ( -1 +1 ^0) An old dirty white Chevy, problem 16
NLP130 ( -1 +1 ^0) An old dirty white Chevy, problem 17
NLP131 ( -1 +1 ^0) An old dirty white Chevy, problem 18
NLP132 ( -1 +1 ^0) An old dirty white Chevy, problem 19
NLP133 ( -1 +1 ^0) An old dirty white Chevy, problem 20
NLP134 ( -1 +1 ^0) An old dirty white Chevy, problem 21
NLP135 ( -1 +1 ^0) An old dirty white Chevy, problem 22
NLP136 ( -1 +1 ^0) An old dirty white Chevy, problem 23
NLP137 ( -1 +1 ^0) An old dirty white Chevy, problem 24
NLP138 ( -1 +1 ^0) An old dirty white Chevy, problem 25
NLP139 ( -1 +1 ^0) An old dirty white Chevy, problem 26
NLP140 ( -1 +1 ^0) An old dirty white Chevy, problem 27
NLP141 ( -1 +1 ^0) An old dirty white Chevy, problem 28
NLP142 ( -1 +1 ^0) An old dirty white Chevy, problem 29
NLP143 ( -1 +1 ^0) An old dirty white Chevy, problem 30
NLP144 ( -1 +1 ^0) An old dirty white Chevy, problem 31
NLP145 ( -1 +1 ^0) An old dirty white Chevy, problem 32
NLP146 ( -1 +1 ^0) An old dirty white Chevy, problem 33
NLP147 ( -1 +1 ^0) An old dirty white Chevy, problem 34
NLP148 ( -1 +1 ^0) An old dirty white Chevy, problem 35
NLP149 ( -1 +1 ^0) An old dirty white Chevy, problem 36
NLP150 ( -1 +1 ^0) An old dirty white Chevy, problem 37
NLP151 ( -1 +1 ^0) An old dirty white Chevy, problem 38
NLP152 ( -1 +1 ^0) An old dirty white Chevy, problem 39
NLP153 ( -1 +1 ^0) An old dirty white Chevy, problem 40
NLP154 ( -1 +1 ^0) An old dirty white Chevy, problem 41
NLP155 ( -1 +1 ^0) An old dirty white Chevy, problem 42
NLP156 ( -1 +1 ^0) An old dirty white Chevy, problem 43
NLP157 ( -1 +1 ^0) An old dirty white Chevy, problem 44
NLP158 ( -1 +1 ^0) An old dirty white Chevy, problem 45
NLP159 ( -1 +1 ^0) An old dirty white Chevy, problem 46
NLP160 ( -1 +1 ^0) An old dirty white Chevy, problem 47
NLP161 ( -1 +1 ^0) An old dirty white Chevy, problem 48
NLP162 ( -1 +1 ^0) An old dirty white Chevy, problem 49
NLP163 ( -1 +1 ^0) An old dirty white Chevy, problem 50
NLP164 ( -1 +1 ^0) An old dirty white Chevy, problem 51
NLP165 ( -1 +1 ^0) An old dirty white Chevy, problem 52
NLP166 ( -1 +1 ^0) An old dirty white Chevy, problem 53
NLP167 ( -1 +1 ^0) An old dirty white Chevy, problem 54
NLP168 ( -1 +1 ^0) An old dirty white Chevy, problem 55
NLP169 ( -1 +1 ^0) An old dirty white Chevy, problem 56
NLP170 ( -1 +1 ^0) An old dirty white Chevy, problem 57
NLP171 ( -1 +1 ^0) An old dirty white Chevy, problem 58
NLP172 ( -1 +1 ^0) An old dirty white Chevy, problem 59
NLP173 ( -1 +1 ^0) An old dirty white Chevy, problem 60
NLP174 ( -1 +1 ^0) An old dirty white Chevy, problem 61
NLP175 ( -1 +1 ^0) An old dirty white Chevy, problem 62
NLP176 ( -1 +1 ^0) An old dirty white Chevy, problem 63
NLP177 ( -1 +1 ^0) An old dirty white Chevy, problem 64
NLP178 ( -1 +1 ^0) An old dirty white Chevy, problem 65
NLP179 ( -1 +1 ^0) An old dirty white Chevy, problem 66
NLP180 ( -1 +1 ^0) An old dirty white Chevy, problem 67
NLP181 ( -1 +1 ^0) An old dirty white Chevy, problem 68
NLP182 ( -1 +1 ^0) An old dirty white Chevy, problem 69
NLP183 ( -1 +1 ^0) An old dirty white Chevy, problem 70
NLP184 ( -1 +1 ^0) An old dirty white Chevy, problem 71
NLP185 ( -1 +1 ^0) An old dirty white Chevy, problem 72
NLP186 ( -1 +1 ^0) An old dirty white Chevy, problem 73
NLP187 ( -1 +1 ^0) An old dirty white Chevy, problem 74
NLP188 ( -1 +1 ^0) An old dirty white Chevy, problem 75
NLP189 ( -1 +1 ^0) An old dirty white Chevy, problem 76
NLP190 ( -1 +1 ^0) An old dirty white Chevy, problem 77
NLP191 ( -1 +1 ^0) An old dirty white Chevy, problem 78
NLP192 ( -1 +1 ^0) An old dirty white Chevy, problem 79
NLP193 ( -1 +1 ^0) An old dirty white Chevy, problem 80
NLP194 ( -1 +1 ^0) An old dirty white Chevy, problem 81
NLP195 ( -1 +1 ^0) An old dirty white Chevy, problem 82
NLP196 ( -1 +1 ^0) An old dirty white Chevy, problem 83
NLP197 ( -1 +1 ^0) An old dirty white Chevy, problem 84
NLP198 ( -1 +1 ^0) An old dirty white Chevy, problem 85
NLP199 ( -1 +1 ^0) An old dirty white Chevy, problem 86
NLP200 ( -1 +1 ^0) An old dirty white Chevy, problem 87
NLP201 ( -1 +1 ^0) An old dirty white Chevy, problem 88
NLP202 ( -1 +1 ^0) An old dirty white Chevy, problem 89
NLP203 ( -1 +1 ^0) An old dirty white Chevy, problem 90
NLP204 ( -1 +1 ^0) An old dirty white Chevy, problem 91
NLP205 ( -1 +1 ^0) An old dirty white Chevy, problem 92
NLP206 ( -1 +1 ^0) An old dirty white Chevy, problem 93
NLP207 ( -1 +1 ^0) An old dirty white Chevy, problem 94
NLP208 ( -1 +1 ^0) An old dirty white Chevy, problem 95
NLP209 ( -1 +1 ^0) An old dirty white Chevy, problem 96
NLP210 ( -1 +1 ^0) An old dirty white Chevy, problem 97
NLP211 ( -1 +1 ^0) An old dirty white Chevy, problem 98
NLP212 ( -1 +1 ^0) An old dirty white Chevy, problem 99
NLP213 ( -1 +1 ^0) An old dirty white Chevy, problem 100
NLP214 ( -1 +1 ^0) An old dirty white Chevy, problem 101
NLP215 ( -1 +1 ^0) An old dirty white Chevy, problem 102
NLP216 ( -1 +1 ^0) An old dirty white Chevy, problem 103
NLP217 ( -1 +1 ^0) An old dirty white Chevy, problem 104
NLP218 ( -1 +1 ^0) An old dirty white Chevy, problem 105
NLP219 ( -1 +1 ^0) An old dirty white Chevy, problem 106
NLP220 ( -1 +1 ^0) Vincent believes that every man smokes, problem 1
NLP221 ( -1 +1 ^0) Vincent believes that every man smokes, problem 2
NLP222 ( -1 +1 ^0) Vincent believes that every man smokes, problem 3
NLP223 ( -1 +1 ^0) Vincent believes that every man smokes, problem 4
NLP224 ( -1 +1 ^0) Vincent believes that every man smokes, problem 5
NLP225 ( -1 +1 ^0) Vincent believes that every man smokes, problem 6
NLP226 ( -1 +1 ^0) Vincent believes that every man smokes, problem 7
NLP227 ( -1 +1 ^0) Vincent believes that every man smokes, problem 8
NLP228 ( -1 +1 ^0) Vincent believes that every man smokes, problem 9
NLP229 ( -1 +1 ^0) Vincent believes that every man smokes, problem 10
NLP230 ( -1 +1 ^0) Vincent believes that every man smokes, problem 11
NLP231 ( -1 +1 ^0) Vincent believes that every man smokes, problem 12
NLP232 ( -1 +1 ^0) Vincent believes that every man smokes, problem 13
NLP233 ( -1 +1 ^0) Vincent believes that every man smokes, problem 14
NLP234 ( -1 +1 ^0) Vincent believes that every man smokes, problem 15
NLP235 ( -1 +1 ^0) Vincent believes that every man smokes, problem 16
NLP236 ( -1 +1 ^0) Vincent believes that every man smokes, problem 17
NLP237 ( -1 +1 ^0) Vincent believes that every man smokes, problem 18
NLP238 ( -1 +1 ^0) Vincent believes that every man smokes, problem 19
NLP239 ( -1 +1 ^0) Vincent believes that every man smokes, problem 20
NLP240 ( -1 +1 ^0) Vincent believes that every man smokes, problem 21
NLP241 ( -1 +1 ^0) Vincent believes that every man smokes, problem 22
NLP242 ( -1 +1 ^0) Vincent believes that every man smokes, problem 23
NLP243 ( -1 +1 ^0) Vincent believes that every man smokes, problem 24
NLP244 ( -1 +1 ^0) Vincent believes that every man smokes, problem 25
NLP245 ( -1 +1 ^0) Vincent believes that every man smokes, problem 26
NLP246 ( -1 +1 ^0) Vincent believes that every man smokes, problem 27
NLP247 ( -1 +1 ^0) Vincent believes that every man smokes, problem 28
NLP248 ( -1 +1 ^0) Vincent believes that every man smokes, problem 29
NLP249 ( -1 +1 ^0) Vincent believes that every man smokes, problem 30
NLP250 ( -1 +1 ^0) Vincent believes that every man smokes, problem 31
NLP251 ( -1 +1 ^0) Vincent believes that every man smokes, problem 32
NLP252 ( -1 +1 ^0) Vincent believes that every man smokes, problem 33
NLP253 ( -1 +1 ^0) Vincent believes that every man smokes, problem 34
NLP254 ( -1 +1 ^0) Vincent believes that every man smokes, problem 35
NLP255 ( -1 +1 ^0) Vincent believes that every man smokes, problem 36
NLP256 ( -1 +1 ^0) Vincent believes that every man smokes, problem 37
NLP257 ( -1 +1 ^0) Vincent believes that every man smokes, problem 38
NLP258 ( -1 +1 ^0) Vincent believes that every man smokes, problem 39
NLP259 ( -1 +1 ^0) Vincent believes that every man smokes, problem 40
-------------------------------------------------------------------------------
Domain NUM = Number Theory.
672 problems (619 abstract, 315 CNF, 136 FOF, 221 THF)
-------------------------------------------------------------------------------
NUM001 ( -1 +0 ^0) (A + B) + C = A + (B + C)
NUM002 ( -1 +0 ^0) (X - Y) + Z = X + (Z - Y)
NUM003 ( -1 +0 ^0) A + (B - C) = (A - C) + B
NUM004 ( -1 +0 ^0) (A + B) - C = A + (B - C)
NUM005 ( -1 +0 ^0) Greatest Common Divisor
NUM006 ( -1 +0 ^0) Goldbach conjecture
NUM007 ( -1 +0 ^0) Least Common Multiple
NUM008 ( -1 +0 ^0) Peano axiom 0
NUM009 ( -1 +0 ^0) Peano axiom 1
NUM010 ( -1 +0 ^0) Peano axiom 2
NUM011 ( -1 +0 ^0) Peano axiom 3
NUM012 ( -1 +0 ^0) Peano axiom 4
NUM013 ( -1 +0 ^0) Peano axiom 5
NUM014 ( -1 +0 ^0) If a is a prime and a = b^2/c^2 then a divides b
NUM015 ( -1 +0 ^0) Any number greater than 1 has a prime divisor
NUM016 ( -2 +0 ^0) There exist infinitely many primes
NUM017 ( -2 +0 ^0) Square root of this prime is irrational
NUM018 ( -1 +0 ^0) There is an infinite number of twin prime numbers
NUM019 ( -1 +0 ^0) Symmetry of equality can be derived
NUM020 ( -1 +0 ^1) a + 1 = successor(a)
NUM021 ( -1 +0 ^1) If a <= b < c, then c cannot divide a
NUM022 ( -1 +0 ^0) Numerator divisble by smaller denominators
NUM023 ( -1 +0 ^0) Zero is less than all successor numbers
NUM024 ( -1 +0 ^0) No number is less than itself
NUM025 ( -2 +0 ^0) If a<b then not b<a
NUM026 ( -1 +0 ^0) Less preserved over multiplication by a number
NUM027 ( -1 +0 ^0) If a >= b and b*c <= a*c, then c = 0
NUM028 ( -1 +0 ^0) Symmetrization property 1
NUM029 ( -1 +0 ^0) Symmetrization property 2
NUM030 ( -1 +0 ^0) Symmetrization property 3
NUM031 ( -1 +0 ^0) Symmetrization property 4
NUM032 ( -1 +0 ^0) Symmetrization property 5
NUM033 ( -1 +0 ^0) Symmetrization property 6
NUM034 ( -1 +0 ^0) Symmetrization is idempotent
NUM035 ( -1 +0 ^0) Domain equals range of symmetrization
NUM036 ( -1 +0 ^0) Symmetrization property 7
NUM037 ( -1 +0 ^0) Symmetrization property 8
NUM038 ( -1 +0 ^0) Symmetrization property 9
NUM039 ( -1 +0 ^0) Irreflexive class property 1
NUM040 ( -1 +0 ^0) Irreflexive class property 2
NUM041 ( -1 +0 ^0) Irreflexive class property 3
NUM042 ( -1 +0 ^0) Irreflexive class property 4
NUM043 ( -1 +0 ^0) Irreflexive class property 5
NUM044 ( -1 +0 ^0) Irreflexive class property 6
NUM045 ( -1 +0 ^0) Irreflexive class property 7
NUM046 ( -1 +0 ^0) Connected class property 1
NUM047 ( -1 +0 ^0) Connected class property 2
NUM048 ( -1 +0 ^0) Connected class property 3
NUM049 ( -1 +0 ^0) Connected class property 4
NUM050 ( -1 +0 ^0) Connected class property 5
NUM051 ( -1 +0 ^0) Everything is connected to the null class
NUM052 ( -1 +0 ^0) Transitive ordering property 1
NUM053 ( -1 +0 ^0) Transitive ordering property 2
NUM054 ( -1 +0 ^0) Asymmetric class property 1
NUM055 ( -1 +0 ^0) Asymmetric class property 2
NUM056 ( -1 +0 ^0) Asymmetric class property 3
NUM057 ( -1 +0 ^0) Segments property 1
NUM058 ( -1 +0 ^0) Segments property 2
NUM059 ( -1 +0 ^0) Segments property 3
NUM060 ( -1 +0 ^0) Segments property 4
NUM061 ( -1 +0 ^0) Segments property 5
NUM062 ( -1 +0 ^0) Segments property 6
NUM063 ( -1 +0 ^0) Segments property 7
NUM064 ( -1 +0 ^0) Least(xr,u) is unique
NUM065 ( -1 +0 ^0) Well ordering property 1
NUM066 ( -1 +0 ^0) Corollary to well ordering property 1
NUM067 ( -1 +0 ^0) Well ordering property 2
NUM068 ( -1 +0 ^0) Well ordering property 3
NUM069 ( -1 +0 ^0) Corollary to well ordering property 3
NUM070 ( -1 +0 ^0) A well-order is asymmetric
NUM071 ( -1 +0 ^0) Well ordering is irreflexive
NUM072 ( -1 +0 ^0) Well ordering property 4
NUM073 ( -1 +0 ^0) Corollary to well ordering property 4
NUM074 ( -1 +0 ^0) Well ordering property 5
NUM075 ( -1 +0 ^0) Well ordering property 6
NUM076 ( -1 +0 ^0) Well ordering property 7
NUM077 ( -1 +0 ^0) Corollary 1 to well ordering property 7
NUM078 ( -1 +0 ^0) Corollary 2 to well ordering property 7
NUM079 ( -1 +0 ^0) Well ordering property 8
NUM080 ( -1 +0 ^0) Well ordering property 9
NUM081 ( -1 +0 ^0) Corollary to well ordering property 9
NUM082 ( -1 +0 ^0) Uniqueness of the least element of a non-empty subset
NUM083 ( -1 +0 ^0) Transitive class property 1
NUM084 ( -1 +0 ^0) Alternate transitive class definition, part 1
NUM085 ( -1 +0 ^0) Alternate transitive class definition, part 2
NUM086 ( -1 +0 ^0) Transitive class property 2
NUM087 ( -1 +0 ^0) Transitive class property 3
NUM088 ( -1 +0 ^0) Transitive class property 4
NUM089 ( -1 +0 ^0) Sections property 1
NUM090 ( -1 +0 ^0) Corollary to sections property 1
NUM091 ( -1 +0 ^0) Sections property 2
NUM092 ( -1 +0 ^0) Corollary 1 to sections property 2
NUM093 ( -1 +0 ^0) Corollary 2 to sections property 2
NUM094 ( -1 +0 ^0) Sections property 3
NUM095 ( -1 +0 ^0) Sections property 4
NUM096 ( -1 +0 ^0) Sections property 5
NUM097 ( -1 +0 ^0) Corollary to sections property 5
NUM098 ( -1 +0 ^0) Ordinal property 1
NUM099 ( -1 +0 ^0) Corollary to ordinal property 1
NUM100 ( -1 +0 ^0) Ordinal property 2
NUM101 ( -1 +0 ^0) Ordinal property 3
NUM102 ( -1 +0 ^0) Ordinal property 4
NUM103 ( -1 +0 ^0) Corollary to ordinal property 4
NUM104 ( -1 +0 ^0) Ordinal property 5
NUM105 ( -1 +0 ^0) Ordinal property 6
NUM106 ( -1 +0 ^0) Ordinal property 7
NUM107 ( -1 +0 ^0) Ordinal property 8
NUM108 ( -1 +0 ^0) Ordinal property 9
NUM109 ( -1 +0 ^0) Ordinal property 10
NUM110 ( -1 +0 ^0) Corollary to ordinal property 10
NUM111 ( -1 +0 ^0) Ordinal property 11
NUM112 ( -1 +0 ^0) Ordinal property 12
NUM113 ( -1 +0 ^0) Ordinal property 13
NUM114 ( -1 +0 ^0) Corollary to ordinal property 13
NUM115 ( -1 +0 ^0) The class of ordinals is not a set.
NUM116 ( -1 +0 ^0) Corollary to the class of ordinals is not set
NUM117 ( -1 +0 ^0) Corollary to ordinal class and numbers
NUM118 ( -1 +0 ^0) Ordinal property 14
NUM119 ( -1 +0 ^0) Corollary to transitive class property 4
NUM120 ( -1 +0 ^0) Transfinite induction, part 1
NUM121 ( -1 +0 ^0) Transfinite induction, part 2
NUM122 ( -1 +0 ^0) Transfinite induction, part 3
NUM123 ( -1 +0 ^0) Alternate transfinite induction 3
NUM124 ( -1 +0 ^0) Condensed statement of transfinite induction
NUM125 ( -1 +0 ^0) Complete induction upto omega
NUM126 ( -1 +0 ^0) Alternate 1 for transfinite induction, part 1
NUM127 ( -1 +0 ^0) Alternate 1 for transfinite induction, part 2
NUM128 ( -1 +0 ^0) Alternate 1 for transfinite induction, part 3
NUM129 ( -1 +0 ^0) Alternate 2 for transfinite induction, part 1
NUM130 ( -1 +0 ^0) Alternate 2 for transfinite induction, part 2
NUM131 ( -1 +0 ^0) Alternate 2 for transfinite induction, part 3
NUM132 ( -1 +0 ^0) Union of successor relation ordinal
NUM133 ( -1 +0 ^0) Corollary to union of successor ordinal
NUM134 ( -1 +0 ^0) Successor relation of an ordinal is an ordinal
NUM135 ( -1 +0 ^0) The null class is the smallest ordinal
NUM136 ( -1 +0 ^0) Transitivity of ordinals
NUM137 ( -1 +0 ^0) Condition 1 for complete induction
NUM138 ( -1 +0 ^0) Condition 2 for complete induction
NUM139 ( -1 +0 ^0) Condition 3 for complete induction
NUM140 ( -1 +0 ^0) The successor of a set is a set, part 1
NUM141 ( -1 +0 ^0) The successor of a set is a set, part 2
NUM142 ( -1 +0 ^0) The successor of a set is a set, part 3
NUM143 ( -1 +0 ^0) Corollary to the successor of a set being a set
NUM144 ( -1 +0 ^0) The successor of a proper class is a class
NUM145 ( -1 +0 ^0) Corollary to the successor of a proper class being a class
NUM146 ( -1 +0 ^0) The successor of a transitive set is transitive
NUM147 ( -1 +0 ^0) The successor of an ordinal is an ordinal
NUM148 ( -1 +0 ^0) The predecessor of an ordinal is an ordinal
NUM149 ( -1 +0 ^0) Successor property 1
NUM150 ( -1 +0 ^0) Corollary 1 to successor property 1
NUM151 ( -1 +0 ^0) Corollary 2 to successor property 1
NUM152 ( -1 +0 ^0) Corollary 3 to successor property 1
NUM153 ( -1 +0 ^0) Corollary 4 to successor property 1
NUM154 ( -1 +0 ^0) Corollary 5 to successor property 1
NUM155 ( -1 +0 ^0) There is no ordinal between x and x + 1
NUM156 ( -1 +0 ^0) Membership condition 1 for kind 1 ordinals
NUM157 ( -1 +0 ^0) Membership condition 2 for kind 1 ordinals
NUM158 ( -1 +0 ^0) Membership condition 3 for kind 1 ordinals
NUM159 ( -1 +0 ^0) Membership condition 4 for kind 1 ordinals
NUM160 ( -1 +0 ^0) Kind 1 ordinals is a class of ordinals
NUM161 ( -1 +0 ^0) Corollary to kind 1 ordinals being a class of ordinals
NUM162 ( -1 +0 ^0) Successor property 2
NUM163 ( -1 +0 ^0) Inductive is closed under union
NUM164 ( -1 +0 ^0) Inductive is closed under intersection
NUM165 ( -1 +0 ^0) Corollary to omega definition, part 1
NUM166 ( -1 +0 ^0) Corollary to omega definition, part 2
NUM167 ( -1 +0 ^0) Successor property 3
NUM168 ( -1 +0 ^0) Corollary to successor property 3
NUM169 ( -1 +0 ^0) Successor property 4
NUM170 ( -1 +0 ^0) Successor property 5
NUM171 ( -1 +0 ^0) Successor property 6
NUM172 ( -1 +0 ^0) The successor relation of a set is different from the set
NUM173 ( -1 +0 ^0) Successor property 7
NUM174 ( -1 +0 ^0) Successor property 8
NUM175 ( -1 +0 ^0) Successor property 9
NUM176 ( -1 +0 ^0) Successor property 10
NUM177 ( -1 +0 ^0) Condition 1 for a class to be inductive
NUM178 ( -1 +0 ^0) Condition 2 for a class to be inductive
NUM179 ( -1 +0 ^0) Condition 3 for a class to be inductive
NUM180 ( -1 +0 ^0) Limit ordinals are ordinals
NUM181 ( -1 +0 ^0) The null class is not a limit ordinal
NUM182 ( -1 +0 ^0) Only limit ordinals equal their successors
NUM183 ( -1 +0 ^0) Ordinals are either kind 1 or limit
NUM184 ( -1 +0 ^0) Corollary to ordinals are either kind 1 or limit
NUM185 ( -1 +0 ^0) Limit ordinals are not members
NUM186 ( -1 +0 ^0) Omega property 1
NUM187 ( -1 +0 ^0) Lemma for successor property 8
NUM188 ( -1 +0 ^0) Omega is transitive
NUM189 ( -1 +0 ^0) Omega is an ordinal
NUM190 ( -1 +0 ^0) Omega is not the null class
NUM191 ( -1 +0 ^0) Omega is a limit ordinal
NUM192 ( -1 +0 ^0) Omega is the smallest limit ordinal
NUM193 ( -1 +0 ^0) The sum of ordinals is an ordinal
NUM194 ( -1 +0 ^0) The union of a class of ordinals is a class of ordinals
NUM195 ( -1 +0 ^0) The union of a class of ordinals is transitive
NUM196 ( -1 +0 ^0) The union of a set of ordinals is an ordinal
NUM197 ( -1 +0 ^0) The union of a proper class of ordinals is the class of ordinals
NUM198 ( -1 +0 ^0) The union of a set of ordinals is >= each ordinal in the set
NUM199 ( -1 +0 ^0) Least upper bound property 1
NUM200 ( -1 +0 ^0) If every element of x is <= y, then sum class(x) <= y
NUM201 ( -1 +0 ^0) Least upper bound property 3
NUM202 ( -1 +0 ^0) If the lub of a set of ordinals is a successor, it's in the set
NUM203 ( -1 +0 ^0) Corollary to least upper bound being a successor relation
NUM204 ( -1 +0 ^0) Least upper bound property 5
NUM205 ( -1 +0 ^0) Corollary 1 to least upper bound property 5
NUM206 ( -1 +0 ^0) Corollary 2 to least upper bound property 5
NUM207 ( -1 +0 ^0) Least upper bound property 6
NUM208 ( -1 +0 ^0) Least upper bound property 7
NUM209 ( -1 +0 ^0) Corollary to least upper bound property 7
NUM210 ( -1 +0 ^0) Lemma 1 for least upper bound property 8
NUM211 ( -1 +0 ^0) Lemma 2 for least upper bound property 8
NUM212 ( -1 +0 ^0) Lemma 3 for least upper bound property 8
NUM213 ( -1 +0 ^0) Alternate 3 for transfinite induction
NUM214 ( -1 +0 ^0) Induction up to y
NUM215 ( -1 +0 ^0) Corollary to induction upto y
NUM216 ( -1 +0 ^0) Corollary 1 to rest definition
NUM217 ( -1 +0 ^0) Corollary 2 to rest definition
NUM218 ( -1 +0 ^0) Rest of is a function
NUM219 ( -1 +0 ^0) The domain of rest_of(X) is the domain of X
NUM220 ( -1 +0 ^0) Corollary to the domain of rest_of(X) being the domain of X
NUM221 ( -1 +0 ^0) Rest_of property 1
NUM222 ( -1 +0 ^0) Rest_of is monotonic.
NUM223 ( -1 +0 ^0) Rest relation is a function
NUM224 ( -1 +0 ^0) Rest relation property 1
NUM225 ( -1 +0 ^0) Rest relation property 2
NUM226 ( -1 +0 ^0) Rest relation property 3
NUM227 ( -1 +0 ^0) Rest relation property 4
NUM228 ( -1 +0 ^0) Corollary to recursion equation functions definition
NUM229 ( -1 +0 ^0) Transfinite recursion lemma 0
NUM230 ( -1 +0 ^0) Transfinite recursion lemma 1
NUM231 ( -1 +0 ^0) Transfinite recursion lemma 2
NUM232 ( -1 +0 ^0) Transfinite recursion lemma 3
NUM233 ( -1 +0 ^0) Transfinite recursion lemma 4
NUM234 ( -1 +0 ^0) Transfinite recursion lemma 5
NUM235 ( -1 +0 ^0) Transfinite recursion lemma 6
NUM236 ( -1 +0 ^0) Corollary 1 to transfinite recursion lemma 6
NUM237 ( -1 +0 ^0) Corollary 2 to transfinite recursion lemma 6
NUM238 ( -1 +0 ^0) Transfinite recursion lemma 7
NUM239 ( -1 +0 ^0) Transfinite recursion lemma 8
NUM240 ( -1 +0 ^0) Transfinite recursion lemma 9.1
NUM241 ( -1 +0 ^0) Transfinite recursion lemma 9.2
NUM242 ( -1 +0 ^0) Transfinite recursion lemma 9.3
NUM243 ( -1 +0 ^0) Transfinite recursion lemma 10
NUM244 ( -1 +0 ^0) Transfinite recursion lemma 11
NUM245 ( -2 +0 ^0) Transfinite recursion property 1
NUM246 ( -2 +0 ^0) Transfinite recursion property 2
NUM247 ( -2 +0 ^0) Transfinite recursion property 3
NUM248 ( -2 +0 ^0) Transfinite recursion property 4
NUM249 ( -2 +0 ^0) Transfinite recursion property 5
NUM250 ( -2 +0 ^0) Transfinite recursion property 6
NUM251 ( -2 +0 ^0) Transfinite recursion property 7
NUM252 ( -2 +0 ^0) Transfinite recursion property 8
NUM253 ( -2 +0 ^0) Transfinite recursion property 9
NUM254 ( -2 +0 ^0) Transfinite recursion property 10
NUM255 ( -2 +0 ^0) Transfinite recursion property 11
NUM256 ( -2 +0 ^0) Transfinite recursion property 12
NUM257 ( -2 +0 ^0) Transfinite recursion property 13
NUM258 ( -2 +0 ^0) Transfinite recursion property 14
NUM259 ( -2 +0 ^0) The uniqueness of the function defined by transfinite recursion
NUM260 ( -2 +0 ^0) Alternate 4 for transfinite induction, part 1
NUM261 ( -2 +0 ^0) Alternate 4 for transfinite induction, part 2
NUM262 ( -2 +0 ^0) Alternate 4 for transfinite induction, part 3
NUM263 ( -2 +0 ^0) Alternate 4 for transfinite induction, part 4
NUM264 ( -2 +0 ^0) Alternate 4 for transfinite induction, part 5
NUM265 ( -1 +0 ^0) Ordinal addition property 1
NUM266 ( -1 +0 ^0) Ordinal addition property 2
NUM267 ( -1 +0 ^0) Ordinal addition property 3
NUM268 ( -1 +0 ^0) Ordinal addition property 4
NUM269 ( -1 +0 ^0) Ordinal addition property 5
NUM270 ( -1 +0 ^0) Ordinal addition property 6
NUM271 ( -1 +0 ^0) Lemma 1 for ordinal addition property 7
NUM272 ( -1 +0 ^0) Lemma 2 for ordinal addition property 7
NUM273 ( -1 +0 ^0) Lemma 3 for ordinal addition property 7
NUM274 ( -1 +0 ^0) Lemma 4 for ordinal addition property 7
NUM275 ( -1 +0 ^0) Lemma 5 for ordinal addition property 7
NUM276 ( -1 +0 ^0) Lemma 6 for ordinal addition property 7
NUM277 ( -2 +0 ^0) Ordinal addition property 7_1
NUM278 ( -1 +0 ^0) Ordinal addition property 7_2
NUM279 ( -1 +0 ^0) Ordinal addition property 8
NUM280 ( -1 +0 ^0) Ordinal multiplication property 1
NUM281 ( -1 +0 ^0) Ordinal multiplication property 2
NUM282 ( -1 +0 ^0) Ordinal multiplication property 3
NUM283 ( -1 +0 ^0) Calculation of factorial
NUM284 ( -1 +0 ^0) Calculation of fibonacci numbers
NUM285 ( -1 +0 ^0) a0 + ... + a5 = b1 + ... + b5, expression in logic
NUM286 ( -3 +0 ^0) Number theory axioms
NUM287 ( -1 +0 ^0) Number theory less axioms
NUM288 ( -1 +0 ^0) Number theory div axioms
NUM289 ( -1 +0 ^0) Number theory (ordinals) axioms, based on NBG set theory
NUM290 ( -0 +1 ^0) 2 < 3
NUM291 ( -0 +1 ^0) 3 !< 2
NUM292 ( -0 +1 ^0) 2 < 13
NUM293 ( -0 +1 ^0) ? < 13
NUM294 ( -0 +1 ^0) 12 < ?
NUM295 ( -0 +1 ^0) ? < ?
NUM296 ( -0 +1 ^0) -2 < 2
NUM297 ( -0 +1 ^0) -4 < -2
NUM298 ( -0 +1 ^0) 2 !< -2
NUM299 ( -0 +1 ^0) -2 !< -4
NUM300 ( -0 +1 ^0) ? < 0
NUM301 ( -0 +1 ^0) ? < -2
NUM302 ( -0 +1 ^0) -2 < ?
NUM303 ( -0 +1 ^0) 31 != 21
NUM304 ( -0 +1 ^0) ? != 12
NUM305 ( -0 +1 ^0) 2 + 3 = 5
NUM306 ( -0 +1 ^0) 23 + 34 = 57
NUM307 ( -0 +1 ^0) 23 + 34 = ?
NUM308 ( -0 +1 ^0) ? + 23 = 34
NUM309 ( -0 +1 ^0) 23 + ? = 34
NUM310 ( -0 +1 ^0) 2 + 3 != 6
NUM311 ( -0 +1 ^0) 2 + 3 = only 5
NUM312 ( -0 +1 ^0) only 2 + 3 = 5
NUM313 ( -0 +1 ^0) 2 + only 3 = 5
NUM314 ( -0 +1 ^0) Show upper boundary
NUM315 ( -0 +1 ^0) -2 + -5 = -7
NUM316 ( -0 +1 ^0) 2 + -5 = -3
NUM317 ( -0 +1 ^0) 5 + -2 = 3
NUM318 ( -0 +1 ^0) 5 + -5 = 0
NUM319 ( -0 +1 ^0) -2 + -5 = ?
NUM320 ( -0 +1 ^0) 2 + -5 = ?
NUM321 ( -0 +1 ^0) 5 + -2 = ?
NUM322 ( -0 +1 ^0) 5 + -5 = ?
NUM323 ( -0 +1 ^0) ? + -5 = -7
NUM324 ( -0 +1 ^0) ? + -5 = -3
NUM325 ( -0 +1 ^0) ? + -2 = 3
NUM326 ( -0 +1 ^0) ? + -5 = 0
NUM327 ( -0 +1 ^0) ? + 0 = ?
NUM328 ( -0 +1 ^0) ?1 + ? = ?1
NUM329 ( -0 +1 ^0) ? + ? = ?
NUM330 ( -0 +1 ^0) XY (X+Y = 8) & X = 4 & Y = 4
NUM331 ( -0 +1 ^0) 6 + 7 = 7 + 6
NUM332 ( -0 +1 ^0) (2 + 3) + 6 = 2 + (3 + 6) 
NUM333 ( -0 +1 ^0) ?XYZ, ((X+Y)+Z) = (X+(Y+Z))
NUM334 ( -0 +1 ^0) 7 - 5 = 2
NUM335 ( -0 +1 ^0) 5 - 3 = only 2
NUM336 ( -0 +1 ^0) only 5 - 2 = 3
NUM337 ( -0 +1 ^0) 5 - only 3 = 2
NUM338 ( -0 +1 ^0) 5 - 3 = only 2
NUM339 ( -0 +1 ^0) Show lower boundary
NUM340 ( -0 +1 ^0) ? - 0 = ?
NUM341 ( -0 +1 ^0) x + y = z <=> z - y = x & z - x = y
NUM342 ( -0 +1 ^0) XY (X + Y = 8) => X - Y = 0
NUM343 ( -0 +1 ^0) -1 < ? & ? < 1 => 21 + ? = 21
NUM344 ( -0 +1 ^0) x+1 = z => z > x
NUM345 ( -0 +1 ^0) 2 + 3 < 6
NUM346 ( -0 +1 ^0) 2 + 3 > 4
NUM347 ( -0 +1 ^0) 2 + 2 = 5
NUM348 ( -0 +1 ^0) X (127 + 1 = X)
NUM349 ( -0 +1 ^0) X (-128 - 1 = X)
NUM350 ( -0 +1 ^0) !XY, (X + X) = Y
NUM351 ( -0 +1 ^0) XY (X + Y) = X
NUM352 ( -0 +1 ^0) ?XY (X+Y) != (X+Y)
NUM353 ( -0 +1 ^0) XYZ ((X+Y)+Z) != (Z+X)+Y)
NUM354 ( -0 +1 ^0) ? != 0 such that ? + ? = 0
NUM355 ( -0 +1 ^0) XY (X+Y = 8) => X = 4, Y = 4
NUM356 ( -0 +1 ^0) ? + 0 != ?
NUM357 ( -0 +1 ^0) ?X (X + 0 != X)
NUM358 ( -0 +1 ^0) !X (X + X = X)
NUM359 ( -0 +1 ^0) !X (X + X != X)
NUM360 ( -0 +1 ^0) ?XY (X + Y = 8) => X - Y = 1
NUM361 ( -0 +1 ^0) !XY (X+Y = 8) => X - Y = 1,
NUM362 ( -0 +1 ^0) !XY (X+Y = 8) => X - Y = 0
NUM363 ( -0 +1 ^0) if (X+Y) = Z then Z > X & Z > Y
NUM364 ( -0 +1 ^0) !XY (X + Y > X - Y)
NUM365 ( -0 +1 ^0) !XY (X - Y > X + Y)
NUM366 ( -0 +1 ^0) 2 + 3 > 7
NUM367 ( -0 +1 ^0) ?XY (X + Y != Y + X)
NUM368 ( -0 +1 ^0) ! - ! = 0
NUM369 ( -0 +1 ^0) ! + 0 = !
NUM370 ( -0 +1 ^0) 0 + ! = !
NUM371 ( -0 +1 ^0) if (X - Y) = Z and Z > 0, then X > Y
NUM372 ( -0 +1 ^0) if (X - Y) = 0, then X = Y
NUM373 ( -0 +1 ^0) ?XYZ, (X+Y) = (Y+X)
NUM374 ( -0 +4 ^0) Disprove Wilkie identity from Tarski's identities
NUM375 ( -0 +5 ^0) Find assignment that goes out of range 0-10, medium difficulty
NUM376 ( -0 +5 ^0) Find assignment in 0-10 to satisfy inequality, hard
NUM377 ( -0 +5 ^0) Find assignment in 0-10 to satisfy inequalities, very hard
NUM378 ( -0 +7 ^0) Find assignment in 0-10 to satisfy 10 inequalities, very very hard
NUM380 ( -0 +1 ^0) Ordinal numbers, theorem 4
NUM381 ( -0 +1 ^0) Ordinal numbers, theorem 5
NUM382 ( -0 +1 ^0) Ordinal numbers, theorem 6
NUM383 ( -0 +1 ^0) Ordinal numbers, theorem 7
NUM385 ( -0 +1 ^0) Ordinal numbers, theorem 12
NUM386 ( -0 +1 ^0) Ordinal numbers, theorem 13
NUM387 ( -0 +1 ^0) Ordinal numbers, theorem 14
NUM388 ( -0 +1 ^0) Ordinal numbers, theorem 19
NUM390 ( -0 +1 ^0) Ordinal numbers, theorem 22
NUM393 ( -0 +1 ^0) Ordinal numbers, theorem 25
NUM394 ( -0 +1 ^0) Ordinal numbers, theorem 26
NUM395 ( -0 +1 ^0) Ordinal numbers, theorem 27
NUM396 ( -0 +1 ^0) Ordinal numbers, theorem 29
NUM397 ( -0 +1 ^0) Ordinal numbers, theorem 30
NUM401 ( -0 +1 ^0) Ordinal numbers, theorem 34
NUM402 ( -0 +1 ^0) Ordinal numbers, theorem 35
NUM403 ( -0 +1 ^0) Ordinal numbers, theorem 36
NUM404 ( -0 +1 ^0) Ordinal numbers, theorem 37
NUM405 ( -0 +1 ^0) Ordinal numbers, theorem 38
NUM406 ( -0 +1 ^0) Ordinal numbers, theorem 39
NUM409 ( -0 +1 ^0) Ordinal numbers, theorem 45
NUM410 ( -0 +1 ^0) Ordinal numbers, theorem 46
NUM411 ( -0 +1 ^0) Ordinal numbers, theorem 47
NUM412 ( -0 +1 ^0) Ordinal numbers, theorem 48
NUM413 ( -0 +1 ^0) Ordinal numbers, theorem 49
NUM414 ( -0 +1 ^0) Ordinal numbers, theorem 50
NUM415 ( -0 +0 ^1) 2 * (3 + 7) = (2 * 5) * (1 + 1)
NUM416 ( -0 +0 ^1) 10 * (10 * 10) = (10 + 10) * (5 * 10)
NUM417 ( -0 +0 ^1) (10 * 10) * (10 * 10) = ((10 * 10) * 10) * 10
NUM418 ( -0 +0 ^1) Find N such that N + 3 = 3
NUM419 ( -0 +0 ^1) Find N such that N + 3 = 4
NUM635 ( -0 +0 ^2) Landau theorem 1 
NUM636 ( -0 +0 ^3) Landau theorem 2 
NUM637 ( -0 +0 ^2) Landau theorem 3 
NUM638 ( -0 +0 ^1) Landau theorem 3a 
NUM639 ( -0 +0 ^1) Landau theorem 4e 
NUM640 ( -0 +0 ^1) Landau theorem 4f 
NUM641 ( -0 +0 ^1) Landau theorem 4g 
NUM642 ( -0 +0 ^1) Landau theorem 4h 
NUM643 ( -0 +0 ^1) Landau theorem 5 
NUM644 ( -0 +0 ^1) Landau theorem 6 
NUM645 ( -0 +0 ^1) Landau theorem 7 
NUM646 ( -0 +0 ^1) Landau theorem 8 
NUM647 ( -0 +0 ^1) Landau theorem 8a 
NUM648 ( -0 +0 ^1) Landau theorem 8b 
NUM649 ( -0 +0 ^1) Landau theorem 9 
NUM650 ( -0 +0 ^1) Landau theorem 9a 
NUM651 ( -0 +0 ^1) Landau theorem 9b 
NUM652 ( -0 +0 ^1) Landau theorem 10c 
NUM653 ( -0 +0 ^1) Landau theorem 10d 
NUM654 ( -0 +0 ^1) Landau theorem 10e 
NUM655 ( -0 +0 ^1) Landau theorem 10f 
NUM656 ( -0 +0 ^1) Landau theorem 10g 
NUM657 ( -0 +0 ^1) Landau theorem 10h 
NUM658 ( -0 +0 ^1) Landau theorem 10j 
NUM659 ( -0 +0 ^1) Landau theorem 10k 
NUM660 ( -0 +0 ^1) Landau theorem 13 
NUM661 ( -0 +0 ^1) Landau theorem 14 
NUM662 ( -0 +0 ^1) Landau theorem 15 
NUM663 ( -0 +0 ^1) Landau theorem 16a 
NUM664 ( -0 +0 ^1) Landau theorem 16b 
NUM665 ( -0 +0 ^1) Landau theorem 16c 
NUM666 ( -0 +0 ^1) Landau theorem 16d 
NUM667 ( -0 +0 ^1) Landau theorem 17 
NUM668 ( -0 +0 ^1) Landau theorem 18 
NUM669 ( -0 +0 ^1) Landau theorem 18b 
NUM670 ( -0 +0 ^1) Landau theorem 19a 
NUM671 ( -0 +0 ^1) Landau theorem 19b 
NUM672 ( -0 +0 ^1) Landau theorem 19c 
NUM673 ( -0 +0 ^1) Landau theorem 19d 
NUM674 ( -0 +0 ^1) Landau theorem 19e 
NUM675 ( -0 +0 ^1) Landau theorem 19f 
NUM676 ( -0 +0 ^1) Landau theorem 19g 
NUM677 ( -0 +0 ^1) Landau theorem 19h 
NUM678 ( -0 +0 ^1) Landau theorem 19j 
NUM679 ( -0 +0 ^1) Landau theorem 19k 
NUM680 ( -0 +0 ^1) Landau theorem 20a 
NUM681 ( -0 +0 ^1) Landau theorem 20b 
NUM682 ( -0 +0 ^1) Landau theorem 20c 
NUM683 ( -0 +0 ^1) Landau theorem 20d 
NUM684 ( -0 +0 ^1) Landau theorem 20e 
NUM685 ( -0 +0 ^1) Landau theorem 20f 
NUM686 ( -0 +0 ^1) Landau theorem 21 
NUM687 ( -0 +0 ^1) Landau theorem 22a 
NUM688 ( -0 +0 ^1) Landau theorem 22b 
NUM689 ( -0 +0 ^1) Landau theorem 22c 
NUM690 ( -0 +0 ^1) Landau theorem 22d 
NUM691 ( -0 +0 ^1) Landau theorem 23 
NUM692 ( -0 +0 ^1) Landau theorem 23a 
NUM693 ( -0 +0 ^1) Landau theorem 24 
NUM694 ( -0 +0 ^1) Landau theorem 24a 
NUM695 ( -0 +0 ^1) Landau theorem 24b 
NUM696 ( -0 +0 ^1) Landau theorem 25 
NUM697 ( -0 +0 ^1) Landau theorem 25a 
NUM698 ( -0 +0 ^1) Landau theorem 25b 
NUM699 ( -0 +0 ^1) Landau theorem 25c 
NUM700 ( -0 +0 ^1) Landau theorem 26 
NUM701 ( -0 +0 ^1) Landau theorem 26a 
NUM702 ( -0 +0 ^1) Landau theorem 26b 
NUM703 ( -0 +0 ^1) Landau theorem 26c 
NUM704 ( -0 +0 ^1) Landau theorem 27 
NUM705 ( -0 +0 ^1) Landau theorem 27a 
NUM706 ( -0 +0 ^1) Landau theorem 28e 
NUM707 ( -0 +0 ^1) Landau theorem 28f 
NUM708 ( -0 +0 ^1) Landau theorem 28g 
NUM709 ( -0 +0 ^1) Landau theorem 28h 
NUM710 ( -0 +0 ^1) Landau theorem 29 
NUM711 ( -0 +0 ^1) Landau theorem 30 
NUM712 ( -0 +0 ^1) Landau theorem 31 
NUM713 ( -0 +0 ^1) Landau theorem 32a 
NUM714 ( -0 +0 ^1) Landau theorem 32b 
NUM715 ( -0 +0 ^1) Landau theorem 32c 
NUM716 ( -0 +0 ^1) Landau theorem 32d 
NUM717 ( -0 +0 ^1) Landau theorem 32e 
NUM718 ( -0 +0 ^1) Landau theorem 32f 
NUM719 ( -0 +0 ^1) Landau theorem 32g 
NUM720 ( -0 +0 ^1) Landau theorem 32h 
NUM721 ( -0 +0 ^1) Landau theorem 32j 
NUM722 ( -0 +0 ^1) Landau theorem 32k 
NUM723 ( -0 +0 ^1) Landau theorem 33a 
NUM724 ( -0 +0 ^1) Landau theorem 33b 
NUM725 ( -0 +0 ^1) Landau theorem 33c 
NUM726 ( -0 +0 ^1) Landau theorem 34a 
NUM727 ( -0 +0 ^1) Landau theorem 35a 
NUM728 ( -0 +0 ^1) Landau theorem 35b 
NUM729 ( -0 +0 ^1) Landau theorem 35c 
NUM730 ( -0 +0 ^1) Landau theorem 35d 
NUM731 ( -0 +0 ^1) Landau theorem 36 
NUM732 ( -0 +0 ^1) Landau theorem 36a 
NUM733 ( -0 +0 ^1) Landau theorem 38 
NUM734 ( -0 +0 ^1) Landau theorem 39 
NUM735 ( -0 +0 ^1) Landau theorem 40a 
NUM736 ( -0 +0 ^1) Landau theorem 40c 
NUM737 ( -0 +0 ^1) Landau theorem 41 
NUM738 ( -0 +0 ^1) Landau theorem 41a 
NUM739 ( -0 +0 ^1) Landau theorem 41b 
NUM740 ( -0 +0 ^1) Landau theorem 41c 
NUM741 ( -0 +0 ^1) Landau theorem 41d 
NUM742 ( -0 +0 ^1) Landau theorem 41e 
NUM743 ( -0 +0 ^1) Landau theorem 41f 
NUM744 ( -0 +0 ^1) Landau theorem 41g 
NUM745 ( -0 +0 ^1) Landau theorem 41h 
NUM746 ( -0 +0 ^1) Landau theorem 41j 
NUM747 ( -0 +0 ^1) Landau theorem 41k 
NUM748 ( -0 +0 ^1) Landau theorem 42 
NUM749 ( -0 +0 ^1) Landau theorem 43 
NUM750 ( -0 +0 ^1) Landau theorem 44 
NUM751 ( -0 +0 ^1) Landau theorem 45 
NUM752 ( -0 +0 ^1) Landau theorem 46 
NUM753 ( -0 +0 ^1) Landau theorem 47 
NUM754 ( -0 +0 ^1) Landau theorem 48 
NUM755 ( -0 +0 ^1) Landau theorem 49 
NUM756 ( -0 +0 ^1) Landau theorem 50 
NUM757 ( -0 +0 ^1) Landau theorem 51a 
NUM758 ( -0 +0 ^1) Landau theorem 51b 
NUM759 ( -0 +0 ^1) Landau theorem 51c 
NUM760 ( -0 +0 ^1) Landau theorem 51d 
NUM761 ( -0 +0 ^1) Landau theorem 52 
NUM762 ( -0 +0 ^1) Landau theorem 57a 
NUM763 ( -0 +0 ^1) Landau theorem 58 
NUM764 ( -0 +0 ^1) Landau theorem 60a 
NUM765 ( -0 +0 ^1) Landau theorem 62b 
NUM766 ( -0 +0 ^1) Landau theorem 62c 
NUM767 ( -0 +0 ^1) Landau theorem 62d 
NUM768 ( -0 +0 ^1) Landau theorem 62e 
NUM769 ( -0 +0 ^1) Landau theorem 62f 
NUM770 ( -0 +0 ^1) Landau theorem 62g 
NUM771 ( -0 +0 ^1) Landau theorem 62h 
NUM772 ( -0 +0 ^1) Landau theorem 62j 
NUM773 ( -0 +0 ^1) Landau theorem 62k 
NUM774 ( -0 +0 ^1) Landau theorem 63a 
NUM775 ( -0 +0 ^1) Landau theorem 63b 
NUM776 ( -0 +0 ^1) Landau theorem 63c 
NUM777 ( -0 +0 ^1) Landau theorem 63d 
NUM778 ( -0 +0 ^1) Landau theorem 63e 
NUM779 ( -0 +0 ^1) Landau theorem 63f 
NUM780 ( -0 +0 ^1) Landau theorem 64 
NUM781 ( -0 +0 ^1) Landau theorem 64a 
NUM782 ( -0 +0 ^1) Landau theorem 65a 
NUM783 ( -0 +0 ^1) Landau theorem 65b 
NUM784 ( -0 +0 ^1) Landau theorem 65c 
NUM785 ( -0 +0 ^1) Landau theorem 65d 
NUM786 ( -0 +0 ^1) Landau theorem 66 
NUM787 ( -0 +0 ^1) Landau theorem 66a 
NUM788 ( -0 +0 ^1) Landau theorem 67a 
NUM789 ( -0 +0 ^1) Landau theorem 67b 
NUM790 ( -0 +0 ^1) Landau theorem 67c 
NUM791 ( -0 +0 ^1) Landau theorem 67d 
NUM792 ( -0 +0 ^1) Landau theorem 67e 
NUM793 ( -0 +0 ^1) Landau theorem 69 
NUM794 ( -0 +0 ^1) Landau theorem 72b 
NUM795 ( -0 +0 ^1) Landau theorem 72c 
NUM796 ( -0 +0 ^1) Landau theorem 72d 
NUM797 ( -0 +0 ^1) Landau theorem 72e 
NUM798 ( -0 +0 ^1) Landau theorem 72f 
NUM799 ( -0 +0 ^1) Landau theorem 72g 
NUM800 ( -0 +0 ^1) Landau theorem 72h 
NUM801 ( -0 +0 ^1) Landau theorem 72j 
NUM802 ( -0 +0 ^1) Landau theorem 72k 
NUM803 ( -0 +0 ^1) Landau theorem 73a 
NUM804 ( -0 +0 ^1) Landau theorem 73b 
NUM805 ( -0 +0 ^1) Landau theorem 73c 
NUM806 ( -0 +0 ^1) Landau theorem 73d 
NUM807 ( -0 +0 ^1) Landau theorem 73e 
NUM808 ( -0 +0 ^1) Landau theorem 73f 
NUM809 ( -0 +0 ^1) Landau theorem 74 
NUM810 ( -0 +0 ^1) Landau theorem 74a 
NUM811 ( -0 +0 ^1) Landau theorem 75a 
NUM812 ( -0 +0 ^1) Landau theorem 75b 
NUM813 ( -0 +0 ^1) Landau theorem 75c 
NUM814 ( -0 +0 ^1) Landau theorem 75d 
NUM815 ( -0 +0 ^1) Landau theorem 76 
NUM816 ( -0 +0 ^1) Landau theorem 76a 
NUM817 ( -0 +0 ^1) Landau theorem 77b 
NUM818 ( -0 +0 ^1) Landau theorem 79 
NUM819 ( -0 +0 ^1) Landau theorem 80 
NUM820 ( -0 +0 ^1) Landau theorem 81a 
NUM821 ( -0 +0 ^1) Landau theorem 81b 
NUM822 ( -0 +0 ^1) Landau theorem 81c 
NUM823 ( -0 +0 ^1) Landau theorem 81d 
NUM824 ( -0 +0 ^1) Landau theorem 81e 
NUM825 ( -0 +0 ^1) Landau theorem 81f 
NUM826 ( -0 +0 ^1) Landau theorem 81g 
NUM827 ( -0 +0 ^1) Landau theorem 81h 
NUM828 ( -0 +0 ^1) Landau theorem 81j 
NUM829 ( -0 +0 ^1) Landau theorem 81k 
NUM830 ( -0 +0 ^1) Landau theorem 87c 
NUM831 ( -0 +0 ^1) Landau theorem 87d 
NUM832 ( -0 +0 ^1) Landau theorem 94a 
NUM833 ( -0 +0 ^1) Landau theorem 96d 
NUM834 ( -0 +0 ^1) Landau theorem 96e 
NUM835 ( -0 +0 ^1) Landau theorem 96f 
NUM836 ( -0 +0 ^1) Landau theorem 98a 
NUM837 ( -0 +0 ^1) Landau theorem 99c 
NUM838 ( -0 +0 ^1) Landau theorem 99d 
NUM839 ( -0 +0 ^1) Landau theorem 100a 
NUM840 ( -0 +0 ^1) Landau theorem 4
NUM841 ( -0 +0 ^1) Something times one is one
NUM842 ( -0 +0 ^1) Something times four equal five plus seven
NUM843 ( -0 +0 ^1) Some function of two and three is six, and of one and two is two
NUM844 ( -0 +0 ^1) Something times four equals five plus something
-------------------------------------------------------------------------------
Domain PLA = Planning.
46 problems (31 abstract, 40 CNF, 6 FOF, 0 THF)
-------------------------------------------------------------------------------
PLA001 ( -1 +0 ^0) Cheyenne to DesMoines, buying a loaf of bread on the way
PLA002 ( -2 +0 ^0) Getting from here to there, in all weather
PLA003 ( -1 +0 ^0) Monkey and Bananas Problem
PLA004 ( -2 +0 ^0) Block C on B on A
PLA005 ( -2 +0 ^0) Block C on A and D on B
PLA006 ( -1 +0 ^0) Block C on Table
PLA007 ( -1 +0 ^0) Block A on D
PLA008 ( -1 +0 ^0) Block B on D and A on C
PLA009 ( -2 +0 ^0) Block A on B and D clear
PLA010 ( -1 +0 ^0) Block A on D on B
PLA011 ( -2 +0 ^0) Block D on C on B
PLA012 ( -1 +0 ^0) Block D on B on C
PLA013 ( -1 +0 ^0) Block A on C on B
PLA014 ( -2 +0 ^0) Block A on B on C
PLA015 ( -1 +0 ^0) Block A on B on D
PLA016 ( -1 +0 ^0) Block D on A
PLA017 ( -1 +0 ^0) Block A on C
PLA018 ( -1 +0 ^0) Block A on B and D on C
PLA019 ( -1 +0 ^0) Block D on C
PLA020 ( -1 +0 ^0) Block D clear
PLA021 ( -1 +0 ^0) Block B on D and C on A
PLA022 ( -2 +0 ^0) Block A on C on D
PLA023 ( -1 +0 ^0) Block D on A on C
PLA024 ( -0 +1 ^0) Blocks A/B, C => B/C/A
PLA025 ( -0 +1 ^0) Blocks 3/2/1, 5/4, 9/8/7/6 => 1/5, 8/9/4, 2/3/7/6
PLA026 ( -0 +1 ^0) Blocks 3/2/1, 5/4 => 5/3, 1, 4/2
PLA027 ( -0 +1 ^0) Blocks A/B/C/D => D/C/B/A
PLA028 ( -0 +1 ^0) Blocks A, B => A/B
PLA029 ( -1 +1 ^0) Blocks world axioms
PLA030 ( -1 +0 ^0) Blocks world difference axioms for 4 blocks
PLA031 ( -8 +0 ^0) Driver's log k=01
-------------------------------------------------------------------------------
Domain PUZ = Puzzles.
131 problems (83 abstract, 102 CNF, 24 FOF, 5 THF)
-------------------------------------------------------------------------------
PUZ001 ( -3 +1 ^0) Dreadbury Mansion
PUZ002 ( -1 +0 ^0) The Animals Puzzle
PUZ003 ( -1 +0 ^0) The Barber Puzzle
PUZ004 ( -1 +0 ^0) The Letters Puzzle
PUZ005 ( -1 +1 ^0) The Lion and the Unicorn
PUZ006 ( -1 +0 ^0) Determine sex and race on Mars and Venus
PUZ007 ( -1 +0 ^0) Mixed couples on Mars and Venus
PUZ008 ( -3 +0 ^0) Missionaries and Cannibals
PUZ009 ( -1 +0 ^0) Looking for Oona
PUZ010 ( -1 +0 ^0) Who owns the zebra?
PUZ011 ( -1 +0 ^0) An ocean that borders on an African and an Asian country
PUZ012 ( -1 +0 ^0) The Mislabeled Boxes
PUZ013 ( -1 +0 ^0) The School Boys : Prove some monitors are awake
PUZ014 ( -1 +0 ^0) The School Boys : Prove that all monitors are awake
PUZ015 ( -3 +0 ^0) Checkerboard and Dominoes : Opposing corners removed
PUZ016 ( -3 +0 ^0) Checkerboard and Dominoes : Row 1, columns 2 and 3 removed
PUZ017 ( -1 +0 ^0) The Houses
PUZ018 ( -2 +0 ^0) The Interns
PUZ019 ( -1 +0 ^0) The Jobs Puzzles
PUZ020 ( -1 +0 ^0) A knights & knaves problem, if he's a knight, so is she
PUZ021 ( -1 +0 ^0) How to Win a Bride
PUZ022 ( -1 +0 ^0) An ocean that borders on two adjacent Australian states
PUZ023 ( -1 +0 ^0) Knights and Knaves #27
PUZ024 ( -1 +0 ^0) Knights and Knaves #31
PUZ025 ( -1 +0 ^0) Knights and Knaves #35
PUZ026 ( -1 +0 ^0) Knights and Knaves #39
PUZ027 ( -1 +0 ^0) Knights and Knaves #42
PUZ028 ( -6 +0 ^0) People at a party
PUZ029 ( -1 +0 ^0) The pigs and balloons puzzle
PUZ030 ( -2 +0 ^0) Salt and Mustard Problem
PUZ031 ( -1 +1 ^0) Schubert's Steamroller
PUZ032 ( -1 +0 ^0) Knights and Knaves #26
PUZ033 ( -1 +0 ^0) The Winds and the Windows Puzzle
PUZ034 ( -2 +0 ^0) N queens problem
PUZ035 ( -7 +0 ^0) Knights and Knaves #36
PUZ036 ( -1 +0 ^0) TopSpin
PUZ037 ( -3 +0 ^0) Rubik's Cube
PUZ038 ( -1 +0 ^0) Quo vadis 1
PUZ039 ( -1 +0 ^0) Quo vadis 2
PUZ040 ( -1 +0 ^0) Quo vadis 3
PUZ041 ( -1 +0 ^0) Quo vadis 4
PUZ042 ( -1 +0 ^0) Quo vadis 5
PUZ043 ( -1 +0 ^0) Mars and Venus axioms
PUZ044 ( -1 +0 ^0) Truthtellers and Liars axioms for two types of people
PUZ045 ( -1 +0 ^0) Truthtellers and Liars axioms for three types of people
PUZ046 ( -1 +0 ^0) Quo vadis axioms
PUZ047 ( -1 +1 ^0) Taking the wolf, goat, and cabbage across river
PUZ048 ( -1 +0 ^0) Quo vadis 6 - initial to intermediate
PUZ049 ( -1 +0 ^0) Quo vadis 6 - intermediate to final
PUZ050 ( -1 +0 ^0) Quo vadis 6 - initial to intermediate
PUZ051 ( -1 +0 ^0) Quo vadis 6 - intermediate to final
PUZ052 ( -1 +0 ^0) Rubik's Cube unreachability
PUZ053 ( -1 +0 ^0) Rubik's Cube unreachability
PUZ054 ( -1 +0 ^0) Take black and white balls from a bag
PUZ055 ( -1 +0 ^0) Show that Sam Loyd's fifteen-puzzle is not solvable
PUZ056 ( -9 +0 ^0) Tower of Hanoi
PUZ057 ( -1 +0 ^0) Show the Hanoi problem is not solvable anymore
PUZ058 ( -1 +0 ^0) Show the Hanoi problem is not solvable anymore
PUZ059 ( -1 +0 ^0) Quo vadis 7 - an unreachable state
PUZ060 ( -0 +1 ^0) Food problems
PUZ061 ( -0 +1 ^0) Food problems
PUZ062 ( -2 +0 ^0) Problem about mutilated chessboard problem
PUZ063 ( -2 +0 ^0) Problem about mutilated chessboard problem
PUZ064 ( -2 +0 ^0) Problem about mutilated chessboard problem
PUZ065 ( -0 +1 ^0) Sudoku 13273
PUZ066 ( -0 +1 ^0) Sudoku 19262
PUZ067 ( -0 +1 ^0) Sudoku 8618
PUZ068 ( -1 +2 ^0) Monday's Sudoku
PUZ069 ( -1 +2 ^0) Tuesday's Sudoku
PUZ070 ( -1 +1 ^0) Wednesday's Sudoku
PUZ071 ( -1 +1 ^0) Thursday's Sudoku
PUZ072 ( -1 +1 ^0) Friday's Sudoku
PUZ073 ( -0 +1 ^0) The patient is not adjacent to the oxygen
PUZ074 ( -0 +1 ^0) Are two cells not adjacent in the Wumpus world
PUZ075 ( -0 +1 ^0) Are two cells adjacent in the Wumpus world
PUZ076 ( -0 +1 ^0) Cell is not west of the other in the Wumpus world
PUZ077 ( -0 +1 ^0) Cell is west of the other in the Wumpus world
PUZ078 ( -0 +1 ^0) Leo the Liar
PUZ079 ( -0 +1 ^0) Another Sudoku
PUZ080 ( -0 +1 ^0) Another Sudoku
PUZ081 ( -0 +0 ^3) 1 of http://philosophy.hku.hk/think/logic/knight.php
PUZ082 ( -0 +0 ^1) Peter the liar
PUZ083 ( -0 +0 ^1) Peter the untruthful
-------------------------------------------------------------------------------
Domain RNG = Rings.
104 problems (42 abstract, 104 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
RNG001 ( -5 +0 ^0) X.additive_identity = additive_identity for any X
RNG002 ( -1 +0 ^0) Right cancellation for addition
RNG003 ( -1 +0 ^0) Left cancellation for addition
RNG004 ( -3 +0 ^0) X*Y = -X*-Y
RNG005 ( -2 +0 ^0) (-X*Y) + (X*Y) = additive_identity
RNG006 ( -3 +0 ^0) X*(Y+ -Z) = (X*Y) + -(X*Z)
RNG007 ( -3 +0 ^0) In Boolean rings, X is its own inverse
RNG008 ( -7 +0 ^0) Boolean rings are commutative
RNG009 ( -2 +0 ^0) If X*X*X = X then the ring is commutative
RNG010 ( -5 +0 ^0) Skew symmetry of the auxilliary function
RNG011 ( -1 +0 ^0) In a right alternative ring (((X,X,Y)*X)*(X,X,Y)) = Add Id
RNG012 ( -1 +0 ^0) Product of inverses equal product
RNG013 ( -1 +0 ^0) -X*Y = -(X*Y)
RNG014 ( -1 +0 ^0) -X*Y = -(X*Y)
RNG015 ( -1 +0 ^0) X*(Y+ -Z) = (X*Y) + -(X*Z)
RNG016 ( -1 +0 ^0) (X+ -Y)*Z = (X*Z) + -(Y*Z)
RNG017 ( -1 +0 ^0) -X*(Y+Z) = -(X*Y) + -(X*Z)
RNG018 ( -1 +0 ^0) (X+Y)* -Z = -(X*Z) + -(Y*Z)
RNG019 ( -2 +0 ^0) First part of the linearised form of the associator
RNG020 ( -2 +0 ^0) Second part of the linearised form of the associator
RNG021 ( -2 +0 ^0) Third part of the linearised form of the associator
RNG023 ( -2 +0 ^0) Left alternative
RNG024 ( -2 +0 ^0) Right alternative
RNG025 ( -7 +0 ^0) Middle or Flexible Law
RNG026 ( -2 +0 ^0) Teichmuller Identity
RNG027 ( -6 +0 ^0) Right Moufang identity
RNG028 ( -6 +0 ^0) Left Moufang identity
RNG029 ( -6 +0 ^0) Middle Moufang identity
RNG030 ( -2 +0 ^0) 2*assr(X,X,Y)^3 = additive identity
RNG031 ( -2 +0 ^0) (W*W)*X*(W*W) = additive identity
RNG032 ( -2 +0 ^0) 6*assr(X,X,Y)^6 = additive identity
RNG033 ( -4 +0 ^0) A fairly complex equation with associators
RNG034 ( -1 +0 ^0) A skew symmetry relation of the associator
RNG035 ( -1 +0 ^0) If X*X*X*X = X then the ring is commutative
RNG036 ( -1 +0 ^0) If X*X*X*X*X = X then the ring is commutative
RNG037 ( -2 +0 ^0) (X* -Y) + (X*Y) = additive_identity
RNG038 ( -2 +0 ^0) Ring property 1
RNG039 ( -2 +0 ^0) Ring property 2
RNG040 ( -2 +0 ^0) Ring property 4
RNG041 ( -1 +0 ^0) Unknown
RNG042 ( -3 +0 ^0) Ring theory axioms
RNG043 ( -2 +0 ^0) Alternative ring theory (equality) axioms
-------------------------------------------------------------------------------
Domain ROB = Robbins Algebra.
40 problems (31 abstract, 40 CNF, 0 FOF, 0 THF)
-------------------------------------------------------------------------------
ROB001 ( -1 +0 ^0) Is every Robbins algebra Boolean?
ROB002 ( -1 +0 ^0) --X = X => Boolean
ROB003 ( -1 +0 ^0) X + c=c => Boolean
ROB004 ( -1 +0 ^0) c = -d, c + d=d, and c + c=c => Boolean
ROB005 ( -1 +0 ^0) Exists an idempotent element => Boolean
ROB006 ( -3 +0 ^0) Exists absorbed element => Boolean
ROB007 ( -4 +0 ^0) Absorbed within negation element => Boolean
ROB008 ( -1 +0 ^0) If -(a + -(b + c)) = -(a + b + -c) then a+b=a
ROB009 ( -1 +0 ^0) If -(a + -(b + c)) = -(b + -(a + c)) then a = b
ROB010 ( -1 +0 ^0) If -(a + -b) = c then -(c + -(b + a)) = a
ROB011 ( -1 +0 ^0) If -(a + -b) = c then -(a + -(b + k(a + c))) = c, k=1
ROB012 ( -2 +0 ^0) If -(a + -b) = c then -(a + -(b + k(a + c))) = c, k=k + 1
ROB013 ( -1 +0 ^0) If -(a + b) = c then -(c + -(-b + a)) = a
ROB014 ( -2 +0 ^0) If -(-e + -(d + -e)) = d then -(e + k(d + -(d + -e))) = -e, k=1
ROB015 ( -2 +0 ^0) If -(-e + -(d + -e)) = d then -(e + k(d + -(d + -e))) = -e
ROB016 ( -1 +0 ^0) If -(d + e) = -e then -(e + k(d + -(d + -e))) = -e, for k>0
ROB017 ( -1 +0 ^0) If -(2f + h) = -(3f + h) = -h then 2f + h = 3f + h
ROB018 ( -1 +0 ^0) If -(d + e) = -e then e + 2(d + -(d + -e)) absorbs d + -(d + -e)
ROB020 ( -2 +0 ^0) -(a + -b)=b => Boolean
ROB021 ( -1 +0 ^0) (-X = -Y)=>(X = Y) => Boolean
ROB022 ( -1 +0 ^0) c + -c=c => Boolean
ROB023 ( -1 +0 ^0) X + X=X => Boolean
ROB024 ( -1 +0 ^0) -(a + (a + b)) + -(a + -b) = a => Boolean
ROB025 ( -1 +0 ^0) -(X + Y) = intersection(-X,-Y) => Boolean
ROB026 ( -1 +0 ^0) c + d = c => Boolean
ROB027 ( -1 +0 ^0) -(-c) = c => Boolean
ROB028 ( -1 +0 ^0) Robbins algebra axioms
ROB029 ( -1 +0 ^0) Robbins algebra numbers axioms
ROB030 ( -1 +0 ^0) Exists absorbed element => Exists absorbed within negation element
ROB031 ( -1 +0 ^0) Robbins => Exists absorbed within negation element
ROB032 ( -1 +0 ^0) Robbins => Exists absorbed element
-------------------------------------------------------------------------------
Domain SET = Set Theory.
1312 problems (967 abstract, 800 CNF, 468 FOF, 44 THF)
-------------------------------------------------------------------------------
SET001 ( -1 +0 ^0) Set members are superset members
SET002 ( -2 +2 ^0) Idempotency of union
SET003 ( -1 +0 ^0) A set is a subset of the union of itself with itself
SET004 ( -1 +0 ^0) A set is a subset of the union of itself and another set
SET005 ( -1 +0 ^0) Associativity of set intersection
SET006 ( -1 +0 ^0) A = A ^ B if A (= B
SET007 ( -1 +0 ^0) Intersection distributes over union
SET008 ( -1 +1 ^0) (X \ Y) ^ Y = the empty set
SET009 ( -1 +1 ^0) If X is a subset of Y, then Z \ Y is a subset of Z \ X
SET010 ( -1 +1 ^0) X \ Y ^ Z = (X \ Y) U (X \ Z)
SET011 ( -1 +1 ^0) X \ (X \ Y) = X ^ Y
SET012 ( -4 +1 ^0) Complement is an involution
SET013 ( -4 +1 ^0) Commutativity of intersection
SET014 ( -4 +2 ^1) If X (= Z and Y (= Z, then X U Y (= Z
SET015 ( -4 +1 ^0) Commutativity of union
SET016 ( -4 +2 ^0) First components of equal ordered pairs are equal
SET017 ( -4 +1 ^1) Left cancellation for unordered pairs
SET018 ( -5 +2 ^0) Second components of equal ordered pairs are equal
SET019 ( -2 +1 ^0) Two sets that contain one another are equal 
SET020 ( -4 +1 ^0) Uniqueness of 1st and 2nd when X is an ordered pair of sets
SET021 ( -4 +0 ^0) 2nd is unique when x is an ordered pair of sets
SET022 ( -2 +0 ^0) The first component of an ordered pair is a little set
SET023 ( -2 +0 ^0) The second component of an ordered pair is a little set
SET024 ( -4 +1 ^0) A set belongs to its singleton
SET025 ( -6 +1 ^0) An ordered pair is a set
SET027 ( -4 +3 ^0) Transitivity of subset
SET028 ( -2 +0 ^0) Relationship between apply and image, part 1 of 2
SET029 ( -2 +0 ^0) Relationship between apply and image, part 2 of 2
SET030 ( -3 +0 ^0) Function values are little sets
SET031 ( -2 +0 ^0) The composition of two sets is a relation
SET032 ( -3 +0 ^0) Range of composition
SET033 ( -3 +0 ^0) Domain of composition
SET034 ( -3 +0 ^0) The composition of functions is a function
SET035 ( -3 +0 ^0) Maps for composition
SET036 ( -3 +0 ^0) Properties of apply for functions, part 1 of 3
SET037 ( -3 +0 ^0) Properties of apply for functions, part 2 of 3
SET038 ( -3 +0 ^0) Properties of apply for functions, part 3 of 3
SET039 ( -2 +0 ^0) Properties of apply for composition of functions, 1 of 3
SET040 ( -3 +0 ^0) Properties of apply for composition of functions, 2 of 3
SET041 ( -3 +0 ^0) Properties of apply for composition of functions, 3 of 3
SET042 ( -2 +0 ^0) Ordered pairs are in cross products
SET043 ( -1 +1 ^0) Russell's Paradox
SET044 ( -1 +1 ^0) Anti-Russell Sets
SET045 ( -1 +1 ^0) No Universal Set
SET046 ( -1 +1 ^0) No set of non-circular sets
SET047 ( -1 +1 ^0) Set equality is symmetric
SET050 ( -1 +0 ^0) Corollary to Unordered pair axiom
SET051 ( -1 +0 ^0) Corollary to Unordered pair axiom
SET052 ( -1 +0 ^0) Corollary to Cartesian product axiom
SET053 ( -1 +0 ^0) Corollary to Cartesian product axiom
SET054 ( -2 +1 ^0) Reflexivity of subclass
SET055 ( -2 +1 ^0) Reflexivity of equality
SET056 ( -2 +1 ^0) Expanded equality definition
SET057 ( -2 +0 ^0) Expanded equality definition
SET058 ( -2 +0 ^0) Expanded equality definition
SET059 ( -2 +0 ^0) Expanded equality definition
SET060 ( -2 +1 ^0) Nothing in the intersection of a set and its complement
SET061 ( -2 +1 ^0) Existence of a null class
SET062 ( -2 +3 ^0) The empty set is a subset of X
SET063 ( -2 +3 ^0) If X is a subset of the empty set, then X is the empty set
SET064 ( -2 +1 ^0) Uniqueness of null class
SET065 ( -2 +1 ^0) Null class is a set (follows from axiom of infinity)
SET066 ( -2 +1 ^1) Unordered pair is commutative
SET067 ( -2 +1 ^1) If one argument is a proper class, pair contains only the other
SET068 ( -2 +0 ^0) Proper class in an unordered pair, part 2
SET069 ( -2 +1 ^0) If one argument is a proper class, pair contains only the other
SET070 ( -2 +0 ^0) Proper class in an unordered pair, part 4
SET071 ( -2 +1 ^0) If both arguments are proper classes, pair is null
SET072 ( -2 +1 ^0) Right cancellation for unordered pairs
SET073 ( -2 +1 ^0) Corollary to unordered pair axiom
SET074 ( -2 +1 ^0) Corollary to unordered pair axiom
SET075 ( -2 +0 ^0) Corollary to unordered pair axiom
SET076 ( -2 +1 ^1) If both members of a pair belong to a set, the pair is a subset
SET077 ( -2 +1 ^0) Every singleton is a set
SET078 ( -2 +0 ^0) Corollary to every singleton is a set
SET079 ( -2 +1 ^0) A set belongs to its singleton
SET080 ( -2 +0 ^0) Corollary to a set belongs to its singleton
SET081 ( -2 +1 ^0) Only X can belong to {X}
SET082 ( -2 +1 ^0) If X is not a set, {X} = null class
SET083 ( -2 +1 ^0) A singleton set is determined by its element
SET084 ( -2 +1 ^0) A singleton set is determined by its element
SET085 ( -2 +0 ^0) Unordered pair that is a singleton
SET086 ( -2 +1 ^1) A singleton set has a member
SET087 ( -2 +0 ^0) A singleton set has a member, part 2
SET088 ( -2 +0 ^0) A singleton set has a member, part 3
SET089 ( -2 +0 ^0) A singleton set has a member, part 4
SET090 ( -2 +1 ^0) Uniqueness of member_of of a singleton set
SET091 ( -2 +1 ^0) Uniqueness of member_of when X is not a singleton of a set
SET092 ( -2 +0 ^0) Member_of(X) is unique if X is not a singleton, part 2
SET093 ( -2 +1 ^0) Corollary to every singleton is a set
SET094 ( -2 +1 ^0) Property 1 of singletons
SET095 ( -2 +2 ^0) Property 2 of singletons
SET096 ( -2 +1 ^1) There are at most two subsets of a singleton set
SET097 ( -2 +1 ^0) A class contains 0, 1 or at least 2 members.
SET098 ( -2 +1 ^0) Corollary 1 to a class contains 0, 1, or at least 2 members
SET099 ( -2 +1 ^0) Corollary 2 to a class contains 0, 1, or at least 2 members
SET100 ( -2 +0 ^0) The relationship of singleton sets to ordered pairs
SET101 ( -2 +1 ^0) Singleton of the first is a member of an ordered pair
SET102 ( -2 +1 ^0) Ordered pair member of ordered pair
SET103 ( -2 +1 ^0) Special member 1 of an ordered pair
SET104 ( -2 +1 ^0) Special member 2 of an ordered pair
SET105 ( -2 +1 ^0) Special member 3 of an ordered pair
SET108 ( -2 +1 ^0) 1st and 2nd make the ordered pair
SET109 ( -2 +0 ^0) 1st is the ordered pair, first condition
SET110 ( -2 +0 ^0) 2nd is the ordered pair, first condition
SET111 ( -2 +0 ^0) 1st is the ordered pair, second condition
SET112 ( -2 +0 ^0) 2nd is the ordered pair, second condition
SET113 ( -2 +1 ^0) Uniqueness of 1st and 2nd when X is not an ordered pair of sets
SET114 ( -2 +0 ^0) 2nd is unique if x is not an ordered pair of sets, part 1
SET115 ( -2 +0 ^0) 1st is unique if x is not an ordered pair of sets, part 2
SET116 ( -2 +0 ^0) 2nd is unique if x is not an ordered pair of sets, part 2
SET117 ( -2 +1 ^0) Corollary 1 to every ordered pair being a set
SET118 ( -2 +0 ^0) Corollary 2 to every ordered pair being a set
SET119 ( -2 +1 ^0) Corollary 1 to components of equal ordered pairs being equal
SET120 ( -2 +1 ^0) Corollary 2 to components of equal ordered pairs being equal
SET121 ( -2 +1 ^0) Corollary 3 to components of equal ordered pairs being equal
SET122 ( -2 +1 ^0) Corollary 4 to components of equal ordered pairs being equal
SET123 ( -1 +0 ^0) Alternative definition of set builder, part 1
SET124 ( -1 +0 ^0) Alternative definition of set builder, part 2
SET125 ( -1 +0 ^0) Alternative definition of set builder, part 3
SET126 ( -1 +0 ^0) Relation to singleton
SET127 ( -1 +0 ^0) Relation to unordered pair
SET128 ( -1 +0 ^0) Building a triple
SET129 ( -1 +0 ^0) Membership in a built unordered triple
SET130 ( -1 +0 ^0) Membership in unordered triple, part 1
SET131 ( -1 +0 ^0) Membership in unordered triple, part 2
SET132 ( -1 +0 ^0) Membership in unordered triple, part 3
SET133 ( -1 +0 ^0) Corollary 1 to membership in unordered triple
SET134 ( -1 +0 ^0) Corollary 2 to membership in unordered triple
SET135 ( -1 +0 ^0) Corollary 3 to membership in unordered triple
SET136 ( -1 +0 ^0) Corollary 4 to membership in unordered triple
SET137 ( -1 +0 ^0) Kludge 1 to instantiate variables in unordered triples
SET138 ( -1 +0 ^0) Kludge 2 to instantiate variables in unordered triples
SET139 ( -1 +0 ^0) Triple reduction 1
SET140 ( -1 +0 ^0) Triple reduction 2
SET141 ( -1 +0 ^0) Triple reduction 3
SET142 ( -1 +0 ^0) Lexical ordering in unordered triples is irrelevant
SET143 ( -1 +2 ^1) Associativity of intersection
SET144 ( -1 +1 ^0) If X is a subset of Z, then X U Y ^ Z = (X U Y) ^ Z
SET145 ( -1 +0 ^0) Commutativity outside intersection
SET146 ( -1 +1 ^0) The intersection of X and the empty set is the empty set
SET147 ( -1 +0 ^0) Universal class is identity for intersection
SET148 ( -1 +2 ^0) Idempotency of intersection
SET149 ( -1 +0 ^0) Corollary to idempotency of intersection
SET150 ( -1 +0 ^0) Complement is an involution
SET151 ( -1 +0 ^0) Complement of null class is universal class
SET152 ( -1 +0 ^0) Complement of universal class is null class
SET153 ( -1 +0 ^0) Intersection with complement is null class
SET154 ( -1 +0 ^0) Union with complement is universal class
SET155 ( -1 +1 ^0) De Morgans law 1
SET156 ( -1 +1 ^0) De Morgans law 2
SET157 ( -1 +0 ^0) Complement is unique
SET158 ( -1 +0 ^0) Corollary to complement axiom
SET159 ( -1 +2 ^0) Associativity of union
SET160 ( -1 +0 ^0) Commutativity of union
SET161 ( -1 +0 ^0) Commutativity outside union
SET162 ( -1 +2 ^0) The union of X and the empty set is X
SET163 ( -1 +0 ^0) Union with universal class
SET165 ( -1 +0 ^0) Corollary to idempotency of union
SET166 ( -1 +0 ^0) Members of union 1
SET167 ( -1 +0 ^0) Members of union 2
SET168 ( -1 +0 ^0) Members of union 3
SET169 ( -1 +2 ^0) Intersection distributes over union
SET170 ( -1 +0 ^0) Distribution of intersection over union 2
SET171 ( -1 +2 ^1) Union distributes over intersection
SET172 ( -1 +0 ^0) Distribution of union over intersection 2
SET173 ( -1 +1 ^0) Absorbtion for intersection
SET174 ( -1 +0 ^0) Corollary to absorbtion for intersection
SET175 ( -1 +1 ^0) Absorbtion for union
SET176 ( -1 +0 ^0) Corollary to absorbtion for union
SET177 ( -1 +0 ^0) Distribution property 1
SET178 ( -1 +0 ^0) Corollary 1 to distribution property 1
SET179 ( -1 +0 ^0) Corollary 2 to distribution property 1
SET180 ( -1 +0 ^0) Distribution property 2
SET181 ( -1 +0 ^0) Corollary to distribution property 2
SET182 ( -1 +0 ^0) Distribution property 3
SET183 ( -1 +1 ^0) If X is a subset of  Y, then the intersection of X and Y is X
SET184 ( -1 +0 ^0) Subclass property 2
SET185 ( -1 +1 ^0) If X is a subset of  Y, then the union of X and Y is Y
SET186 ( -1 +0 ^0) Subclass property 4
SET187 ( -1 +0 ^0) Subclass property 5
SET188 ( -1 +0 ^0) Subclass property 6
SET189 ( -1 +0 ^0) Corollary to subclass property 6
SET190 ( -1 +0 ^0) Subclass property 7
SET191 ( -1 +0 ^0) Subclass property 8
SET192 ( -1 +0 ^0) Subclass property 9
SET193 ( -1 +0 ^0) Subclass property 10
SET194 ( -1 +1 ^0) X is a subset of the union of X and Y
SET195 ( -1 +0 ^0) Lattice upper bound 2
SET196 ( -1 +1 ^0) The intersection of X and Y is a subset of X
SET197 ( -1 +0 ^0) Lattice lower bound 2
SET199 ( -1 +2 ^0) If Z (= X and Z (= Y, then Z (= X ^ Y
SET200 ( -1 +1 ^0) Union is monotonic
SET201 ( -1 +1 ^0) Intersection is monotonic
SET202 ( -1 +0 ^0) Cross product property 1
SET203 ( -1 +0 ^0) Corollary to cross product product property 1
SET204 ( -1 +0 ^0) Cross product property 2
SET205 ( -1 +0 ^0) Cross product with null class 1
SET206 ( -1 +0 ^0) Cross product with null class 2
SET207 ( -1 +0 ^0) Cross product property 3
SET208 ( -1 +0 ^0) Cross product is monotonic 1
SET209 ( -1 +0 ^0) Cross product is monotonic 2
SET210 ( -1 +0 ^0) Corollary 1 to cross product product monotonicity
SET211 ( -1 +0 ^0) Corollary 2 to cross product product monotonicity
SET212 ( -1 +0 ^0) Corollary 3 to cross product product monotonicity
SET213 ( -1 +0 ^0) Corollary 4 to cross product product monotonicity
SET214 ( -1 +0 ^0) Corollary 5 to cross product product monotonicity
SET215 ( -1 +0 ^0) Corollary 6 to cross product product monotonicity
SET216 ( -1 +0 ^0) Corollary 7 to cross product product monotonicity
SET217 ( -1 +0 ^0) Corollary 8 to cross product product monotonicity
SET218 ( -1 +0 ^0) Cross product distributes over union 1
SET219 ( -1 +0 ^0) Cross product distributes over union 2
SET220 ( -1 +0 ^0) Cross product distributes over intersection 1
SET221 ( -1 +0 ^0) Cross product distributes over intersection 2
SET222 ( -1 +0 ^0) Cross product property 4
SET223 ( -1 +0 ^0) Cross product property 5
SET224 ( -1 +0 ^0) Cross product double distribution for intersection
SET225 ( -1 +0 ^0) Inverse of cross product squared
SET226 ( -1 +0 ^0) Cross product left cancellation 1
SET227 ( -1 +0 ^0) Cross product left cancellation 2
SET228 ( -1 +0 ^0) Cross product right cancellation 1
SET229 ( -1 +0 ^0) Cross product right cancellation 2
SET230 ( -1 +0 ^0) Corollary to cross product cancellation
SET231 ( -1 +0 ^0) Cross product property 6
SET232 ( -1 +0 ^0) Cross product property 7
SET233 ( -1 +0 ^0) Cross product property 8
SET234 ( -1 +0 ^0) Cross product property 9
SET235 ( -1 +0 ^0) Cross product property 10
SET236 ( -1 +0 ^0) Cross product property 11
SET237 ( -1 +0 ^0) Restriction alternate definition 1
SET238 ( -1 +0 ^0) Corollary to restriction alternate definition 1
SET239 ( -1 +0 ^0) Restriction alternate definition 2
SET240 ( -1 +0 ^0) Restriction alternate definition 3
SET241 ( -1 +0 ^0) Restriction alternate definition 4
SET242 ( -1 +0 ^0) Restriction alternate definition 5
SET243 ( -1 +0 ^0) Restriction property 1
SET244 ( -1 +0 ^0) Restriction with universal class
SET245 ( -1 +0 ^0) Restriction with null class 1
SET246 ( -1 +0 ^0) Restriction with null class 2
SET247 ( -1 +0 ^0) Restriction with null class 3
SET248 ( -1 +0 ^0) Restriction preserves intersections
SET249 ( -1 +0 ^0) Restriction property 2
SET250 ( -1 +0 ^0) Corollary to restriction property 2
SET251 ( -1 +0 ^0) Restriction of element relation, part 1
SET252 ( -1 +0 ^0) Restriction property 3
SET253 ( -1 +0 ^0) Restriction property 4
SET254 ( -1 +0 ^0) Monotonicity of restriction 1
SET255 ( -1 +0 ^0) Monotonicity of restriction 2
SET256 ( -1 +0 ^0) Monotonicity of restriction 3
SET257 ( -1 +0 ^0) Restriction property 5
SET258 ( -1 +0 ^0) Domain alternate definition 1
SET259 ( -1 +0 ^0) Domain alternate definition 2
SET260 ( -1 +0 ^0) Domain alternate definition 3
SET261 ( -1 +0 ^0) Domain of null class is the null class
SET262 ( -1 +0 ^0) Domain of universal class is the universal class
SET263 ( -1 +0 ^0) Domain preserves union
SET264 ( -1 +0 ^0) Domain is monotonic 1
SET265 ( -1 +0 ^0) Domain is monotonic 2
SET266 ( -1 +0 ^0) Domain is monotonic 3
SET267 ( -1 +0 ^0) Domain is monotonic 4
SET268 ( -1 +0 ^0) Domain property 1
SET269 ( -1 +0 ^0) Domain only considers ordered pairs
SET270 ( -1 +0 ^0) Domain property 2
SET271 ( -1 +0 ^0) Corollary to domain property 2
SET272 ( -1 +0 ^0) Domain property 3
SET273 ( -1 +0 ^0) Corollary to domain property 3
SET274 ( -1 +0 ^0) Domain property 4
SET275 ( -1 +0 ^0) Corollary 1 to domain property 4
SET276 ( -1 +0 ^0) Corollary 2 to domain property 4
SET277 ( -1 +0 ^0) Corollary 3 to domain property 4
SET278 ( -1 +0 ^0) Corollary 4 to domain property 4
SET279 ( -1 +0 ^0) Domain property 5
SET280 ( -1 +0 ^0) Domain property 6
SET281 ( -1 +0 ^0) Domain relation is a function
SET282 ( -1 +0 ^0) Domain of domain relation
SET283 ( -1 +0 ^0) Apply domain relation
SET284 ( -1 +0 ^0) Image of domain relation
SET285 ( -1 +0 ^0) Domain property 7
SET286 ( -1 +0 ^0) Corollary to domain property 7
SET287 ( -1 +0 ^0) Domain property 8
SET288 ( -1 +0 ^0) Domain property 9
SET289 ( -1 +0 ^0) Proof of Goedel's axiom B6, part 1
SET290 ( -1 +0 ^0) Proof of Goedel's axiom B6, part 2
SET291 ( -1 +0 ^0) Proof of Goedel's axiom B6, part 3
SET292 ( -1 +0 ^0) Inverse of null class is the null class
SET293 ( -1 +0 ^0) Inverse of universal class is the universal class
SET294 ( -1 +0 ^0) Inverse distributes over union
SET295 ( -1 +0 ^0) Inverse distributes over intersection
SET296 ( -1 +0 ^0) Domain of inverse
SET297 ( -1 +0 ^0) Range of inverse
SET298 ( -1 +0 ^0) Inverse of complement
SET299 ( -1 +0 ^0) Inverse of product
SET300 ( -1 +0 ^0) Inverse of inverse
SET301 ( -1 +0 ^0) Inverse commutes with restriction
SET302 ( -1 +0 ^0) Range alternate definition 1
SET303 ( -1 +0 ^0) Range alternate definition 2
SET304 ( -1 +0 ^0) Range alternate definition 3
SET305 ( -1 +0 ^0) Range of null class is the null class
SET306 ( -1 +0 ^0) Range of universal class is the universal class
SET307 ( -1 +0 ^0) Range preserves union
SET308 ( -1 +0 ^0) Monotonicity of range 1
SET309 ( -1 +0 ^0) Monotonicity of range 2
SET310 ( -1 +0 ^0) Monotonicity of range 3
SET311 ( -1 +0 ^0) Range property 1
SET312 ( -1 +0 ^0) Range only considers ordered pairs
SET313 ( -1 +0 ^0) Range property 2
SET314 ( -1 +0 ^0) Range property 3
SET315 ( -1 +0 ^0) Corollary to range property 3
SET316 ( -1 +0 ^0) Range property 4
SET317 ( -1 +0 ^0) Corollary 1 to range property 4
SET318 ( -1 +0 ^0) Corollary 2 to range property 4
SET319 ( -1 +0 ^0) Corollary 3 to range property 4
SET320 ( -1 +0 ^0) Corollary 4 to range property 4
SET321 ( -1 +0 ^0) Range property 5
SET322 ( -1 +0 ^0) Range property 6
SET323 ( -1 +0 ^0) Range property 7
SET324 ( -1 +0 ^0) Image alternate definition 1
SET325 ( -1 +0 ^0) Image alternate definition 2
SET326 ( -1 +0 ^0) Corollary to image alternate definition 2
SET327 ( -1 +0 ^0) Image alternate definition 3
SET328 ( -1 +0 ^0) Corollary to image alternate definition 3
SET329 ( -1 +0 ^0) Image alternate definition 4
SET330 ( -1 +0 ^0) Corollary to image alternate definition 4
SET331 ( -1 +0 ^0) Range is image of the domain
SET332 ( -1 +0 ^0) Corollary to range is image of domain
SET333 ( -1 +0 ^0) Monotonicity of image 1
SET334 ( -1 +0 ^0) Monotonicity of image 2
SET335 ( -1 +0 ^0) Image property 1
SET336 ( -1 +0 ^0) Corollary 1 image property 1
SET337 ( -1 +0 ^0) Corollary 2 image property 1
SET338 ( -1 +0 ^0) Corollary 3 image property 1
SET339 ( -1 +0 ^0) Subclass alternate definition 1
SET340 ( -1 +0 ^0) Subclass alternate definition 2
SET341 ( -1 +0 ^0) Image under universal class
SET342 ( -1 +0 ^0) Image of union
SET343 ( -1 +0 ^0) Image of intersection
SET344 ( -1 +0 ^0) Sum class alternate definition 1
SET345 ( -1 +0 ^0) Sum class alternate definition 2
SET346 ( -1 +0 ^0) Sum class alternate definition 3
SET347 ( -1 +1 ^0) Sum of the empty set is the empty set
SET348 ( -1 +0 ^0) Sum class of universal class is universal class
SET349 ( -1 +0 ^0) Sum class of singleton null is null class 1
SET350 ( -1 +0 ^0) Sum class of singleton null is null class 2
SET351 ( -1 +1 ^0) Sum of a singleton is the singleton member
SET352 ( -1 +1 ^0) The sum of an unordered pair is the union of the pair
SET353 ( -1 +0 ^0) Corollary to sum of pair
SET354 ( -1 +0 ^0) Sum of ordered pair
SET355 ( -1 +1 ^0) If X is in Y, then X is a subset of the sum of Y
SET356 ( -1 +0 ^0) Corollary to subclass of union
SET357 ( -1 +0 ^0) Sum class alternate definition 4
SET358 ( -1 +1 ^0) Sum distributes over union
SET359 ( -1 +0 ^0) Sum class property 1
SET360 ( -1 +0 ^0) Domain is sum squared
SET361 ( -1 +0 ^0) Range is sum squared
SET362 ( -1 +0 ^0) Monotonicity of sum
SET363 ( -1 +0 ^0) Power class alternative definition 1
SET364 ( -1 +0 ^0) Power class alternative definition 2
SET365 ( -1 +0 ^0) Monotonicity of power
SET366 ( -1 +1 ^0) The empty set is in every power set
SET367 ( -1 +0 ^0) Power class not in null class
SET368 ( -1 +0 ^0) Power class of universal class is universal class
SET369 ( -1 +0 ^0) Power class of set
SET370 ( -1 +0 ^0) Power class property 1
SET371 ( -1 +0 ^0) Power class property 2
SET372 ( -1 +1 ^0) Power set distributes over intersection
SET373 ( -1 +0 ^0) Power class property 4
SET374 ( -1 +0 ^0) Power class is closed under union
SET375 ( -1 +0 ^0) Power class is closed under intersection
SET376 ( -1 +0 ^0) Power class set builder
SET377 ( -1 +0 ^0) Corollary 1 to power class set builder
SET378 ( -1 +0 ^0) Corollary 2 to power class set builder
SET379 ( -1 +0 ^0) Corollary 3 to power class set builder
SET380 ( -1 +0 ^0) Relation property 1
SET381 ( -1 +0 ^0) Relation property 2
SET382 ( -1 +0 ^0) Corollary 1 to relation property 2
SET383 ( -1 +0 ^0) Corollary 2 to relation property 2
SET384 ( -1 +0 ^0) Corollary 1 to relation property 3
SET385 ( -1 +0 ^0) Corollary 2 to relation property 3
SET386 ( -1 +0 ^0) Relation property 4
SET387 ( -1 +0 ^0) Composition alternate definition 1
SET388 ( -1 +0 ^0) Composition alternate definition 2
SET389 ( -1 +0 ^0) Composition alternate definition 3
SET390 ( -1 +0 ^0) Composition alternate definition 4
SET391 ( -1 +0 ^0) Composition property 1
SET392 ( -1 +0 ^0) Right identity for composition
SET393 ( -1 +0 ^0) Left identity for composition
SET394 ( -1 +0 ^0) Composition property 2
SET395 ( -1 +0 ^0) Composition relates to image
SET396 ( -1 +0 ^0) Domain of composition 1
SET397 ( -1 +0 ^0) Range of composition
SET398 ( -1 +0 ^0) Associativity of composition
SET399 ( -1 +0 ^0) Left compose with null class
SET400 ( -1 +0 ^0) Right compose with null class
SET401 ( -1 +0 ^0) Left compose with universal class
SET402 ( -1 +0 ^0) Right compose with universal class
SET403 ( -1 +0 ^0) Domain of composition 2
SET404 ( -1 +0 ^0) Monotonicity of composition 1
SET405 ( -1 +0 ^0) Monotonicity of composition 2
SET406 ( -1 +0 ^0) Corollary 1 monotonicity of composition
SET407 ( -1 +0 ^0) Corollary 2 monotonicity of composition
SET408 ( -1 +0 ^0) Inverse of composition
SET409 ( -1 +0 ^0) Composition of element relation 1
SET410 ( -1 +0 ^0) Composition of element relation 2
SET411 ( -1 +0 ^0) Compose condition for singleton membership 1
SET412 ( -1 +0 ^0) Compose condition for singleton membership 2
SET413 ( -1 +0 ^0) Compose condition for singleton membership 3
SET414 ( -1 +0 ^0) Composition distributes over union
SET415 ( -1 +0 ^0) Composition with singleton function 1
SET416 ( -1 +0 ^0) Composition with singleton function 2
SET417 ( -1 +0 ^0) Composition property 1
SET418 ( -1 +0 ^0) Composition property 2
SET419 ( -1 +0 ^0) Composition property 3
SET420 ( -1 +0 ^0) Composition property 4
SET421 ( -1 +0 ^0) Compose class is a function
SET422 ( -1 +0 ^0) Compose class and apply
SET423 ( -1 +0 ^0) Sum compose class
SET424 ( -1 +0 ^0) Compose class and composition function are related
SET425 ( -1 +0 ^0) Single valued class alternate definition 1
SET426 ( -1 +0 ^0) Single valued class alternate definition 2
SET427 ( -1 +0 ^0) Single valued class alternate definition 3
SET428 ( -1 +0 ^0) Single valued class alternate definition 4
SET429 ( -1 +0 ^0) A subclass of a single-valued class is single-valued
SET430 ( -1 +0 ^0) In a single-valued class, each image is a singleton
SET431 ( -1 +0 ^0) The composition of single-valued classes is single-valued
SET432 ( -1 +0 ^0) Function alternate definition 1
SET433 ( -1 +0 ^0) Function alternate definition 2
SET434 ( -1 +0 ^0) Function alternate definition 3
SET435 ( -1 +0 ^0) Function alternate definition 4
SET436 ( -1 +0 ^0) Subclass of function is a function, part 1
SET437 ( -1 +0 ^0) Subclass of function is a function, part 2
SET438 ( -1 +0 ^0) In a function, the image of each domain element is a singleton
SET439 ( -1 +0 ^0) Null class is a function
SET440 ( -1 +0 ^0) The restriction of function is function
SET441 ( -1 +0 ^0) The intersection of functions is a function
SET442 ( -1 +0 ^0) Restriction of function
SET443 ( -1 +0 ^0) Difference of functions is a function
SET444 ( -1 +0 ^0) Function property 1
SET445 ( -1 +0 ^0) Corollary to function property 1
SET446 ( -1 +0 ^0) Function property 2
SET447 ( -1 +0 ^0) Function property 3
SET448 ( -1 +0 ^0) Function property 4
SET449 ( -1 +0 ^0) Condition 1 for one function to be a subset of another
SET450 ( -1 +0 ^0) Condition 2 for one function to be a subset of another
SET451 ( -1 +0 ^0) Subset relation alternate definition 1
SET452 ( -1 +0 ^0) Subset relation alternate definition 2
SET453 ( -1 +0 ^0) Subset relation alternate definition 3
SET454 ( -1 +0 ^0) Identity alternate definition 1
SET455 ( -1 +0 ^0) Identity alternate definition 2
SET456 ( -1 +0 ^0) Identity alternate definition 3
SET457 ( -1 +0 ^0) Identity is a function
SET458 ( -1 +0 ^0) Corollary to identity is a function
SET459 ( -1 +0 ^0) Domain of identity is the universal class
SET460 ( -1 +0 ^0) Range of identity
SET461 ( -1 +0 ^0) Domain of restricted identity
SET462 ( -1 +0 ^0) Range of restricted identity
SET463 ( -1 +0 ^0) Corollary to domain and range of identity
SET464 ( -1 +0 ^0) Class image under identity
SET465 ( -1 +0 ^0) Identity is one-to-one
SET466 ( -1 +0 ^0) Inverse of identity is identity
SET467 ( -1 +0 ^0) Sets with at most one member 1
SET468 ( -1 +0 ^0) Sets with at most one member 2
SET469 ( -1 +0 ^0) Sets with at most one member 3
SET470 ( -1 +0 ^0) Corollary to sets with one member
SET471 ( -1 +0 ^0) Sets with more than one member 1
SET472 ( -1 +0 ^0) Sets with more than one member 2
SET473 ( -1 +0 ^0) Lemma 1 to restricted domain
SET474 ( -1 +0 ^0) Lemma 2 to restricted domain
SET475 ( -1 +0 ^0) Restricted domain
SET476 ( -1 +0 ^0) Intersection subclass
SET477 ( -1 +0 ^0) Axiom of subsets 1
SET478 ( -1 +0 ^0) Axiom of subsets 2
SET479 ( -1 +0 ^0) Replacement property 1
SET480 ( -1 +0 ^0) Replacement property 2
SET481 ( -1 +0 ^0) Replacement property 3
SET482 ( -1 +0 ^0) Replacement property 4
SET483 ( -1 +0 ^0) Replacement property 5
SET484 ( -1 +0 ^0) Replacement property 6
SET485 ( -1 +0 ^0) Replacement property 7
SET486 ( -1 +0 ^0) Replacement property 8
SET487 ( -1 +0 ^0) Replacement property 9
SET488 ( -1 +0 ^0) Replacement property 10
SET489 ( -1 +0 ^0) Replacement property 11
SET490 ( -1 +0 ^0) Replacement property 12
SET491 ( -1 +0 ^0) Diagonalization lemma 1
SET492 ( -1 +0 ^0) Diagonalization lemma 2
SET493 ( -1 +0 ^0) Diagonalization corollary
SET494 ( -1 +0 ^0) Diagonalization alternate definition 1
SET495 ( -1 +0 ^0) Diagonalization alternate definition 2
SET496 ( -1 +0 ^0) Diagonalization alternate definition 3
SET497 ( -1 +0 ^0) Special case of the Russell class, without the regularity axiom
SET498 ( -1 +0 ^0) Special case of the Russell class, without the regularity axiom
SET499 ( -1 +0 ^0) The Russell class not a set
SET500 ( -1 +0 ^0) Diagonalization property 1
SET501 ( -1 +0 ^0) Diagonalization property 2
SET502 ( -1 +0 ^0) Diagonalization property 3
SET503 ( -1 +0 ^0) The universal class not set
SET504 ( -1 +0 ^0) Corollary 1 to universal class not set
SET505 ( -1 +0 ^0) Corollary 2 to universal class not set
SET506 ( -1 +0 ^0) Universal class not null class
SET507 ( -1 +0 ^0) Universal class not subclass of null class
SET508 ( -1 +0 ^0) Corollary 1 to singleton in unordered pair axiom
SET509 ( -1 +0 ^0) Corollary 2 to singleton in unordered pair axiom
SET510 ( -1 +0 ^0) Corollary to singleton is null class
SET511 ( -1 +0 ^0) Corollary 1 to special members of ordered pairs
SET512 ( -1 +0 ^0) Corollary 2 to special members of ordered pairs
SET513 ( -1 +0 ^0) Corollary 3 to special members of ordered pairs
SET514 ( -1 +0 ^0) Class of ordered pairs is not a set
SET515 ( -1 +0 ^0) No class belongs to itself
SET516 ( -1 +0 ^0) Corollary to no class belongs to itself
SET517 ( -1 +0 ^0) If member of X is X then X is not a singleton of a set
SET518 ( -1 +0 ^0) There are no cycles of length 2
SET519 ( -1 +0 ^0) Corollary 1 to no cycles of length 2
SET520 ( -1 +0 ^0) Corollary 2 to no cycles of length 2
SET521 ( -1 +0 ^0) Ordered pair determines components 1
SET522 ( -1 +0 ^0) Ordered pair determines components 2
SET523 ( -1 +0 ^0) Element and complement can't both be sets
SET524 ( -1 +0 ^0) Equivalent condition 1 for x not to be an ordered pair
SET525 ( -1 +0 ^0) Equivalent condition 2 for x not to be an ordered pair
SET526 ( -1 +0 ^0) Ordered pair components are sets 1
SET527 ( -1 +0 ^0) Ordered pair components are sets 2
SET528 ( -1 +0 ^0) Corollary 1 to ordered pair components are sets
SET529 ( -1 +0 ^0) Corollary 2 to ordered pair components are sets
SET530 ( -1 +0 ^0) Corollary 3 to ordered pair components are sets
SET531 ( -1 +0 ^0) Application property 1
SET532 ( -1 +0 ^0) Application property 2
SET533 ( -1 +0 ^0) The range of Z is the class of applications of Z to Z's domain 1
SET534 ( -1 +0 ^0) The range of Z is the class of applications of Z to Z's domain 2
SET535 ( -1 +0 ^0) Application property 3
SET536 ( -1 +0 ^0) Corollary 1 to application property 3
SET537 ( -1 +0 ^0) Corollary 2 to application property 3
SET538 ( -1 +0 ^0) Application property 4
SET539 ( -1 +0 ^0) Application property 5
SET540 ( -1 +0 ^0) Application property 6
SET541 ( -1 +0 ^0) Application property 7
SET542 ( -1 +0 ^0) Corollary to application property 9
SET543 ( -1 +0 ^0) Corollary to application property 10
SET544 ( -1 +0 ^0) Corollary to application property 11
SET545 ( -1 +0 ^0) Application special case 1
SET546 ( -1 +0 ^0) Application special case 2
SET547 ( -1 +0 ^0) Application special case 3
SET548 ( -1 +0 ^0) Application property 16
SET549 ( -1 +0 ^0) Application property 17
SET550 ( -1 +0 ^0) Application property 18
SET551 ( -1 +0 ^0) Application property 19
SET552 ( -1 +0 ^0) Application property 20
SET553 ( -1 +0 ^0) Cantor class alternate definition 1
SET554 ( -1 +0 ^0) Cantor class alternate definition 2
SET555 ( -1 +0 ^0) Cantor class alternate definition 3
SET556 ( -1 +0 ^0) Cantor class property 1
SET557 ( -1 +0 ^1) Cantor's theorem
SET558 ( -1 +0 ^0) Compatible functions alternate definition 1
SET559 ( -1 +0 ^0) Compatible functions alternate definition 2
SET560 ( -1 +0 ^0) Compatible functions alternate definition 3
SET561 ( -1 +0 ^0) Compatible function property 1
SET562 ( -1 +0 ^0) Compatible function property 2
SET563 ( -1 +0 ^0) Compatible function property 3
SET564 ( -1 +0 ^0) Corollary 1 to compatible function property 3
SET565 ( -1 +0 ^0) Corollary 2 to compatible function property 3
SET566 ( -1 +0 ^0) Compatible function property 4
SET567 ( -1 +0 ^0) Compatible function special case
SET573 ( -0 +1 ^0) Trybulec's 12th Boolean property of sets
SET574 ( -0 +1 ^0) Trybulec's 13th Boolean property of sets
SET575 ( -0 +1 ^0) Trybulec's 15th Boolean property of sets
SET576 ( -0 +1 ^0) Trybulec's 17th Boolean property of sets
SET577 ( -0 +1 ^0) Trybulec's 18th Boolean property of sets
SET578 ( -0 +1 ^0) Trybulec's 19th Boolean property of sets
SET579 ( -0 +1 ^0) Trybulec's 20th Boolean property of sets
SET580 ( -0 +1 ^1) x is in X sym\ Y iff x is in X iff x is not in Y
SET581 ( -0 +1 ^0) Trybulec's 24th Boolean property of sets
SET582 ( -0 +1 ^0) If x not in X iff x in Y iff x in Z, then X = Y sym\ Z
SET583 ( -0 +1 ^0) Extensionality
SET584 ( -0 +1 ^0) If X (= Y, then X U Z (= Y U Z
SET585 ( -0 +1 ^0) The intersection of X and Y is a subset of the union of X and Z
SET586 ( -0 +1 ^0) If X (= Y, then X ^ Z (= Y ^ Z
SET587 ( -0 +1 ^0) X \ Y = the empty set iff X (= Y
SET588 ( -0 +1 ^0) If X (= Y, then X \ Z (= Y \ Z
SET589 ( -0 +1 ^0) If X (= Y and Z (= V, then X \ V (= Y \ Z
SET590 ( -0 +1 ^0) The difference of X and Y is a subset of X
SET591 ( -0 +1 ^0) If X (= Y \ X, then X = the empty set
SET592 ( -0 +1 ^0) If X (= Y and X (= Z and Y ^ Z = empty set, then X = empty set
SET593 ( -0 +1 ^0) If X (= Y U Z, then X \ Y (= Z and X \ Z (= Y
SET594 ( -0 +1 ^0) If X ^ Y U X ^ Z = X, then X (= Y U Z
SET595 ( -0 +2 ^0) If X (= Y, then Y = X U (Y \ X)
SET596 ( -0 +1 ^0) If X (= Y and Y ^ Z = the empty set, then X ^ Z = the empty set
SET597 ( -0 +1 ^0) X = Y U Z iff Y (= X, Z (= X, !V: Y (= V & Z (= V, X (= V
SET598 ( -0 +1 ^0) X = Y ^ Z iff X (= Y, X (= Z, !V: V (= Y & V (= Z, V (= X
SET599 ( -0 +1 ^0) X \ Y (= X sym\ Y
SET600 ( -0 +1 ^0) X U Y = empty set iff X = empty set & Y = empty set
SET601 ( -0 +1 ^1) X ^ Y U Y ^ Z U Z ^ X = (X U Y) ^ (Y U Z) ^ (Z U X)
SET602 ( -0 +2 ^0) The difference of X and X is the empty set
SET603 ( -0 +2 ^0) The difference of X and the empty set is X
SET604 ( -0 +1 ^0) The difference of the empty set and X is the empty set
SET605 ( -0 +1 ^0) The difference of X and the union of X and Y is the empty set
SET606 ( -0 +1 ^1) X \ X ^ Y = X \ Y
SET607 ( -0 +1 ^1) X U (Y \ X) = X U Y
SET608 ( -0 +1 ^0) X ^ Y U (X \ Y) = X
SET609 ( -0 +1 ^1) X \ (Y \ Z) = (X \ Y) U X ^ Z
SET610 ( -0 +1 ^0) (X U Y) \ Y = X \ Y
SET611 ( -0 +1 ^1) X ^ Y = the empty set iff X \ Y = X
SET612 ( -0 +1 ^1) X \ (Y U Z) = (X \ Y) ^ (X \ Z)
SET613 ( -0 +1 ^0) (X U Y) \ X ^ Y = (X \ Y) U (Y \ X)
SET614 ( -0 +1 ^1) X \ Y \ Z = X \ (Y U Z)
SET615 ( -0 +1 ^1) (X U Y) \ Z = (X \ Z) U (Y \ Z)
SET616 ( -0 +1 ^0) If X \ Y = Y \ X, then X = Y
SET617 ( -0 +1 ^0) X sym\ the empty set = X and the empty set sym\ X = X
SET618 ( -0 +1 ^0) The symmetric difference of X and X is the empty set
SET619 ( -0 +1 ^0) X U Y = (X sym\ Y) U X ^ Y
SET620 ( -0 +1 ^0) X sym\ Y = (X U Y) \ X ^ Y
SET621 ( -0 +1 ^0) (X sym\ Y) \ Z = (X \ (Y U Z)) U (Y \ (X U Z))
SET622 ( -0 +1 ^0) X \ (Y sym\ Z) = (X \ (Y U Z)) U X ^ Y ^ Z
SET623 ( -0 +1 ^1) (X sym\ Y) sym\ Z = X sym\ (Y sym\ Z)
SET624 ( -0 +1 ^1) X intersects Y U Z iff X intersects Y or X intersects Z
SET625 ( -0 +1 ^0) If X intersects Y and Y is a subset of Z, then X intersects Z
SET626 ( -0 +1 ^0) If X intersects the intersection of Y and Z, then X intersects Y
SET627 ( -0 +1 ^0) X is disjoint from the empty set
SET628 ( -0 +1 ^0) X intersects X iff X is not the empty set
SET629 ( -0 +1 ^0) X ^ Y is disjoint from X \ Y
SET630 ( -0 +1 ^1) X ^ Y is disjoint from X sym\ Y
SET631 ( -0 +1 ^0) If X intersects the difference of Y and Z, then X intersects Y
SET632 ( -0 +1 ^0) If X (= Y & X (= Z & Y disjoint from Z, then X = empty set 
SET633 ( -0 +1 ^0) If X \ Y (= Z and Y \ X (= Z, then X sym\ Y (= Z
SET634 ( -0 +1 ^0) X ^ (Y \ Z) = X ^ Y \ Z
SET635 ( -0 +1 ^0) X ^ (Y \ Z) = X ^ Y \ X ^ Z
SET636 ( -0 +1 ^0) X is disjoint from Y iff X ^ Y = the empty set
SET637 ( -0 +1 ^0) Trybulec's 119th Boolean property of sets
SET638 ( -0 +1 ^0) If X (= Y U Z and X ^ Z = the empty set , then X (= Y
SET639 ( -0 +1 ^0) Trybulec's 121th Boolean property of sets
SET640 ( -0 +1 ^1) A a subset of R (X to Y) => A a subset of X x Y
SET641 ( -0 +1 ^0) If A is a subset of X x Y then A is a relation from X to Y
SET642 ( -0 +1 ^0) A a subset of R (X to Y) => A is (X to Y)
SET643 ( -0 +1 ^0) X x Y is a relation from X to Y
SET644 ( -0 +1 ^0) a in R (X to Y) => ? x, y : a is <x,y> & x in X & y in Y
SET645 ( -0 +1 ^0) <x,y> in R (X to Y) => x in X & y in Y
SET646 ( -0 +1 ^1) If x is in X and y is in Y then {<x,y>} is from X to Y.
SET647 ( -0 +1 ^1) Domain of R (X to Y) a subset of X => R is (X to range of R)
SET648 ( -0 +1 ^1) Range of R (X to Y) a subset of Y => R is (domain of R to Y)
SET649 ( -0 +1 ^1) Domain R a subset of X & range R a subset of Y => R is (X to Y)
SET650 ( -0 +1 ^0) Domain of R (X to Y) a subset of X & range of R a subset of Y
SET651 ( -0 +1 ^1) Domain of R (X to Y) a subset of X1 => R is (X1 to Y)
SET652 ( -0 +1 ^0) Range of R (X to Y) a subset of Y1 => R is (X to Y1)
SET653 ( -0 +1 ^0) X a subset of X1 => R (X to Y) is (X1 to Y)
SET654 ( -0 +1 ^0) Y a subset of Y1 => R (X to Y) is (X to Y1)
SET655 ( -0 +1 ^0) X a subset of X1 & Y a subset of Y1 => R (X to Y) is (X1 to Y1)
SET656 ( -0 +1 ^0) The intersection of a relation R from X to Y and X x Y is R
SET657 ( -0 +1 ^1) The field of a relation R from X to Y is a subset of X unio
SET658 ( -0 +1 ^0) Every R (X to Y) is (domain of R to range of R)
SET659 ( -0 +1 ^0) For every x in X ? y : <x,y> in R (X to Y) iff domain of R is X
SET660 ( -0 +1 ^0) For every y in Y ? x : <x,y> in R (X to Y) iff range of R is Y
SET661 ( -0 +1 ^0) Domain of R^-1 is range of R, & range of R^-1 is domain of R
SET662 ( -0 +1 ^0) The empty set is a relation from X to Y
SET663 ( -0 +1 ^0) R (X to Y) is (empty set to Y) => R is empty set
SET664 ( -0 +1 ^0) R (X to Y) is (X to empty set) => R is empty set
SET665 ( -0 +1 ^0) The identity relation on X is a subset of X x X
SET666 ( -0 +1 ^0) The identity relation on X is a relation from X to X
SET667 ( -0 +1 ^0) Id on A subset of R => A subset domain R & A subset range R
SET668 ( -0 +1 ^0) Id on X subset of R  => X is domain R & X subset of range R
SET669 ( -0 +1 ^1) Id on Y subset of R  => Y subset of domain R & Y is range R
SET670 ( -0 +1 ^1) R (X to Y) restricted to X1 is (X1 to Y)
SET671 ( -0 +1 ^1) X a subset of X1 => R (X to Y) restricted to X1 is R
SET672 ( -0 +1 ^1) Y1 restricted to R (X to Y) is (X to Y1)
SET673 ( -0 +1 ^1) Y a subset of Y1 => Y1 restricted to R (X to Y) is R
SET674 ( -0 +1 ^0) R (X to Y) o X is the range R & R^-1(Y) is the domain of R
SET675 ( -0 +1 ^0) R o R^-1(Y) is the range of R & R^-1(R o X) is the domain of R
SET676 ( -0 +1 ^0) X x X is a binary relation on X
SET677 ( -0 +1 ^0) Id on X a subset of R => X is domain of R & X is range of R
SET678 ( -0 +1 ^0) R o Id on X is R & Id on X o R is R
SET679 ( -0 +1 ^0) The identity relation on D is not the empty set
SET680 ( -0 +1 ^1) !x in D, x the domain of R (X to Y) iff ?y in E : <x,y> in R
SET681 ( -0 +1 ^0) !y in E, y in range of R (X to Y) iff ?x in D : <x,y> in R
SET682 ( -0 +1 ^0) !x in D : x in domain of R (X to Y) ? y in E : y in range of R
SET683 ( -0 +1 ^1) !y in E : y in range of R (X to Y) ?x in D : x in domain of R
SET684 ( -0 +1 ^1) <x,z> in P(DtoE) o R(EtoF) iff ?y in E:<x,y> in P & <y,z> in R
SET685 ( -0 +1 ^0) y in R (X to Y) o D1 iff ?x in D : <x,y> in R & x in D1
SET686 ( -0 +1 ^0) x in R^-1(D2) iff ?y in E : <x,y> in R (X to Y) & y in D2
SET687 ( -0 +1 ^0) A set is a subset of itself
SET688 ( -0 +1 ^0) Property of proper subset 
SET689 ( -0 +1 ^0) Property of subset 
SET690 ( -0 +1 ^0) Property of union and intersection
SET691 ( -0 +1 ^0) A set is a subset of empty set if and only if it is equal to it 
SET692 ( -0 +1 ^0) A = A ^ B iff A (= B
SET693 ( -0 +1 ^0) Property of union
SET694 ( -0 +1 ^0) Union of power sets is a subset of the power set of the union
SET695 ( -0 +1 ^0) Difference of subsets
SET696 ( -0 +1 ^0) If A (= E, then (E / A) ^ A = empty set
SET697 ( -0 +1 ^0) Property of intersection and difference
SET698 ( -0 +1 ^0) Property of union and difference
SET699 ( -0 +1 ^0) Property of intersection and difference 1
SET700 ( -0 +1 ^0) Property of intersection and difference 2
SET701 ( -0 +1 ^0) Property of intersection and difference 3
SET702 ( -0 +1 ^0) Property of product and intersection
SET703 ( -0 +1 ^0) Union of singletons
SET704 ( -0 +1 ^0) If X is a member of A, then product(A) is a subset of X
SET705 ( -0 +1 ^0) A is a member of power_set(A)
SET706 ( -0 +1 ^0) Property of difference
SET707 ( -0 +1 ^0) Components of equal ordered pairs are equal 
SET708 ( -0 +1 ^0) The composition of mappings is unique
SET709 ( -0 +1 ^0) The composition of mappings is a mapping
SET710 ( -0 +1 ^0) Associativity of composition
SET711 ( -0 +1 ^0) The inverse of a mapping is unique
SET712 ( -0 +1 ^0) The inverse of a one-to-one mapping is a mapping
SET713 ( -0 +1 ^0) The inverse of a one-to-one mapping is one-to-one
SET714 ( -0 +1 ^0) The composition of inverse(F) and F is the identity
SET715 ( -0 +1 ^0) The composition of F and its inverse is the identity
SET716 ( -0 +1 ^1) The composition of injective mappings is injective
SET717 ( -0 +1 ^0) The composition of surjective mappings is surjective
SET718 ( -0 +1 ^0) The composition of one-to-one  mappings is one-to-one
SET719 ( -0 +1 ^0) Inverse of composition 
SET720 ( -0 +1 ^0) The inverse of the inverse of a mapping is equal to the mapping
SET721 ( -0 +1 ^0) If the composition of F and G is injective, then F is injective
SET722 ( -0 +1 ^0) If the composition of F and G is surjective, then F is surjective
SET723 ( -0 +1 ^0) If FoG = FoH and F is injective, then G = H
SET724 ( -0 +1 ^1) If GoF = HoF and F is surjective, then G = H
SET725 ( -0 +1 ^0) If GoF and FoH are identities, then F is one-to-one
SET726 ( -0 +1 ^0) If GoF and FoH are identities, then inverse(F) = G
SET727 ( -0 +1 ^0) If GoF and FoH are identities, then inverse(F) = H
SET728 ( -0 +1 ^0) If GoF and FoH are identities, then G = H
SET729 ( -0 +1 ^0) F is one-to-one and inverse(F)=F iff FoF is the identity
SET730 ( -0 +1 ^0) Property of restriction 1
SET731 ( -0 +1 ^0) Property of restriction 2
SET732 ( -0 +1 ^0) Property of restriction 3
SET733 ( -0 +1 ^0) If GoF is the identity, then F is injective
SET734 ( -0 +1 ^0) If GoF is the identity, then G is surjective
SET735 ( -0 +1 ^0) Property of mappings
SET736 ( -0 +1 ^0) Problem on composition of mappings 1
SET737 ( -0 +1 ^0) Problem on composition of mappings 2
SET738 ( -0 +1 ^0) Problem on composition of mappings 3
SET739 ( -0 +1 ^0) Problem on composition of mappings 4
SET740 ( -0 +1 ^0) Problem on composition of mappings 5
SET741 ( -0 +1 ^1) Problem on composition of mappings 6
SET742 ( -0 +1 ^0) Problem on composition of mappings 7
SET743 ( -0 +1 ^0) Problem on composition of mappings 8
SET744 ( -0 +1 ^0) Problem on composition of mappings 9
SET745 ( -0 +1 ^0) Problem on composition of mappings 10
SET746 ( -0 +1 ^0) If F and G and increasing, then GoF is increasing
SET747 ( -0 +1 ^1) If F is increasing and G decreasing, then GoF is decreasing
SET748 ( -0 +1 ^0) If F is decreasing and G increasing, then GoF is decreasing
SET749 ( -0 +1 ^0) If F and G and decreasing, then GoF is increasing
SET750 ( -0 +1 ^0) Property of isomorphism
SET751 ( -0 +1 ^0) If X is a subset of Y, then the image f(X) is a subset of f(Y)
SET752 ( -0 +1 ^1) The image of union is equal to the union of images 
SET753 ( -0 +1 ^1) Image of intersection is a subset of intersection of images
SET754 ( -0 +1 ^0) C is a subset of the inverse image of the image of C 
SET755 ( -0 +1 ^0) If X is a subset of Y, then f-1(X) is a subset of f-1(Y)
SET756 ( -0 +1 ^0) Inverse image of union equals the union of inverse images 
SET757 ( -0 +1 ^0) Inverse image intersection equals intersection inverse images
SET758 ( -0 +1 ^0) The image of the inverse image of Y is a subset of Y 
SET759 ( -0 +1 ^0) Composition of images 1
SET760 ( -0 +1 ^0) Composition of images 2
SET761 ( -0 +1 ^0) Intersection of images
SET762 ( -0 +1 ^0) The image of empty set is empty 
SET763 ( -0 +1 ^0) If the image of X is empty then X is empty 
SET764 ( -0 +1 ^1) The inverse image of empty set is empty 
SET765 ( -0 +1 ^0) The restriction of an equivalence relation is an equivalence
SET766 ( -0 +1 ^0) A member belongs to its equivalence class 
SET767 ( -0 +1 ^0) Equivalence classes on E are power_set E 
SET768 ( -0 +1 ^0) Equality of equivalence classes 1
SET769 ( -0 +1 ^0) Equality of equivalence classes 2
SET770 ( -0 +1 ^0) Two equivalence classes are equal or disjoint 
SET771 ( -0 +1 ^0) Equality of images defines a equivalence relation 
SET772 ( -0 +1 ^0) Belonging of the same member of a partition is an equivalence 
SET773 ( -0 +1 ^0) Intersection of equivalence relations is an equivalence relation
SET774 ( -0 +1 ^0) The restriction of a pre-order relation is a pre-order relation
SET775 ( -0 +1 ^0) Pre-order and equivalence
SET776 ( -0 +1 ^0) Property of pre-order 
SET777 ( -1 +0 ^0) Set theory membership and subsets axioms
SET778 ( -1 +0 ^0) Set theory membership and union axioms
SET779 ( -1 +0 ^0) Set theory membership and intersection axioms
SET780 ( -1 +0 ^0) Set theory membership and difference axioms
SET781 ( -3 +1 ^0) Set theory axioms based on NBG set theory
SET782 ( -1 +0 ^0) Set theory (Boolean algebra) axioms based on NBG set theory
SET783 ( -0 +1 ^0) Naive set theory axioms based on Goedel's set theory
SET784 ( -0 +1 ^0) Mapping axioms for the SET006+0 set theory axioms
SET785 ( -0 +1 ^0) Equivalence relation axioms for the SET006+0 set theory axioms
SET786 ( -1 +1 ^0) Peter Andrews Problem THM25
SET787 ( -2 +0 ^0) un_eq_Union_2_c2
SET788 ( -0 +1 ^0) Symmetry of equality from set membership
SET789 ( -0 +1 ^0) The greatest element, if it existes, is unique 
SET790 ( -0 +1 ^0) The least element, if it existes, is unique 
SET791 ( -0 +1 ^0) The greatest element, if it exists, is maximal 
SET792 ( -0 +1 ^0) The least element, if it existes, is minimal 
SET793 ( -0 +1 ^0) If the order is total, a maximal element is the greatest element 
SET794 ( -0 +1 ^0) If the order is total, a minimal element is the least element
SET795 ( -0 +1 ^0) If R(a,b) then b is the least upper bound of unordered_pair(a,b)
SET796 ( -0 +1 ^0) If R(a,b) then a is the greatest lower bound of unordered_pair(a,b)
SET797 ( -0 +1 ^0) If X subset Y, then an upper bound of Y is an upper bound of X 
SET798 ( -0 +1 ^0) If X subset Y, then a lower bound of Y is a lower bound of X
SET799 ( -0 +1 ^0) Least upper bounds of set in total order
SET800 ( -0 +1 ^0) Greatest lower bound of sets in total order
SET801 ( -0 +1 ^0) M is the greatest element iff it is a member and a LUB
SET802 ( -0 +1 ^0) M is the least of X iff it is a member and a GLB
SET803 ( -0 +1 ^0) Two different maximal elements implies no greatest element
SET804 ( -0 +1 ^0) Two different minimal elements implies no least element
SET805 ( -0 +1 ^0) Order relation on E is an order relation on a subset of E
SET806 ( -0 +1 ^0) Equality of sets defines a equivalence relation 
SET807 ( -0 +1 ^0) Inclusion of sets defines a pre-order relation
SET808 ( -0 +1 ^0) The members of an ordinal number are ordinal numbers
SET809 ( -0 +1 ^0) An ordinal number is not a member of itself
SET810 ( -0 +1 ^0) Ordinal numbers do not contain each other
SET811 ( -0 +1 ^0) A member of an ordinal number is an initial segment 
SET812 ( -0 +1 ^0) An ordinal A is equal to its intersection with its power-set
SET813 ( -0 +1 ^0) An ordinal number is a member of its successor 
SET814 ( -0 +1 ^0) The sum of an ordinal number is a subset of itself
SET815 ( -0 +1 ^0) An ordinal number is equal to the sum of its successor
SET816 ( -0 +1 ^0) The sum of a collection of ordinal numbers is a collection
SET817 ( -0 +1 ^0) The product of a nonempty set of ordinals is an ordinal
SET818 ( -2 +0 ^0) Problem about set theory
SET819 ( -2 +0 ^0) Problem about set theory
SET820 ( -2 +0 ^0) Problem about set theory
SET821 ( -2 +0 ^0) Problem about set theory
SET822 ( -2 +0 ^0) Problem about set theory
SET824 ( -2 +0 ^0) Problem about set theory
SET825 ( -2 +0 ^0) Problem about set theory
SET826 ( -2 +0 ^0) Problem about set theory
SET827 ( -2 +0 ^0) Problem about set theory
SET828 ( -2 +0 ^0) Problem about set theory
SET829 ( -2 +0 ^0) Problem about set theory
SET830 ( -2 +0 ^0) Problem about set theory
SET831 ( -2 +0 ^0) Problem about set theory
SET832 ( -2 +0 ^0) Problem about set theory
SET833 ( -2 +0 ^0) Problem about set theory
SET834 ( -2 +0 ^0) Problem about set theory
SET835 ( -2 +0 ^0) Problem about set theory
SET836 ( -2 +0 ^0) Problem about set theory
SET837 ( -2 +0 ^0) Problem about set theory
SET838 ( -2 +0 ^0) Problem about set theory
SET839 ( -2 +0 ^0) Problem about set theory
SET840 ( -2 +0 ^0) Problem about set theory
SET841 ( -2 +0 ^0) Problem about Zorn's lemma
SET842 ( -2 +0 ^0) Problem about Zorn's lemma
SET843 ( -2 +0 ^0) Problem about Zorn's lemma
SET844 ( -2 +0 ^0) Problem about Zorn's lemma
SET845 ( -2 +0 ^0) Problem about Zorn's lemma
SET846 ( -2 +0 ^0) Problem about Zorn's lemma
SET847 ( -2 +0 ^0) Problem about Zorn's lemma
SET848 ( -2 +0 ^0) Problem about Zorn's lemma
SET849 ( -2 +0 ^0) Problem about Zorn's lemma
SET850 ( -2 +0 ^0) Problem about Zorn's lemma
SET851 ( -2 +0 ^0) Problem about Zorn's lemma
SET852 ( -2 +0 ^0) Problem about Zorn's lemma
SET853 ( -2 +0 ^0) Problem about Zorn's lemma
SET854 ( -2 +0 ^0) Problem about Zorn's lemma
SET855 ( -2 +0 ^0) Problem about Zorn's lemma
SET856 ( -2 +0 ^0) Problem about Zorn's lemma
SET857 ( -2 +0 ^0) Problem about Zorn's lemma
SET858 ( -2 +0 ^0) Problem about Zorn's lemma
SET859 ( -2 +0 ^0) Problem about Zorn's lemma
SET860 ( -2 +0 ^0) Problem about Zorn's lemma
SET861 ( -2 +0 ^0) Problem about Zorn's lemma
SET862 ( -2 +0 ^0) Problem about Zorn's lemma
SET863 ( -2 +0 ^0) Problem about Zorn's lemma
SET864 ( -2 +0 ^0) Problem about Zorn's lemma
SET865 ( -2 +0 ^0) Problem about Zorn's lemma
SET867 ( -0 +1 ^0) Basic properties of sets, theorem 2
SET872 ( -0 +1 ^0) Basic properties of sets, theorem 12
SET873 ( -0 +1 ^0) Basic properties of sets, theorem 13
SET874 ( -0 +1 ^0) Basic properties of sets, theorem 14
SET875 ( -0 +1 ^0) Basic properties of sets, theorem 16
SET876 ( -0 +1 ^0) Basic properties of sets, theorem 17
SET877 ( -0 +1 ^0) Basic properties of sets, theorem 18
SET878 ( -0 +1 ^0) Basic properties of sets, theorem 19
SET879 ( -0 +1 ^0) Basic properties of sets, theorem 20
SET880 ( -0 +1 ^0) Basic properties of sets, theorem 21
SET881 ( -0 +1 ^0) Basic properties of sets, theorem 22
SET882 ( -0 +1 ^0) Basic properties of sets, theorem 23
SET883 ( -0 +1 ^0) Basic properties of sets, theorem 24
SET884 ( -0 +1 ^0) Basic properties of sets, theorem 25
SET885 ( -0 +1 ^0) Basic properties of sets, theorem 26
SET886 ( -0 +1 ^0) Basic properties of sets, theorem 27
SET887 ( -0 +1 ^0) Basic properties of sets, theorem 28
SET888 ( -0 +1 ^0) Basic properties of sets, theorem 29
SET889 ( -0 +1 ^0) Basic properties of sets, theorem 30
SET890 ( -0 +1 ^0) Basic properties of sets, theorem 31
SET891 ( -0 +1 ^0) Basic properties of sets, theorem 32
SET893 ( -0 +1 ^0) Basic properties of sets, theorem 34
SET894 ( -0 +1 ^0) Basic properties of sets, theorem 35
SET895 ( -0 +1 ^0) Basic properties of sets, theorem 36
SET899 ( -0 +1 ^0) Basic properties of sets, theorem 40
SET900 ( -0 +1 ^0) Basic properties of sets, theorem 41
SET901 ( -0 +1 ^0) Basic properties of sets, theorem 42
SET902 ( -0 +1 ^0) Basic properties of sets, theorem 43
SET903 ( -0 +1 ^0) Basic properties of sets, theorem 44
SET904 ( -0 +1 ^0) Basic properties of sets, theorem 45
SET906 ( -0 +1 ^0) Basic properties of sets, theorem 47
SET907 ( -0 +1 ^0) Basic properties of sets, theorem 48
SET908 ( -0 +1 ^0) Basic properties of sets, theorem 49
SET909 ( -0 +1 ^0) Basic properties of sets, theorem 50
SET910 ( -0 +1 ^0) Basic properties of sets, theorem 51
SET911 ( -0 +1 ^0) Basic properties of sets, theorem 52
SET912 ( -0 +1 ^0) Basic properties of sets, theorem 53
SET913 ( -0 +1 ^0) Basic properties of sets, theorem 54
SET914 ( -0 +1 ^0) Basic properties of sets, theorem 55
SET915 ( -0 +1 ^0) Basic properties of sets, theorem 56
SET916 ( -0 +1 ^0) Basic properties of sets, theorem 57
SET917 ( -0 +1 ^0) Basic properties of sets, theorem 58
SET918 ( -0 +1 ^0) Basic properties of sets, theorem 59
SET919 ( -0 +1 ^0) Basic properties of sets, theorem 60
SET920 ( -0 +1 ^0) Basic properties of sets, theorem 63
SET921 ( -0 +1 ^0) Basic properties of sets, theorem 64
SET923 ( -0 +1 ^0) Basic properties of sets, theorem 66
SET924 ( -0 +1 ^0) Basic properties of sets, theorem 67
SET925 ( -0 +1 ^0) Basic properties of sets, theorem 68
SET926 ( -0 +1 ^0) Basic properties of sets, theorem 69
SET927 ( -0 +1 ^0) Basic properties of sets, theorem 70
SET928 ( -0 +1 ^0) Basic properties of sets, theorem 72
SET929 ( -0 +1 ^0) Basic properties of sets, theorem 73
SET930 ( -0 +1 ^0) Basic properties of sets, theorem 74
SET931 ( -0 +1 ^0) Basic properties of sets, theorem 75
SET932 ( -0 +1 ^0) Basic properties of sets, theorem 79
SET933 ( -0 +1 ^0) Basic properties of sets, theorem 80
SET934 ( -0 +1 ^0) Basic properties of sets, theorem 81
SET935 ( -0 +1 ^0) Basic properties of sets, theorem 82
SET936 ( -0 +1 ^0) Basic properties of sets, theorem 83
SET937 ( -0 +1 ^0) Basic properties of sets, theorem 84
SET938 ( -0 +1 ^0) Basic properties of sets, theorem 86
SET940 ( -0 +1 ^0) Basic properties of sets, theorem 93
SET941 ( -0 +1 ^0) Basic properties of sets, theorem 94
SET942 ( -0 +1 ^0) Basic properties of sets, theorem 95
SET943 ( -0 +1 ^0) Basic properties of sets, theorem 96
SET944 ( -0 +1 ^0) Basic properties of sets, theorem 97
SET945 ( -0 +1 ^0) Basic properties of sets, theorem 98
SET947 ( -0 +1 ^0) Basic properties of sets, theorem 100
SET948 ( -0 +1 ^0) Basic properties of sets, theorem 101
SET949 ( -0 +1 ^0) Basic properties of sets, theorem 102
SET950 ( -0 +1 ^0) Basic properties of sets, theorem 103
SET951 ( -0 +1 ^0) Basic properties of sets, theorem 104
SET952 ( -0 +1 ^0) Basic properties of sets, theorem 105
SET954 ( -0 +1 ^0) Basic properties of sets, theorem 107
SET955 ( -0 +1 ^0) Basic properties of sets, theorem 108
SET956 ( -0 +1 ^0) Basic properties of sets, theorem 109
SET957 ( -0 +1 ^0) Basic properties of sets, theorem 110
SET958 ( -0 +1 ^0) Basic properties of sets, theorem 111
SET959 ( -0 +1 ^0) Basic properties of sets, theorem 112
SET960 ( -0 +1 ^0) Basic properties of sets, theorem 113
SET961 ( -0 +1 ^0) Basic properties of sets, theorem 114
SET962 ( -0 +1 ^0) Basic properties of sets, theorem 115
SET963 ( -0 +1 ^0) Basic properties of sets, theorem 116
SET964 ( -0 +1 ^0) Basic properties of sets, theorem 117
SET967 ( -0 +1 ^0) Basic properties of sets, theorem 120
SET968 ( -0 +1 ^0) Basic properties of sets, theorem 121
SET969 ( -0 +1 ^0) Basic properties of sets, theorem 122
SET970 ( -0 +1 ^0) Basic properties of sets, theorem 123
SET971 ( -0 +1 ^0) Basic properties of sets, theorem 124
SET972 ( -0 +1 ^0) Basic properties of sets, theorem 125
SET973 ( -0 +1 ^0) Basic properties of sets, theorem 126
SET974 ( -0 +1 ^0) Basic properties of sets, theorem 127
SET975 ( -0 +1 ^0) Basic properties of sets, theorem 128
SET976 ( -0 +1 ^0) Basic properties of sets, theorem 129
SET977 ( -0 +1 ^0) Basic properties of sets, theorem 130
SET978 ( -0 +1 ^0) Basic properties of sets, theorem 131
SET979 ( -0 +1 ^0) Basic properties of sets, theorem 132
SET980 ( -0 +1 ^0) Basic properties of sets, theorem 134
SET981 ( -0 +1 ^0) Basic properties of sets, theorem 135
SET983 ( -0 +1 ^0) Basic properties of sets, theorem 137
SET984 ( -0 +1 ^0) Basic properties of sets, theorem 138
SET985 ( -0 +1 ^0) Basic properties of sets, theorem 139
SET986 ( -0 +1 ^0) Basic properties of sets, theorem 140
SET987 ( -0 +1 ^0) Basic properties of sets, theorem 141
SET988 ( -0 +1 ^0) Functions and their basic properties, theorem 2
SET990 ( -0 +1 ^0) Functions and their basic properties, theorem 9
SET991 ( -0 +1 ^0) Functions and their basic properties, theorem 12
SET992 ( -0 +1 ^0) Functions and their basic properties, theorem 14
SET993 ( -0 +1 ^0) Functions and their basic properties, theorem 15
SET994 ( -0 +1 ^0) Functions and their basic properties, theorem 16
SET995 ( -0 +1 ^0) Functions and their basic properties, theorem 17
SET996 ( -0 +1 ^0) Functions and their basic properties, theorem 18
SET997 ( -0 +1 ^0) Functions and their basic properties, theorem 19
SET998 ( -0 +1 ^0) Functions and their basic properties, theorem 20
-------------------------------------------------------------------------------
Domain SEU = Set Theory Continued.
1611 problems (811 abstract, 0 CNF, 906 FOF, 705 THF)
-------------------------------------------------------------------------------
SEU002 ( -0 +1 ^0) Functions and their basic properties, theorem 25
SEU003 ( -0 +1 ^0) Functions and their basic properties, theorem 27
SEU004 ( -0 +1 ^0) Functions and their basic properties, theorem 33
SEU007 ( -0 +1 ^0) Functions and their basic properties, theorem 37
SEU008 ( -0 +1 ^0) Functions and their basic properties, theorem 38
SEU009 ( -0 +1 ^0) Functions and their basic properties, theorem 40
SEU010 ( -0 +1 ^0) Functions and their basic properties, theorem 42
SEU011 ( -0 +1 ^0) Functions and their basic properties, theorem 43
SEU012 ( -0 +1 ^0) Functions and their basic properties, theorem 44
SEU013 ( -0 +1 ^0) Functions and their basic properties, theorem 46
SEU014 ( -0 +1 ^0) Functions and their basic properties, theorem 47
SEU015 ( -0 +1 ^0) Functions and their basic properties, theorem 48
SEU016 ( -0 +1 ^0) Functions and their basic properties, theorem 49
SEU017 ( -0 +1 ^0) Functions and their basic properties, theorem 50
SEU018 ( -0 +1 ^0) Functions and their basic properties, theorem 51
SEU019 ( -0 +1 ^0) Functions and their basic properties, theorem 52
SEU020 ( -0 +1 ^0) Functions and their basic properties, theorem 53
SEU023 ( -0 +1 ^0) Functions and their basic properties, theorem 56
SEU025 ( -0 +1 ^0) Functions and their basic properties, theorem 58
SEU026 ( -0 +1 ^0) Functions and their basic properties, theorem 59
SEU027 ( -0 +1 ^0) Functions and their basic properties, theorem 60
SEU028 ( -0 +1 ^0) Functions and their basic properties, theorem 61
SEU030 ( -0 +1 ^0) Functions and their basic properties, theorem 63
SEU031 ( -0 +1 ^0) Functions and their basic properties, theorem 64
SEU032 ( -0 +1 ^0) Functions and their basic properties, theorem 65
SEU033 ( -0 +1 ^0) Functions and their basic properties, theorem 66
SEU034 ( -0 +1 ^0) Functions and their basic properties, theorem 67
SEU037 ( -0 +1 ^0) Functions and their basic properties, theorem 71
SEU039 ( -0 +1 ^0) Functions and their basic properties, theorem 73
SEU040 ( -0 +1 ^0) Functions and their basic properties, theorem 76
SEU041 ( -0 +1 ^0) Functions and their basic properties, theorem 82
SEU042 ( -0 +1 ^0) Functions and their basic properties, theorem 84
SEU043 ( -0 +1 ^0) Functions and their basic properties, theorem 85
SEU044 ( -0 +1 ^0) Functions and their basic properties, theorem 86
SEU045 ( -0 +1 ^0) Functions and their basic properties, theorem 87
SEU046 ( -0 +1 ^0) Functions and their basic properties, theorem 89
SEU047 ( -0 +1 ^0) Functions and their basic properties, theorem 97
SEU048 ( -0 +1 ^0) Functions and their basic properties, theorem 99
SEU049 ( -0 +1 ^0) Functions and their basic properties, theorem 117
SEU050 ( -0 +1 ^0) Functions and their basic properties, theorem 118
SEU051 ( -0 +1 ^0) Functions and their basic properties, theorem 120
SEU052 ( -0 +1 ^0) Functions and their basic properties, theorem 121
SEU053 ( -0 +1 ^0) Functions and their basic properties, theorem 122
SEU054 ( -0 +1 ^0) Functions and their basic properties, theorem 123
SEU055 ( -0 +1 ^0) Functions and their basic properties, theorem 124
SEU056 ( -0 +1 ^0) Functions and their basic properties, theorem 125
SEU057 ( -0 +1 ^0) Functions and their basic properties, theorem 126
SEU058 ( -0 +1 ^0) Functions and their basic properties, theorem 137
SEU059 ( -0 +1 ^0) Functions and their basic properties, theorem 138
SEU060 ( -0 +1 ^0) Functions and their basic properties, theorem 139
SEU061 ( -0 +1 ^0) Functions and their basic properties, theorem 142
SEU062 ( -0 +1 ^0) Functions and their basic properties, theorem 143
SEU063 ( -0 +1 ^0) Functions and their basic properties, theorem 144
SEU067 ( -0 +1 ^0) Functions and their basic properties, theorem 148
SEU068 ( -0 +1 ^0) Functions and their basic properties, theorem 149
SEU069 ( -0 +1 ^0) Functions and their basic properties, theorem 150
SEU070 ( -0 +1 ^0) Functions and their basic properties, theorem 151
SEU071 ( -0 +1 ^0) Functions and their basic properties, theorem 152
SEU072 ( -0 +1 ^0) Functions and their basic properties, theorem 153
SEU073 ( -0 +1 ^0) Functions and their basic properties, theorem 154
SEU074 ( -0 +1 ^0) Functions and their basic properties, theorem 155
SEU075 ( -0 +1 ^0) Functions and their basic properties, theorem 156
SEU076 ( -0 +1 ^0) Functions and their basic properties, theorem 157
SEU077 ( -0 +1 ^0) Functions and their basic properties, theorem 158
SEU078 ( -0 +1 ^0) Functions and their basic properties, theorem 159
SEU079 ( -0 +1 ^0) Functions and their basic properties, theorem 160
SEU080 ( -0 +1 ^0) Functions and their basic properties, theorem 161
SEU081 ( -0 +1 ^0) Functions and their basic properties, theorem 162
SEU083 ( -0 +1 ^0) Finite sets, theorem 14
SEU085 ( -0 +1 ^0) Finite sets, theorem 16
SEU088 ( -0 +1 ^0) Finite sets, theorem 19
SEU089 ( -0 +1 ^0) Finite sets, theorem 20
SEU090 ( -0 +1 ^0) Finite sets, theorem 21
SEU091 ( -0 +1 ^0) Finite sets, theorem 22
SEU092 ( -0 +1 ^0) Finite sets, theorem 23
SEU093 ( -0 +1 ^0) Finite sets, theorem 24
SEU094 ( -0 +1 ^0) Finite sets, theorem 25
SEU096 ( -0 +1 ^0) Finite sets, theorem 27
SEU097 ( -0 +1 ^0) Finite sets, theorem 28
SEU098 ( -0 +1 ^0) Finite sets, theorem 29
SEU099 ( -0 +1 ^0) Finite sets, theorem 30
SEU100 ( -0 +1 ^0) Finite sets, theorem 31
SEU101 ( -0 +1 ^0) Boolean domains, theorem 10
SEU102 ( -0 +1 ^0) Boolean domains, theorem 13
SEU103 ( -0 +1 ^0) Boolean domains, theorem 14
SEU104 ( -0 +1 ^0) Boolean domains, theorem 15
SEU105 ( -0 +1 ^0) Boolean domains, theorem 16
SEU106 ( -0 +1 ^0) Boolean domains, theorem 17
SEU107 ( -0 +1 ^0) Boolean domains, theorem 18
SEU108 ( -0 +1 ^0) Boolean domains, theorem 20
SEU109 ( -0 +1 ^0) Boolean domains, theorem 21
SEU110 ( -0 +1 ^0) Boolean domains, theorem 23
SEU111 ( -0 +1 ^0) Boolean domains, theorem 24
SEU112 ( -0 +1 ^0) Boolean domains, theorem 25
SEU113 ( -0 +1 ^0) Boolean domains, theorem 26
SEU114 ( -0 +1 ^0) Boolean domains, theorem 27
SEU115 ( -0 +1 ^0) Boolean domains, theorem 28
SEU116 ( -0 +1 ^0) Boolean domains, theorem 30
SEU117 ( -0 +1 ^0) Boolean domains, theorem 32
SEU118 ( -0 +1 ^0) Boolean domains, theorem 34
SEU119 ( -0 +2 ^0) MPTP bushy problem t3_xboole_0
SEU120 ( -0 +2 ^0) MPTP bushy problem t4_xboole_0
SEU121 ( -0 +2 ^0) MPTP bushy problem t1_xboole_1
SEU122 ( -0 +2 ^0) MPTP bushy problem t2_xboole_1
SEU123 ( -0 +2 ^0) MPTP bushy problem t3_xboole_1
SEU124 ( -0 +2 ^0) MPTP bushy problem t7_xboole_1
SEU125 ( -0 +2 ^0) MPTP bushy problem t8_xboole_1
SEU126 ( -0 +2 ^0) MPTP bushy problem t12_xboole_1
SEU127 ( -0 +2 ^0) MPTP bushy problem t17_xboole_1
SEU128 ( -0 +2 ^0) MPTP bushy problem t19_xboole_1
SEU129 ( -0 +2 ^0) MPTP bushy problem t26_xboole_1
SEU130 ( -0 +2 ^0) MPTP bushy problem t28_xboole_1
SEU131 ( -0 +2 ^0) MPTP bushy problem l32_xboole_1
SEU132 ( -0 +2 ^0) MPTP bushy problem t33_xboole_1
SEU133 ( -0 +2 ^0) MPTP bushy problem t36_xboole_1
SEU134 ( -0 +2 ^0) MPTP bushy problem t37_xboole_1
SEU135 ( -0 +2 ^0) MPTP bushy problem t39_xboole_1
SEU136 ( -0 +2 ^0) MPTP bushy problem t40_xboole_1
SEU137 ( -0 +2 ^0) MPTP bushy problem t45_xboole_1
SEU138 ( -0 +2 ^0) MPTP bushy problem t48_xboole_1
SEU139 ( -0 +2 ^0) MPTP bushy problem t60_xboole_1
SEU140 ( -0 +2 ^0) MPTP bushy problem t63_xboole_1
SEU141 ( -0 +2 ^0) MPTP bushy problem t83_xboole_1
SEU142 ( -0 +2 ^0) MPTP bushy problem t69_enumset1
SEU143 ( -0 +2 ^0) MPTP bushy problem l1_zfmisc_1
SEU144 ( -0 +2 ^0) MPTP bushy problem l2_zfmisc_1
SEU145 ( -0 +2 ^0) MPTP bushy problem l3_zfmisc_1
SEU146 ( -0 +2 ^0) MPTP bushy problem l4_zfmisc_1
SEU147 ( -0 +3 ^0) MPTP bushy problem t1_zfmisc_1
SEU148 ( -0 +3 ^0) MPTP bushy problem t6_zfmisc_1
SEU149 ( -0 +3 ^0) MPTP bushy problem t8_zfmisc_1
SEU150 ( -0 +3 ^0) MPTP bushy problem t9_zfmisc_1
SEU151 ( -0 +3 ^0) MPTP bushy problem t10_zfmisc_1
SEU152 ( -0 +2 ^0) MPTP bushy problem l23_zfmisc_1
SEU153 ( -0 +2 ^0) MPTP bushy problem l25_zfmisc_1
SEU154 ( -0 +2 ^0) MPTP bushy problem l28_zfmisc_1
SEU155 ( -0 +2 ^0) MPTP bushy problem l50_zfmisc_1
SEU156 ( -0 +3 ^0) MPTP bushy problem t33_zfmisc_1
SEU157 ( -0 +2 ^0) MPTP bushy problem l55_zfmisc_1
SEU158 ( -0 +3 ^0) MPTP bushy problem t37_zfmisc_1
SEU159 ( -0 +3 ^0) MPTP bushy problem t38_zfmisc_1
SEU160 ( -0 +3 ^0) MPTP bushy problem t39_zfmisc_1
SEU161 ( -0 +3 ^0) MPTP bushy problem t46_zfmisc_1
SEU162 ( -0 +3 ^0) MPTP bushy problem t65_zfmisc_1
SEU163 ( -0 +3 ^0) MPTP bushy problem t92_zfmisc_1
SEU164 ( -0 +3 ^0) MPTP bushy problem t99_zfmisc_1
SEU165 ( -0 +3 ^0) MPTP bushy problem t106_zfmisc_1
SEU166 ( -0 +3 ^0) MPTP bushy problem t118_zfmisc_1
SEU167 ( -0 +3 ^0) MPTP bushy problem t119_zfmisc_1
SEU168 ( -0 +3 ^0) MPTP bushy problem t136_zfmisc_1
SEU169 ( -0 +2 ^0) MPTP bushy problem l3_subset_1
SEU170 ( -0 +2 ^0) MPTP bushy problem t43_subset_1
SEU171 ( -0 +2 ^0) MPTP bushy problem t50_subset_1
SEU172 ( -0 +2 ^0) MPTP bushy problem t54_subset_1
SEU173 ( -0 +2 ^0) MPTP bushy problem l71_subset_1
SEU174 ( -0 +2 ^0) MPTP bushy problem t46_setfam_1
SEU175 ( -0 +2 ^0) MPTP bushy problem t47_setfam_1
SEU176 ( -0 +2 ^0) MPTP bushy problem t48_setfam_1
SEU177 ( -0 +2 ^0) MPTP bushy problem t20_relat_1
SEU178 ( -0 +2 ^0) MPTP bushy problem t21_relat_1
SEU179 ( -0 +2 ^0) MPTP bushy problem t25_relat_1
SEU180 ( -0 +2 ^0) MPTP bushy problem t30_relat_1
SEU181 ( -0 +2 ^0) MPTP bushy problem t37_relat_1
SEU182 ( -0 +2 ^0) MPTP bushy problem t44_relat_1
SEU183 ( -0 +2 ^0) MPTP bushy problem t45_relat_1
SEU184 ( -0 +2 ^0) MPTP bushy problem t46_relat_1
SEU185 ( -0 +2 ^0) MPTP bushy problem t47_relat_1
SEU186 ( -0 +2 ^0) MPTP bushy problem t56_relat_1
SEU187 ( -0 +2 ^0) MPTP bushy problem t60_relat_1
SEU188 ( -0 +2 ^0) MPTP bushy problem t64_relat_1
SEU189 ( -0 +2 ^0) MPTP bushy problem t65_relat_1
SEU190 ( -0 +2 ^0) MPTP bushy problem t71_relat_1
SEU191 ( -0 +2 ^0) MPTP bushy problem t74_relat_1
SEU192 ( -0 +2 ^0) MPTP bushy problem t86_relat_1
SEU193 ( -0 +2 ^0) MPTP bushy problem t88_relat_1
SEU194 ( -0 +2 ^0) MPTP bushy problem t90_relat_1
SEU195 ( -0 +2 ^0) MPTP bushy problem t94_relat_1
SEU196 ( -0 +2 ^0) MPTP bushy problem t99_relat_1
SEU197 ( -0 +2 ^0) MPTP bushy problem t115_relat_1
SEU198 ( -0 +2 ^0) MPTP bushy problem t116_relat_1
SEU199 ( -0 +2 ^0) MPTP bushy problem t117_relat_1
SEU200 ( -0 +2 ^0) MPTP bushy problem t118_relat_1
SEU201 ( -0 +2 ^0) MPTP bushy problem t119_relat_1
SEU202 ( -0 +2 ^0) MPTP bushy problem t140_relat_1
SEU203 ( -0 +2 ^0) MPTP bushy problem t143_relat_1
SEU204 ( -0 +2 ^0) MPTP bushy problem t144_relat_1
SEU205 ( -0 +2 ^0) MPTP bushy problem t145_relat_1
SEU206 ( -0 +2 ^0) MPTP bushy problem t146_relat_1
SEU207 ( -0 +2 ^0) MPTP bushy problem t160_relat_1
SEU208 ( -0 +2 ^0) MPTP bushy problem t166_relat_1
SEU209 ( -0 +2 ^0) MPTP bushy problem t167_relat_1
SEU210 ( -0 +2 ^0) MPTP bushy problem t174_relat_1
SEU211 ( -0 +2 ^0) MPTP bushy problem t178_relat_1
SEU212 ( -0 +3 ^0) MPTP bushy problem t8_funct_1
SEU213 ( -0 +3 ^0) MPTP bushy problem t21_funct_1
SEU214 ( -0 +3 ^0) MPTP bushy problem t22_funct_1
SEU215 ( -0 +3 ^0) MPTP bushy problem t23_funct_1
SEU216 ( -0 +3 ^0) MPTP bushy problem t34_funct_1
SEU217 ( -0 +3 ^0) MPTP bushy problem t35_funct_1
SEU218 ( -0 +3 ^0) MPTP bushy problem t54_funct_1
SEU219 ( -0 +3 ^0) MPTP bushy problem t55_funct_1
SEU220 ( -0 +3 ^0) MPTP bushy problem t57_funct_1
SEU221 ( -0 +3 ^0) MPTP bushy problem t62_funct_1
SEU222 ( -0 +3 ^0) MPTP bushy problem t68_funct_1
SEU223 ( -0 +3 ^0) MPTP bushy problem t70_funct_1
SEU224 ( -0 +2 ^0) MPTP bushy problem l82_funct_1
SEU225 ( -0 +3 ^0) MPTP bushy problem t72_funct_1
SEU226 ( -0 +3 ^0) MPTP bushy problem t145_funct_1
SEU227 ( -0 +3 ^0) MPTP bushy problem t146_funct_1
SEU228 ( -0 +3 ^0) MPTP bushy problem t147_funct_1
SEU229 ( -0 +3 ^0) MPTP bushy problem t3_ordinal1
SEU230 ( -0 +3 ^0) MPTP bushy problem t10_ordinal1
SEU231 ( -0 +3 ^0) MPTP bushy problem t21_ordinal1
SEU232 ( -0 +3 ^0) MPTP bushy problem t23_ordinal1
SEU233 ( -0 +3 ^0) MPTP bushy problem t24_ordinal1
SEU234 ( -0 +3 ^0) MPTP bushy problem t31_ordinal1
SEU235 ( -0 +3 ^0) MPTP bushy problem t32_ordinal1
SEU236 ( -0 +3 ^0) MPTP bushy problem t33_ordinal1
SEU237 ( -0 +3 ^0) MPTP bushy problem t41_ordinal1
SEU238 ( -0 +3 ^0) MPTP bushy problem t42_ordinal1
SEU239 ( -0 +2 ^0) MPTP bushy problem l1_wellord1
SEU240 ( -0 +2 ^0) MPTP bushy problem l2_wellord1
SEU241 ( -0 +2 ^0) MPTP bushy problem l3_wellord1
SEU242 ( -0 +2 ^0) MPTP bushy problem l4_wellord1
SEU243 ( -0 +2 ^0) MPTP bushy problem t5_wellord1
SEU244 ( -0 +2 ^0) MPTP bushy problem t8_wellord1
SEU245 ( -0 +2 ^0) MPTP bushy problem t16_wellord1
SEU246 ( -0 +2 ^0) MPTP bushy problem t17_wellord1
SEU247 ( -0 +2 ^0) MPTP bushy problem t18_wellord1
SEU248 ( -0 +2 ^0) MPTP bushy problem l29_wellord1
SEU249 ( -0 +2 ^0) MPTP bushy problem t19_wellord1
SEU250 ( -0 +2 ^0) MPTP bushy problem t20_wellord1
SEU251 ( -0 +2 ^0) MPTP bushy problem t21_wellord1
SEU252 ( -0 +2 ^0) MPTP bushy problem t22_wellord1
SEU253 ( -0 +2 ^0) MPTP bushy problem t23_wellord1
SEU254 ( -0 +2 ^0) MPTP bushy problem t24_wellord1
SEU255 ( -0 +2 ^0) MPTP bushy problem t25_wellord1
SEU256 ( -0 +2 ^0) MPTP bushy problem t31_wellord1
SEU257 ( -0 +2 ^0) MPTP bushy problem t32_wellord1
SEU258 ( -0 +2 ^0) MPTP bushy problem t39_wellord1
SEU259 ( -0 +2 ^0) MPTP bushy problem t49_wellord1
SEU260 ( -0 +2 ^0) MPTP bushy problem t53_wellord1
SEU261 ( -0 +2 ^0) MPTP bushy problem t54_wellord1
SEU262 ( -0 +2 ^0) MPTP bushy problem t12_relset_1
SEU263 ( -0 +2 ^0) MPTP bushy problem t14_relset_1
SEU264 ( -0 +2 ^0) MPTP bushy problem t16_relset_1
SEU265 ( -0 +2 ^0) MPTP bushy problem t22_relset_1
SEU266 ( -0 +2 ^0) MPTP bushy problem t23_relset_1
SEU267 ( -0 +2 ^0) MPTP bushy problem t7_mcart_1
SEU268 ( -0 +2 ^0) MPTP bushy problem t2_wellord2
SEU269 ( -0 +2 ^0) MPTP bushy problem t3_wellord2
SEU270 ( -0 +2 ^0) MPTP bushy problem t4_wellord2
SEU271 ( -0 +2 ^0) MPTP bushy problem t5_wellord2
SEU272 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e3_38_1__ordinal1
SEU273 ( -0 +2 ^0) MPTP bushy problem s1_ordinal1__e8_6__wellord2
SEU274 ( -0 +2 ^0) MPTP bushy problem t6_wellord2
SEU275 ( -0 +2 ^0) MPTP bushy problem t7_wellord2
SEU276 ( -0 +2 ^0) MPTP bushy problem t25_wellord2
SEU277 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e1_8_1_1__relat_1
SEU278 ( -0 +2 ^0) MPTP bushy problem s1_relat_1__e6_21__wellord2
SEU279 ( -0 +2 ^0) MPTP bushy problem l30_wellord2
SEU280 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e6_22__wellord2
SEU281 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_5_1__funct_1
SEU282 ( -0 +2 ^0) MPTP bushy problem s1_funct_1__e2_11_1__funct_1
SEU283 ( -0 +2 ^0) MPTP bushy problem s2_funct_1__e3_12_1__funct_1
SEU284 ( -0 +2 ^0) MPTP bushy problem s3_funct_1__e16_22__wellord2
SEU285 ( -0 +2 ^0) MPTP bushy problem t26_wellord2
SEU286 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_5_1__funct_1
SEU287 ( -0 +2 ^0) MPTP bushy problem s1_funct_1__e2_11_1__funct_1
SEU288 ( -0 +2 ^0) MPTP bushy problem s2_funct_1__e10_24__wellord2
SEU289 ( -0 +2 ^0) MPTP bushy problem t28_wellord2
SEU290 ( -0 +2 ^0) MPTP bushy problem t6_funct_2
SEU291 ( -0 +2 ^0) MPTP bushy problem t9_funct_2
SEU292 ( -0 +2 ^0) MPTP bushy problem t21_funct_2
SEU293 ( -0 +2 ^0) MPTP bushy problem t46_funct_2
SEU294 ( -0 +3 ^0) MPTP bushy problem t13_finset_1
SEU295 ( -0 +3 ^0) MPTP bushy problem t15_finset_1
SEU296 ( -0 +3 ^0) MPTP bushy problem t17_finset_1
SEU297 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e6_27__finset_1
SEU298 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_27_3_1__finset_1
SEU299 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e1_39_1__ordinal1
SEU300 ( -0 +2 ^0) MPTP bushy problem s2_ordinal1__e2_1_1__ordinal2
SEU301 ( -0 +2 ^0) MPTP bushy problem s1_ordinal2__e18_27__finset_1
SEU302 ( -0 +3 ^0) MPTP bushy problem t18_finset_1
SEU303 ( -0 +3 ^0) MPTP bushy problem t26_finset_1
SEU304 ( -0 +2 ^0) MPTP bushy problem t23_lattices
SEU305 ( -0 +2 ^0) MPTP bushy problem t26_lattices
SEU306 ( -0 +2 ^0) MPTP bushy problem t12_pre_topc
SEU307 ( -0 +2 ^0) MPTP bushy problem t15_pre_topc
SEU308 ( -0 +2 ^0) MPTP bushy problem t17_pre_topc
SEU309 ( -0 +2 ^0) MPTP bushy problem t22_pre_topc
SEU310 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e1_61_1__subset_1
SEU311 ( -0 +2 ^0) MPTP bushy problem s3_subset_1__e2_37_1_1__pre_topc
SEU312 ( -0 +2 ^0) MPTP bushy problem t44_pre_topc
SEU313 ( -0 +2 ^0) MPTP bushy problem t45_pre_topc
SEU314 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e1_61_1__subset_1
SEU315 ( -0 +2 ^0) MPTP bushy problem s3_subset_1__e1_40__pre_topc
SEU316 ( -0 +2 ^0) MPTP bushy problem t46_pre_topc
SEU317 ( -0 +2 ^0) MPTP bushy problem t48_pre_topc
SEU318 ( -0 +2 ^0) MPTP bushy problem t52_pre_topc
SEU319 ( -0 +2 ^0) MPTP bushy problem t29_tops_1
SEU320 ( -0 +2 ^0) MPTP bushy problem t30_tops_1
SEU321 ( -0 +2 ^0) MPTP bushy problem l40_tops_1
SEU322 ( -0 +2 ^0) MPTP bushy problem t44_tops_1
SEU323 ( -0 +2 ^0) MPTP bushy problem t51_tops_1
SEU324 ( -0 +2 ^0) MPTP bushy problem t55_tops_1
SEU325 ( -0 +2 ^0) MPTP bushy problem t5_tops_2
SEU326 ( -0 +2 ^0) MPTP bushy problem t10_tops_2
SEU327 ( -0 +2 ^0) MPTP bushy problem t11_tops_2
SEU328 ( -0 +2 ^0) MPTP bushy problem t12_tops_2
SEU329 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_5_1__funct_1
SEU330 ( -0 +2 ^0) MPTP bushy problem s1_funct_1__e2_11_1__funct_1
SEU331 ( -0 +2 ^0) MPTP bushy problem s2_funct_1__e4_7_1__tops_2
SEU332 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_5_1__funct_1
SEU333 ( -0 +2 ^0) MPTP bushy problem s1_funct_1__e2_11_1__funct_1
SEU334 ( -0 +2 ^0) MPTP bushy problem s2_funct_1__e4_7_2__tops_2
SEU335 ( -0 +2 ^0) MPTP bushy problem t13_tops_2
SEU336 ( -0 +2 ^0) MPTP bushy problem t16_tops_2
SEU337 ( -0 +2 ^0) MPTP bushy problem t17_tops_2
SEU338 ( -0 +2 ^0) MPTP bushy problem t13_compts_1
SEU339 ( -0 +2 ^0) MPTP bushy problem t25_orders_2
SEU340 ( -0 +2 ^0) MPTP bushy problem t26_orders_2
SEU341 ( -0 +2 ^0) MPTP bushy problem t5_connsp_2
SEU342 ( -0 +2 ^0) MPTP bushy problem t32_filter_1
SEU343 ( -0 +2 ^0) MPTP bushy problem t1_lattice3
SEU344 ( -0 +2 ^0) MPTP bushy problem t2_lattice3
SEU345 ( -0 +2 ^0) MPTP bushy problem t3_lattice3
SEU346 ( -0 +2 ^0) MPTP bushy problem t7_lattice3
SEU347 ( -0 +2 ^0) MPTP bushy problem t28_lattice3
SEU348 ( -0 +2 ^0) MPTP bushy problem t29_lattice3
SEU349 ( -0 +2 ^0) MPTP bushy problem t30_lattice3
SEU350 ( -0 +2 ^0) MPTP bushy problem t31_lattice3
SEU351 ( -0 +2 ^0) MPTP bushy problem t34_lattice3
SEU352 ( -0 +2 ^0) MPTP bushy problem t50_lattice3
SEU353 ( -0 +2 ^0) MPTP bushy problem t91_tmap_1
SEU354 ( -0 +2 ^0) MPTP bushy problem t5_tex_2
SEU355 ( -0 +2 ^0) MPTP bushy problem t6_yellow_0
SEU356 ( -0 +2 ^0) MPTP bushy problem t15_yellow_0
SEU357 ( -0 +2 ^0) MPTP bushy problem t16_yellow_0
SEU358 ( -0 +2 ^0) MPTP bushy problem t29_yellow_0
SEU359 ( -0 +2 ^0) MPTP bushy problem t30_yellow_0
SEU360 ( -0 +2 ^0) MPTP bushy problem t42_yellow_0
SEU361 ( -0 +2 ^0) MPTP bushy problem t44_yellow_0
SEU362 ( -0 +2 ^0) MPTP bushy problem t60_yellow_0
SEU363 ( -0 +2 ^0) MPTP bushy problem t61_yellow_0
SEU364 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e2_28_1_1__finset_1
SEU365 ( -0 +2 ^0) MPTP bushy problem s2_finset_1__e11_2_1__waybel_0
SEU366 ( -0 +2 ^0) MPTP bushy problem t1_waybel_0
SEU367 ( -0 +2 ^0) MPTP bushy problem t8_waybel_0
SEU368 ( -0 +2 ^0) MPTP bushy problem t1_yellow_1
SEU369 ( -0 +2 ^0) MPTP bushy problem t2_yellow_1
SEU370 ( -0 +2 ^0) MPTP bushy problem t4_yellow_1
SEU371 ( -0 +2 ^0) MPTP bushy problem t18_yellow_1
SEU372 ( -0 +2 ^0) MPTP bushy problem t6_yellow_6
SEU373 ( -0 +2 ^0) MPTP bushy problem t19_yellow_6
SEU374 ( -0 +2 ^0) MPTP bushy problem t20_yellow_6
SEU375 ( -0 +2 ^0) MPTP bushy problem t21_yellow_6
SEU376 ( -0 +2 ^0) MPTP bushy problem t28_yellow_6
SEU377 ( -0 +2 ^0) MPTP bushy problem t30_yellow_6
SEU378 ( -0 +2 ^0) MPTP bushy problem t31_yellow_6
SEU379 ( -0 +2 ^0) MPTP bushy problem t32_yellow_6
SEU380 ( -0 +2 ^0) MPTP bushy problem t41_yellow_6
SEU381 ( -0 +2 ^0) MPTP bushy problem t11_waybel_7
SEU382 ( -0 +2 ^0) MPTP bushy problem t4_waybel_7
SEU383 ( -0 +2 ^0) MPTP bushy problem t8_waybel_7
SEU384 ( -0 +2 ^0) MPTP bushy problem t12_waybel_9
SEU385 ( -0 +2 ^0) MPTP bushy problem t16_waybel_9
SEU386 ( -0 +2 ^0) MPTP bushy problem t29_waybel_9
SEU387 ( -0 +2 ^0) MPTP bushy problem t2_yellow19
SEU388 ( -0 +2 ^0) MPTP bushy problem t3_yellow19
SEU389 ( -0 +2 ^0) MPTP bushy problem t4_yellow19
SEU390 ( -0 +2 ^0) MPTP bushy problem t9_yellow19
SEU391 ( -0 +2 ^0) MPTP bushy problem t11_yellow19
SEU392 ( -0 +2 ^0) MPTP bushy problem t13_yellow19
SEU393 ( -0 +2 ^0) MPTP bushy problem t14_yellow19
SEU394 ( -0 +2 ^0) MPTP bushy problem t15_yellow19
SEU395 ( -0 +2 ^0) MPTP bushy problem t18_yellow19
SEU396 ( -0 +2 ^0) MPTP bushy problem t20_yellow19
SEU397 ( -0 +2 ^0) MPTP bushy problem t23_yellow19
SEU398 ( -0 +2 ^0) MPTP bushy problem t31_yellow19
SEU399 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e2_25_1_2__wellord2
SEU400 ( -0 +2 ^0) MPTP bushy problem s1_xboole_0__e4_5_1__funct_1
SEU401 ( -0 +2 ^0) MPTP bushy problem s2_xboole_0__e10_25_1_1__wellord2
SEU402 ( -0 +2 ^0) MPTP bushy problem s1_funct_1__e2_11_1__funct_1
SEU403 ( -0 +2 ^0) MPTP bushy problem s2_funct_1__e3_25_1__wellord2
SEU404 ( -0 +2 ^0) MPTP bushy problem s1_wellord2__e6_39_3__yellow19
SEU405 ( -0 +2 ^0) MPTP bushy problem l37_yellow19
SEU406 ( -0 +4 ^0) The Operation of Addition of Relational Structures T01
SEU407 ( -0 +4 ^0) The Operation of Addition of Relational Structures T07
SEU408 ( -0 +4 ^0) The Operation of Addition of Relational Structures T11
SEU409 ( -0 +4 ^0) The Operation of Addition of Relational Structures T14
SEU410 ( -0 +4 ^0) The Operation of Addition of Relational Structures T19
SEU411 ( -0 +4 ^0) The Operation of Addition of Relational Structures T20
SEU412 ( -0 +4 ^0) The Operation of Addition of Relational Structures T22
SEU413 ( -0 +4 ^0) The Operation of Addition of Relational Structures T23
SEU414 ( -0 +4 ^0) The Operation of Addition of Relational Structures T24
SEU415 ( -0 +4 ^0) The Operation of Addition of Relational Structures T25
SEU416 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T05
SEU417 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T07
SEU418 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T08
SEU419 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T12
SEU420 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T13
SEU421 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T14
SEU422 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T16
SEU423 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T17
SEU424 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T18
SEU425 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T21
SEU426 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T22
SEU427 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T26
SEU428 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T27
SEU429 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T28
SEU430 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T30
SEU431 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T31
SEU432 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T33
SEU433 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T34
SEU434 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T35
SEU435 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T36
SEU436 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T39
SEU437 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T40
SEU438 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T41
SEU439 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T43
SEU440 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T52
SEU441 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T53
SEU442 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T54
SEU443 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T55
SEU444 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T56
SEU445 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T57
SEU446 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T58
SEU447 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T59
SEU448 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T62
SEU449 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T63
SEU450 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T64
SEU451 ( -0 +4 ^0) First and Second Order Cutting of Binary Relations T65
SEU452 ( -0 +0 ^1) Hofman's Marktoberdorf exercise
SEU453 ( -0 +0 ^1) The reflexive closure of a binary relation is reflexive
SEU454 ( -0 +0 ^1) The reflexive closure operator is idempotent
SEU455 ( -0 +0 ^1) The reflexive closure operator is inflationary
SEU456 ( -0 +0 ^1) The reflexive closure operator is monotonic
SEU457 ( -0 +0 ^1) The symmetric closure of a binary relation is symmetric
SEU458 ( -0 +0 ^1) The symmetric closure operator is idempotent
SEU459 ( -0 +0 ^1) The symmetric closure operator is inflationary
SEU460 ( -0 +0 ^1) The symmetric closure operator is monotonic
SEU461 ( -0 +0 ^1) The transitive closure of a binary relation is transitive, part 1
SEU462 ( -0 +0 ^1) The transitive closure of a binary relation is transitive, part 2
SEU463 ( -0 +0 ^1) The transitive closure of a binary relation is transitive, part 3
SEU464 ( -0 +0 ^1) The transitive closure of a binary relation is transitive, part 4
SEU465 ( -0 +0 ^1) The transitive closure of a binary relation is transitive, part 5
SEU466 ( -0 +0 ^1) The transitive closure operator is idempotent
SEU467 ( -0 +0 ^1) The transitive closure operator is inflationary
SEU468 ( -0 +0 ^1) The transitive closure operator is monotonic
SEU469 ( -0 +0 ^1) Transitive reflexive closure is transitive and reflexive
SEU470 ( -0 +0 ^1) Transitive reflexive symmetric closure properties
SEU471 ( -0 +0 ^1) The transitive reflexive symmetric closure operator is idempotent
SEU472 ( -0 +0 ^1) The transitive reflexive symmetric closure operator is inflationary
SEU473 ( -0 +0 ^1) The transitive reflexive symmetric closure operator is monotonic
SEU474 ( -0 +0 ^1) Swapping symmetric closure and reflexive closure
SEU475 ( -0 +0 ^1) Not swapping symmetric closure and transitive closure
SEU476 ( -0 +0 ^1) Swaping transitive closure and reflexive closure
SEU477 ( -0 +0 ^1) Another definition of terminating
SEU478 ( -0 +0 ^1) A terminating relation is normalizing
SEU479 ( -0 +0 ^1) If a relation is terminating, then so is its transitive closure
SEU480 ( -0 +0 ^1) Termination implies the induction principle
SEU481 ( -0 +0 ^1) Satisfying the induction principle implies termination
SEU482 ( -0 +0 ^1) A normalizing relation is not necessarily terminating
SEU483 ( -0 +0 ^1) A symmetric relation is non-terminating
SEU484 ( -0 +0 ^1) A reflexive relation is non-terminating
SEU485 ( -0 +0 ^1) In a confluent relation every element has at most one normal form
SEU486 ( -0 +0 ^1) Confluence implies local confluence
SEU487 ( -0 +0 ^1) Local confluence does NOT imply confluence
SEU488 ( -0 +0 ^1) Confluence implies semi confluence
SEU489 ( -0 +0 ^1) Church-Rosser property implies confluence
SEU490 ( -0 +0 ^1) Semi confluence implies Church-Rosser property
SEU491 ( -0 +0 ^1) Terminating relations and confluence and local confluence
SEU492 ( -0 +0 ^1) Alternative definition of a strict (partial) order: requiring
SEU493 ( -0 +0 ^1) The inverse of a partial order is again a partial order
SEU494 ( -0 +0 ^1) Inverse of a strict (partial) order is a strict (partial) order
SEU495 ( -0 +0 ^1) The inverse of a total relation is again a total relation
SEU496 ( -0 +0 ^1) Transitive closure and strict (partial) orders
SEU497 ( -0 +0 ^1) Every strict (partial) order induces a partial order
SEU498 ( -0 +0 ^1) Every partial order induces a strict (partial) order
SEU499 ( -0 +0 ^2) Foundation - Axioms - Logical Axioms
SEU500 ( -0 +0 ^2) Preliminary Notions - Propositions as Sets
SEU501 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU502 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU503 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU504 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU505 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU506 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU507 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU508 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU509 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU510 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU511 ( -0 +0 ^2) Preliminary Notions - Basic Laws of Logic
SEU512 ( -0 +0 ^2) Preliminary Notions - Adjoining Elements to Sets
SEU513 ( -0 +0 ^2) Preliminary Notions - Adjoining Elements to Sets
SEU514 ( -0 +0 ^2) Preliminary Notions - Adjoining Elements to Sets
SEU515 ( -0 +0 ^2) Preliminary Notions - Adjoining Elements to Sets
SEU516 ( -0 +0 ^2) Preliminary Notions - Adjoining Elements to Sets
SEU517 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU518 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU519 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU520 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU521 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU522 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU523 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU524 ( -0 +0 ^2) Preliminary Notions - Power Sets and Unions
SEU525 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU526 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU527 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU528 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU529 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU530 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU531 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU532 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU533 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU534 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU535 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU536 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU537 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU538 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU539 ( -0 +0 ^2) Preliminary Notions - Bounded Quantifier Laws
SEU540 ( -0 +0 ^2) Preliminary Notions - Dependent Connective Laws
SEU541 ( -0 +0 ^2) Preliminary Notions - Dependent Connective Laws
SEU542 ( -0 +0 ^2) Preliminary Notions - Negated Quantifiers
SEU543 ( -0 +0 ^2) Preliminary Notions - Negated Quantifiers
SEU544 ( -0 +0 ^2) Preliminary Notions - Equivalence Laws
SEU545 ( -0 +0 ^2) Preliminary Notions - Equivalence Laws
SEU546 ( -0 +0 ^2) Preliminary Notions - Equivalence Laws
SEU547 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU548 ( -0 +0 ^2) A simple congruence property of in
SEU549 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU550 ( -0 +0 ^2) A simple congruence property of exu
SEU551 ( -0 +0 ^2) A simple congruence property of emptyset
SEU552 ( -0 +0 ^2) A simple congruence property of setadjoin
SEU553 ( -0 +0 ^2) A simple congruence property of powerset
SEU554 ( -0 +0 ^2) A simple congruence property of setunion
SEU555 ( -0 +0 ^2) A simple congruence property of omega
SEU556 ( -0 +0 ^2) Preliminary Notions - Equality Laws
SEU557 ( -0 +0 ^2) A simple congruence property of descr
SEU558 ( -0 +0 ^2) A simple congruence property of dsetconstr
SEU559 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU560 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU561 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU562 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU563 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU564 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU565 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU566 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU567 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU568 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU569 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU570 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU571 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU572 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU573 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU574 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU575 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU576 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU577 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU578 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU579 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU580 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU581 ( -0 +0 ^2) Preliminary Notions - Relations on Sets - Subsets
SEU582 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU583 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU584 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU585 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU586 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU587 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU588 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU589 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU590 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU591 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU592 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU593 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU594 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU595 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU596 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU597 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU598 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU599 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU600 ( -0 +0 ^2) Preliminary Notions - Ops on Sets - Unions and Intersections
SEU601 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU602 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU603 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU604 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU605 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU606 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU607 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU608 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU609 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU610 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Set Difference
SEU611 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Symmetric Difference
SEU612 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Symmetric Difference
SEU613 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Symmetric Difference
SEU614 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Symmetric Difference
SEU615 ( -0 +0 ^2) Preliminary Notions - Operations on Sets - Symmetric Difference
SEU616 ( -0 +0 ^2) Ordered Pairs - Kuratowski Pairs
SEU617 ( -0 +0 ^2) Ordered Pairs - Kuratowski Pairs
SEU618 ( -0 +0 ^2) Ordered Pairs - Kuratowski Pairs
SEU619 ( -0 +0 ^2) Ordered Pairs - Kuratowski Pairs
SEU620 ( -0 +0 ^2) Ordered Pairs - Kuratowski Pairs
SEU621 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU622 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU623 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU624 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU625 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU626 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU627 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU628 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU629 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU630 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU631 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU632 ( -0 +0 ^2) Ordered Pairs - Cartesian Products
SEU633 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU634 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU635 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU636 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU637 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU638 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU639 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU640 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU641 ( -0 +0 ^2) Ordered Pairs - Singletons
SEU642 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU643 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU644 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU645 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU646 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU647 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU648 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU649 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU650 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU651 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU652 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU653 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU654 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU655 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU656 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU657 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU658 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU659 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU660 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU661 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU662 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU663 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU664 ( -0 +0 ^2) Ordered Pairs - Properties of Pairs
SEU665 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU666 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU667 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU668 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU669 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU670 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU671 ( -0 +0 ^2) Ordered Pairs - Sets of Pairs
SEU672 ( -0 +0 ^2) Functions
SEU673 ( -0 +0 ^2) Functions - Application
SEU674 ( -0 +0 ^2) Functions - Application
SEU675 ( -0 +0 ^2) Functions - Application
SEU676 ( -0 +0 ^2) Functions - Application
SEU677 ( -0 +0 ^2) Functions - Lambda Abstraction
SEU678 ( -0 +0 ^2) Functions - Lambda Abstraction
SEU679 ( -0 +0 ^2) Functions - Lambda Abstraction
SEU680 ( -0 +0 ^2) Functions - Lambda Abstraction
SEU681 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU682 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU683 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU684 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU685 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU686 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU687 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU688 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU689 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU690 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU691 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU692 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU693 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU694 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU695 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU696 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU697 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU698 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU699 ( -0 +0 ^2) Functions - Extensionality and Beta Reduction
SEU700 ( -0 +0 ^2) Conditionals
SEU701 ( -0 +0 ^2) Conditionals
SEU702 ( -0 +0 ^2) Conditionals
SEU703 ( -0 +0 ^2) Conditionals
SEU704 ( -0 +0 ^2) Conditionals
SEU705 ( -0 +0 ^2) Conditionals
SEU706 ( -0 +0 ^2) Conditionals
SEU707 ( -0 +0 ^2) Conditionals
SEU708 ( -0 +0 ^2) Conditionals
SEU709 ( -0 +0 ^2) Conditionals
SEU710 ( -0 +0 ^2) Typed Set Theory - Types of Set Operators
SEU711 ( -0 +0 ^2) Typed Set Theory - Types of Set Operators
SEU712 ( -0 +0 ^2) Typed Set Theory - Types of Set Operators
SEU713 ( -0 +0 ^2) Typed Set Theory - Types of Set Operators
SEU714 ( -0 +0 ^2) Typed Set Theory - Types of Set Operators
SEU715 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU716 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU717 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU718 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU719 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU720 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU721 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU722 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU723 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU724 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU725 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU726 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU727 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU728 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU729 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU730 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU731 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU732 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU733 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU734 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU735 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU736 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU737 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU738 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU739 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU740 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU741 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU742 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU743 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU744 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU745 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU746 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU747 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets
SEU748 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU749 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU750 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU751 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU752 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU753 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU754 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU755 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU756 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU757 ( -0 +0 ^2) Typed Set Theory - Laws for Typed Sets - DeMorgan Laws
SEU758 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Lemmas
SEU759 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Lemmas
SEU760 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Lemmas
SEU761 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Lemmas
SEU762 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Lemmas
SEU763 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Problems
SEU764 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Problems
SEU765 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Problems
SEU766 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Problems
SEU767 ( -0 +0 ^2) Typed Set Theory - First Wizard of Oz Examples - WoZ1 Problems
SEU768 ( -0 +0 ^2) Binary Relations on a Set
SEU769 ( -0 +0 ^2) Binary Relations on a Set
SEU770 ( -0 +0 ^2) Binary Relations on a Set
SEU771 ( -0 +0 ^2) Binary Relations on a Set
SEU772 ( -0 +0 ^2) Binary Relations on a Set
SEU773 ( -0 +0 ^2) Binary Relations on a Set
SEU774 ( -0 +0 ^2) Binary Relations on a Set
SEU775 ( -0 +0 ^2) Binary Relations on a Set
SEU776 ( -0 +0 ^2) Binary Relations on a Set
SEU777 ( -0 +0 ^2) Binary Relations on a Set
SEU778 ( -0 +0 ^2) Binary Relations on a Set
SEU779 ( -0 +0 ^2) Binary Relations on a Set
SEU780 ( -0 +0 ^2) Binary Relations on a Set
SEU781 ( -0 +0 ^2) Binary Relations on a Set
SEU782 ( -0 +0 ^2) Binary Relations on a Set
SEU783 ( -0 +0 ^2) Binary Relations on a Set
SEU784 ( -0 +0 ^2) Binary Relations on a Set
SEU785 ( -0 +0 ^2) Binary Relations on a Set
SEU786 ( -0 +0 ^2) Binary Relations on a Set
SEU787 ( -0 +0 ^2) Binary Relations on a Set
SEU788 ( -0 +0 ^2) Binary Relations on a Set
SEU789 ( -0 +0 ^2) Binary Relations on a Set - Second Wizard of Oz Examples
SEU790 ( -0 +0 ^2) Binary Relations on a Set - Second Wizard of Oz Examples
SEU791 ( -0 +0 ^2) Binary Relations on a Set - Second Wizard of Oz Examples
SEU792 ( -0 +0 ^2) Binary Relations on a Set - Second Wizard of Oz Examples
SEU793 ( -0 +0 ^2) More about Functions - Images of Functions
SEU794 ( -0 +0 ^2) More about Functions - Images of Functions
SEU795 ( -0 +0 ^2) More about Functions - Images of Functions
SEU796 ( -0 +0 ^2) More about Functions - Images of Functions
SEU797 ( -0 +0 ^2) More about Functions - Images of Functions
SEU798 ( -0 +0 ^2) More about Functions - Injective Functions
SEU799 ( -0 +0 ^2) More about Functions - Injective Functions
SEU800 ( -0 +0 ^2) More about Functions - Injective Functions
SEU801 ( -0 +0 ^2) More about Functions - Surjective Functions
SEU802 ( -0 +0 ^2) More about Functions - Surjective Functions
SEU803 ( -0 +0 ^2) More about Functions - Surjective Functions
SEU804 ( -0 +0 ^2) More Functions - Surjective Functions - Surjective Cantor Theorem
SEU805 ( -0 +0 ^2) The Foundation Axiom
SEU806 ( -0 +0 ^2) The Foundation Axiom
SEU807 ( -0 +0 ^2) The Foundation Axiom
SEU808 ( -0 +0 ^2) Omega and Peano
SEU809 ( -0 +0 ^2) Omega and Peano
SEU810 ( -0 +0 ^2) Omega and Peano
SEU811 ( -0 +0 ^2) Omega and Peano
SEU812 ( -0 +0 ^2) Transitive Sets
SEU813 ( -0 +0 ^2) Transitive Sets
SEU814 ( -0 +0 ^2) Transitive Sets
SEU815 ( -0 +0 ^2) Transitive Sets
SEU816 ( -0 +0 ^2) Ordinals
SEU817 ( -0 +0 ^2) Ordinals
SEU818 ( -0 +0 ^2) Ordinals
SEU819 ( -0 +0 ^2) Ordinals
SEU820 ( -0 +0 ^2) Ordinals
SEU821 ( -0 +0 ^2) Ordinals
SEU822 ( -0 +0 ^2) Ordinals
SEU823 ( -0 +0 ^2) Ordinals
SEU824 ( -0 +0 ^3) Ordinals
SEU825 ( -0 +0 ^1) setextAx and powersetAx and notinemptyset are consistent
SEU826 ( -0 +0 ^1) About sets 1
SEU827 ( -0 +0 ^1) About sets 2
SEU828 ( -0 +0 ^1) About powersets 1
SEU829 ( -0 +0 ^1) About powersets 2
-------------------------------------------------------------------------------
Domain SWC = Software Creation.
846 problems (423 abstract, 423 CNF, 423 FOF, 0 THF)
-------------------------------------------------------------------------------
SWC001 ( -1 +1 ^0) cond_as_set_x_as_set
SWC002 ( -1 +1 ^0) cond_del_max_x_del_max
SWC003 ( -1 +1 ^0) cond_filter_ne_segment_x_del_max
SWC004 ( -1 +1 ^0) cond_filter_ne_segment_x_filter_some
SWC005 ( -1 +1 ^0) cond_filter_ne_segment_x_tail1
SWC006 ( -1 +1 ^0) cond_filter_segment_x_filter_segment
SWC007 ( -1 +1 ^0) cond_filter_segment_x_initialize
SWC008 ( -1 +1 ^0) cond_filter_segment_x_run_eq_front1
SWC009 ( -1 +1 ^0) cond_filter_segment_x_run_strict_ord_front2
SWC010 ( -1 +1 ^0) cond_filter_some_x_del_max
SWC011 ( -1 +1 ^0) cond_filter_some_x_filter_some
SWC012 ( -1 +1 ^0) cond_filter_some_x_lead
SWC013 ( -1 +1 ^0) cond_head1_x_head1
SWC014 ( -1 +1 ^0) cond_head2_x_head3
SWC015 ( -1 +1 ^0) cond_head3_x_head2
SWC016 ( -1 +1 ^0) cond_id_front_total1_x_id_front_total1
SWC017 ( -1 +1 ^0) cond_id_front_total1_x_ne_segment_front_total2
SWC018 ( -1 +1 ^0) cond_id_front_total1_x_run_eq_front2
SWC019 ( -1 +1 ^0) cond_id_front_total2_x_copy
SWC020 ( -1 +1 ^0) cond_id_front_total2_x_ne_segment_front_total2
SWC021 ( -1 +1 ^0) cond_id_front_total2_x_run_strict_ord_front1
SWC022 ( -1 +1 ^0) cond_id_front_x_head1
SWC023 ( -1 +1 ^0) cond_id_front_x_id_front_total2
SWC024 ( -1 +1 ^0) cond_id_front_x_run_eq_front2
SWC025 ( -1 +1 ^0) cond_id_nil_iff_x_as_set
SWC026 ( -1 +1 ^0) cond_id_nil_iff_x_id_nil_iff
SWC027 ( -1 +1 ^0) cond_id_nil_iff_x_maximal
SWC028 ( -1 +1 ^0) cond_id_nil_iff_x_ne_segment_rear_total2
SWC029 ( -1 +1 ^0) cond_id_nil_iff_x_rot_l_total2
SWC030 ( -1 +1 ^0) cond_id_nil_iff_x_rotate
SWC031 ( -1 +1 ^0) cond_id_nil_iff_x_run_ord_front1
SWC032 ( -1 +1 ^0) cond_id_nil_iff_x_run_strict_ord_front2
SWC033 ( -1 +1 ^0) cond_id_nil_iff_x_set_min_elems
SWC034 ( -1 +1 ^0) cond_id_nil_iff_x_set_unique_elems
SWC035 ( -1 +1 ^0) cond_id_nil_x_copy
SWC036 ( -1 +1 ^0) cond_id_nil_x_id_nil
SWC037 ( -1 +1 ^0) cond_id_nil_x_id_segment_total2
SWC038 ( -1 +1 ^0) cond_id_nil_x_ne_segment_front_total2
SWC039 ( -1 +1 ^0) cond_id_nil_x_pivot
SWC040 ( -1 +1 ^0) cond_id_nil_x_rot_r_total2
SWC041 ( -1 +1 ^0) cond_id_nil_x_run_eq_front2
SWC042 ( -1 +1 ^0) cond_id_nil_x_run_ord_front2
SWC043 ( -1 +1 ^0) cond_id_nil_x_run_strict_ord_front2
SWC044 ( -1 +1 ^0) cond_id_nil_x_segment_rear
SWC045 ( -1 +1 ^0) cond_id_nil_x_set_duplicate_elems
SWC046 ( -1 +1 ^0) cond_id_nil_x_set_unique_elems
SWC047 ( -1 +1 ^0) cond_id_rear_total1_x_copy
SWC048 ( -1 +1 ^0) cond_id_rear_total1_x_ne_segment_rear_total2
SWC049 ( -1 +1 ^0) cond_id_rear_total2_x_ne_segment_rear_total1
SWC050 ( -1 +1 ^0) cond_id_rear_x_id_rear
SWC051 ( -1 +1 ^0) cond_id_rear_x_ne_segment_rear_total1
SWC052 ( -1 +1 ^0) cond_id_segment_total1_x_id_front_total1
SWC053 ( -1 +1 ^0) cond_id_segment_total1_x_id_front_total2
SWC054 ( -1 +1 ^0) cond_id_segment_total1_x_id_segment_total1
SWC055 ( -1 +1 ^0) cond_id_segment_total1_x_maximal
SWC056 ( -1 +1 ^0) cond_id_segment_total1_x_minimal
SWC057 ( -1 +1 ^0) cond_id_segment_total1_x_ne_segment_front_total2
SWC058 ( -1 +1 ^0) cond_id_segment_total1_x_ne_segment_rear_total2
SWC059 ( -1 +1 ^0) cond_id_segment_total1_x_ne_segment_total1
SWC060 ( -1 +1 ^0) cond_id_segment_total1_x_ne_segment_total2
SWC061 ( -1 +1 ^0) cond_id_segment_total1_x_rot_l_total2
SWC062 ( -1 +1 ^0) cond_id_segment_total1_x_rot_l_total3
SWC063 ( -1 +1 ^0) cond_id_segment_total1_x_rot_r_total2
SWC064 ( -1 +1 ^0) cond_id_segment_total1_x_rot_r_total3
SWC065 ( -1 +1 ^0) cond_id_segment_total1_x_run_eq_front2
SWC066 ( -1 +1 ^0) cond_id_segment_total1_x_run_ord_max1
SWC067 ( -1 +1 ^0) cond_id_segment_total1_x_run_strict_ord_max2
SWC068 ( -1 +1 ^0) cond_id_segment_total2_x_double
SWC069 ( -1 +1 ^0) cond_id_segment_total2_x_id_segment_total1
SWC070 ( -1 +1 ^0) cond_id_segment_total2_x_ne_segment_front_total2
SWC071 ( -1 +1 ^0) cond_id_segment_total2_x_pivot
SWC072 ( -1 +1 ^0) cond_id_segment_total2_x_rot_l_total1
SWC073 ( -1 +1 ^0) cond_id_segment_total2_x_rot_r_total1
SWC074 ( -1 +1 ^0) cond_id_segment_total2_x_rot_r_total3
SWC075 ( -1 +1 ^0) cond_id_segment_total2_x_rotate
SWC076 ( -1 +1 ^0) cond_id_segment_total2_x_run_eq_max2
SWC077 ( -1 +1 ^0) cond_id_segment_total2_x_run_strict_ord_front1
SWC078 ( -1 +1 ^0) cond_id_segment_total2_x_some_total2
SWC079 ( -1 +1 ^0) cond_id_segment_x_head1
SWC080 ( -1 +1 ^0) cond_id_segment_x_id_front
SWC081 ( -1 +1 ^0) cond_id_segment_x_id_front_total2
SWC082 ( -1 +1 ^0) cond_id_segment_x_id_segment_total1
SWC083 ( -1 +1 ^0) cond_id_segment_x_insert
SWC084 ( -1 +1 ^0) cond_id_segment_x_maximal
SWC085 ( -1 +1 ^0) cond_id_segment_x_ne_segment_front_total2
SWC086 ( -1 +1 ^0) cond_id_segment_x_ne_segment_total2
SWC087 ( -1 +1 ^0) cond_id_segment_x_rot_l1
SWC088 ( -1 +1 ^0) cond_id_segment_x_rot_l_total3
SWC089 ( -1 +1 ^0) cond_id_segment_x_rot_r_total1
SWC090 ( -1 +1 ^0) cond_id_segment_x_rotate
SWC091 ( -1 +1 ^0) cond_id_segment_x_run_ord_front1
SWC092 ( -1 +1 ^0) cond_id_segment_x_run_strict_ord_front2
SWC093 ( -1 +1 ^0) cond_id_segment_x_some_total1
SWC094 ( -1 +1 ^0) cond_insert_x_copy
SWC095 ( -1 +1 ^0) cond_insert_x_insert
SWC096 ( -1 +1 ^0) cond_last_x_last
SWC097 ( -1 +1 ^0) cond_lead_x_lead
SWC098 ( -1 +1 ^0) cond_maximal_x_maximal
SWC099 ( -1 +1 ^0) cond_ne_segment_front_total1_x_run_eq_front1
SWC100 ( -1 +1 ^0) cond_ne_segment_front_total1_x_run_strict_ord_front2
SWC101 ( -1 +1 ^0) cond_ne_segment_front_total2_x_run_eq_front2
SWC102 ( -1 +1 ^0) cond_ne_segment_front_x_copy
SWC103 ( -1 +1 ^0) cond_ne_segment_front_x_ne_segment_front_total1
SWC104 ( -1 +1 ^0) cond_ne_segment_front_x_run_ord_front2
SWC105 ( -1 +1 ^0) cond_ne_segment_rear_total1_x_ne_segment_rear_total2
SWC106 ( -1 +1 ^0) cond_ne_segment_rear_x_last
SWC107 ( -1 +1 ^0) cond_ne_segment_total1_x_maximal
SWC108 ( -1 +1 ^0) cond_ne_segment_total1_x_ne_segment_rear_total2
SWC109 ( -1 +1 ^0) cond_ne_segment_total1_x_pivot
SWC110 ( -1 +1 ^0) cond_ne_segment_total1_x_run_eq_front2
SWC111 ( -1 +1 ^0) cond_ne_segment_total1_x_run_ord_max1
SWC112 ( -1 +1 ^0) cond_ne_segment_total1_x_run_strict_ord_max2
SWC113 ( -1 +1 ^0) cond_ne_segment_total1_x_some_total2
SWC114 ( -1 +1 ^0) cond_ne_segment_total2_x_maximal
SWC115 ( -1 +1 ^0) cond_ne_segment_total2_x_minimal
SWC116 ( -1 +1 ^0) cond_ne_segment_total2_x_ne_segment_total1
SWC117 ( -1 +1 ^0) cond_ne_segment_total2_x_run_eq_max1
SWC118 ( -1 +1 ^0) cond_ne_segment_total2_x_run_ord_max2
SWC119 ( -1 +1 ^0) cond_ne_segment_total2_x_some_total1
SWC120 ( -1 +1 ^0) cond_ne_segment_x_head2
SWC121 ( -1 +1 ^0) cond_ne_segment_x_ne_segment
SWC122 ( -1 +1 ^0) cond_ne_segment_x_ne_segment_rear_total1
SWC123 ( -1 +1 ^0) cond_ne_segment_x_run_eq_front1
SWC124 ( -1 +1 ^0) cond_ne_segment_x_run_ord_front2
SWC125 ( -1 +1 ^0) cond_ne_segment_x_run_strict_ord_max1
SWC126 ( -1 +1 ^0) cond_ne_segment_x_some1
SWC127 ( -1 +1 ^0) cond_ne_segment_x_some_total3
SWC128 ( -1 +1 ^0) cond_pr_works_always_x_filter_segment
SWC129 ( -1 +1 ^0) cond_pr_works_on_cycles_x_dup_tos
SWC130 ( -1 +1 ^0) cond_pr_works_on_cycles_x_head1
SWC131 ( -1 +1 ^0) cond_pr_works_on_cycles_x_ne_segment_rear
SWC132 ( -1 +1 ^0) cond_pr_works_on_cycles_x_rot_l2
SWC133 ( -1 +1 ^0) cond_pr_works_on_cycles_x_rot_r2
SWC134 ( -1 +1 ^0) cond_pr_works_on_cycles_x_segment_rear_ne
SWC135 ( -1 +1 ^0) cond_pr_works_on_cycles_x_tail2
SWC136 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_del_max
SWC137 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_greatest
SWC138 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_id_front
SWC139 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_id_rear
SWC140 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_lead
SWC141 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_rot_l1
SWC142 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_rot_r1
SWC143 ( -1 +1 ^0) cond_pr_works_on_nonempty_x_tail1
SWC144 ( -1 +1 ^0) cond_pr_works_on_pairs_x_filter_ne_segment
SWC145 ( -1 +1 ^0) cond_pr_works_on_pairs_x_head2
SWC146 ( -1 +1 ^0) cond_pr_works_on_pairs_x_id_segment
SWC147 ( -1 +1 ^0) cond_pr_works_on_pairs_x_ne_segment
SWC148 ( -1 +1 ^0) cond_pr_works_on_pairs_x_smallest
SWC149 ( -1 +1 ^0) cond_pr_works_on_pairs_x_swap_ends
SWC150 ( -1 +1 ^0) cond_pr_works_on_pairs_x_tail1
SWC151 ( -1 +1 ^0) cond_pr_works_on_total_ord_x_pr_works_on_total_ord
SWC152 ( -1 +1 ^0) cond_pst_cyc_sorted_x_maximal
SWC153 ( -1 +1 ^0) cond_pst_cyc_sorted_x_pst_cyc_sorted
SWC154 ( -1 +1 ^0) cond_pst_cyc_sorted_x_pst_equal1
SWC155 ( -1 +1 ^0) cond_pst_cyc_sorted_x_pst_sorted2
SWC156 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_eq_front1
SWC157 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_eq_max2
SWC158 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_ord_front2
SWC159 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_ord_max2
SWC160 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_strict_ord_front2
SWC161 ( -1 +1 ^0) cond_pst_cyc_sorted_x_run_strict_ord_max2
SWC162 ( -1 +1 ^0) cond_pst_cyc_sorted_x_some_total3
SWC163 ( -1 +1 ^0) cond_pst_diff_adj1_x_maximal
SWC164 ( -1 +1 ^0) cond_pst_diff_adj1_x_minimal
SWC165 ( -1 +1 ^0) cond_pst_diff_adj1_x_pivot
SWC166 ( -1 +1 ^0) cond_pst_diff_adj1_x_pst_singleton
SWC167 ( -1 +1 ^0) cond_pst_diff_adj1_x_run_strict_ord_front2
SWC168 ( -1 +1 ^0) cond_pst_diff_adj1_x_run_strict_ord_max2
SWC169 ( -1 +1 ^0) cond_pst_diff_adj1_x_some_total2
SWC170 ( -1 +1 ^0) cond_pst_diff_adj1_x_some_total3
SWC171 ( -1 +1 ^0) cond_pst_diff_adj2_x_maximal
SWC172 ( -1 +1 ^0) cond_pst_diff_adj2_x_minimal
SWC173 ( -1 +1 ^0) cond_pst_diff_adj2_x_pivot
SWC174 ( -1 +1 ^0) cond_pst_diff_adj2_x_pst_singleton
SWC175 ( -1 +1 ^0) cond_pst_diff_adj2_x_run_strict_ord_front2
SWC176 ( -1 +1 ^0) cond_pst_diff_adj2_x_run_strict_ord_max2
SWC177 ( -1 +1 ^0) cond_pst_diff_adj2_x_some_total2
SWC178 ( -1 +1 ^0) cond_pst_diff_adj2_x_some_total3
SWC179 ( -1 +1 ^0) cond_pst_different2_x_pivot
SWC180 ( -1 +1 ^0) cond_pst_different2_x_pst_strict_sorted2
SWC181 ( -1 +1 ^0) cond_pst_different2_x_run_strict_ord_max2
SWC182 ( -1 +1 ^0) cond_pst_different3_x_initialize
SWC183 ( -1 +1 ^0) cond_pst_different3_x_maximal
SWC184 ( -1 +1 ^0) cond_pst_different3_x_minimal
SWC185 ( -1 +1 ^0) cond_pst_different3_x_pst_different3
SWC186 ( -1 +1 ^0) cond_pst_different3_x_run_strict_ord_front1
SWC187 ( -1 +1 ^0) cond_pst_different3_x_some_total2
SWC188 ( -1 +1 ^0) cond_pst_equal1_x_minimal
SWC189 ( -1 +1 ^0) cond_pst_equal1_x_pst_equal1
SWC190 ( -1 +1 ^0) cond_pst_equal1_x_pst_equal3
SWC191 ( -1 +1 ^0) cond_pst_equal1_x_run_eq_front1
SWC192 ( -1 +1 ^0) cond_pst_equal1_x_some_total2
SWC193 ( -1 +1 ^0) cond_pst_equal1_x_some_total3
SWC194 ( -1 +1 ^0) cond_pst_equal2_x_pst_equal1
SWC195 ( -1 +1 ^0) cond_pst_equal2_x_run_eq_front1
SWC196 ( -1 +1 ^0) cond_pst_equal2_x_run_eq_front2
SWC197 ( -1 +1 ^0) cond_pst_equal2_x_some_total3
SWC198 ( -1 +1 ^0) cond_pst_equal3_x_maximal
SWC199 ( -1 +1 ^0) cond_pst_equal3_x_pst_equal2
SWC200 ( -1 +1 ^0) cond_pst_equal3_x_pst_singleton
SWC201 ( -1 +1 ^0) cond_pst_equal3_x_run_eq_max1
SWC202 ( -1 +1 ^0) cond_pst_equal3_x_run_eq_max2
SWC203 ( -1 +1 ^0) cond_pst_not_nil_ne_x_copy
SWC204 ( -1 +1 ^0) cond_pst_not_nil_ne_x_head2
SWC205 ( -1 +1 ^0) cond_pst_not_nil_ne_x_id_nil_iff
SWC206 ( -1 +1 ^0) cond_pst_not_nil_ne_x_id_segment_total1
SWC207 ( -1 +1 ^0) cond_pst_not_nil_ne_x_maximal
SWC208 ( -1 +1 ^0) cond_pst_not_nil_ne_x_ne_segment_front_total2
SWC209 ( -1 +1 ^0) cond_pst_not_nil_ne_x_ne_segment_total2
SWC210 ( -1 +1 ^0) cond_pst_not_nil_ne_x_pst_singleton_ne
SWC211 ( -1 +1 ^0) cond_pst_not_nil_ne_x_rot_l_total3
SWC212 ( -1 +1 ^0) cond_pst_not_nil_ne_x_rot_r_total3
SWC213 ( -1 +1 ^0) cond_pst_not_nil_ne_x_run_eq_max2
SWC214 ( -1 +1 ^0) cond_pst_not_nil_ne_x_run_strict_ord_front1
SWC215 ( -1 +1 ^0) cond_pst_not_nil_ne_x_set_max_elems
SWC216 ( -1 +1 ^0) cond_pst_not_nil_ne_x_set_min_elems
SWC217 ( -1 +1 ^0) cond_pst_not_nil_ne_x_some_total1
SWC218 ( -1 +1 ^0) cond_pst_not_nil_x_insert_some
SWC219 ( -1 +1 ^0) cond_pst_pivoted1_x_minimal
SWC220 ( -1 +1 ^0) cond_pst_pivoted1_x_pst_pivoted1
SWC221 ( -1 +1 ^0) cond_pst_pivoted1_x_pst_pivoted2
SWC222 ( -1 +1 ^0) cond_pst_pivoted1_x_pst_pivoted3
SWC223 ( -1 +1 ^0) cond_pst_pivoted1_x_pst_sorted2
SWC224 ( -1 +1 ^0) cond_pst_pivoted1_x_run_eq_front2
SWC225 ( -1 +1 ^0) cond_pst_pivoted1_x_run_eq_max2
SWC226 ( -1 +1 ^0) cond_pst_pivoted1_x_run_ord_front2
SWC227 ( -1 +1 ^0) cond_pst_pivoted1_x_run_ord_max2
SWC228 ( -1 +1 ^0) cond_pst_pivoted1_x_run_strict_ord_front2
SWC229 ( -1 +1 ^0) cond_pst_pivoted1_x_some_total3
SWC230 ( -1 +1 ^0) cond_pst_pivoted2_x_pst_equal1
SWC231 ( -1 +1 ^0) cond_pst_pivoted2_x_pst_pivoted1
SWC232 ( -1 +1 ^0) cond_pst_pivoted2_x_pst_pivoted3
SWC233 ( -1 +1 ^0) cond_pst_pivoted2_x_pst_strict_sorted2
SWC234 ( -1 +1 ^0) cond_pst_pivoted2_x_run_eq_front2
SWC235 ( -1 +1 ^0) cond_pst_pivoted2_x_run_eq_max2
SWC236 ( -1 +1 ^0) cond_pst_pivoted2_x_run_ord_max2
SWC237 ( -1 +1 ^0) cond_pst_pivoted2_x_run_strict_ord_front2
SWC238 ( -1 +1 ^0) cond_pst_pivoted2_x_run_strict_ord_max2
SWC239 ( -1 +1 ^0) cond_pst_pivoted3_x_maximal
SWC240 ( -1 +1 ^0) cond_pst_pivoted3_x_pst_equal3
SWC241 ( -1 +1 ^0) cond_pst_pivoted3_x_pst_pivoted1
SWC242 ( -1 +1 ^0) cond_pst_pivoted3_x_pst_pivoted3
SWC243 ( -1 +1 ^0) cond_pst_pivoted3_x_pst_sorted1
SWC244 ( -1 +1 ^0) cond_pst_pivoted3_x_run_eq_front1
SWC245 ( -1 +1 ^0) cond_pst_pivoted3_x_run_eq_front2
SWC246 ( -1 +1 ^0) cond_pst_pivoted3_x_run_eq_max2
SWC247 ( -1 +1 ^0) cond_pst_pivoted3_x_run_ord_front1
SWC248 ( -1 +1 ^0) cond_pst_pivoted3_x_run_ord_max2
SWC249 ( -1 +1 ^0) cond_pst_pivoted3_x_run_strict_ord_front1
SWC250 ( -1 +1 ^0) cond_pst_pivoted3_x_run_strict_ord_front2
SWC251 ( -1 +1 ^0) cond_pst_pivoted3_x_run_strict_ord_max2
SWC252 ( -1 +1 ^0) cond_pst_pivoted3_x_some_total2
SWC253 ( -1 +1 ^0) cond_pst_singleton_ne_x_head2
SWC254 ( -1 +1 ^0) cond_pst_singleton_ne_x_last
SWC255 ( -1 +1 ^0) cond_pst_singleton_ne_x_pst_singleton_ne
SWC256 ( -1 +1 ^0) cond_pst_singleton_ne_x_some_total2
SWC257 ( -1 +1 ^0) cond_pst_sorted1_x_maximal
SWC258 ( -1 +1 ^0) cond_pst_sorted1_x_minimal
SWC259 ( -1 +1 ^0) cond_pst_sorted1_x_pivot
SWC260 ( -1 +1 ^0) cond_pst_sorted1_x_pst_equal1
SWC261 ( -1 +1 ^0) cond_pst_sorted1_x_pst_equal3
SWC262 ( -1 +1 ^0) cond_pst_sorted1_x_pst_sorted1
SWC263 ( -1 +1 ^0) cond_pst_sorted1_x_pst_sorted2
SWC264 ( -1 +1 ^0) cond_pst_sorted1_x_pst_strict_sorted1
SWC265 ( -1 +1 ^0) cond_pst_sorted1_x_pst_strict_sorted2
SWC266 ( -1 +1 ^0) cond_pst_sorted1_x_run_eq
SWC267 ( -1 +1 ^0) cond_pst_sorted1_x_run_eq_front1
SWC268 ( -1 +1 ^0) cond_pst_sorted1_x_run_eq_max1
SWC269 ( -1 +1 ^0) cond_pst_sorted1_x_run_ord_front1
SWC270 ( -1 +1 ^0) cond_pst_sorted1_x_run_strict_ord
SWC271 ( -1 +1 ^0) cond_pst_sorted1_x_run_strict_ord_front1
SWC272 ( -1 +1 ^0) cond_pst_sorted1_x_run_strict_ord_front2
SWC273 ( -1 +1 ^0) cond_pst_sorted1_x_run_strict_ord_max1
SWC274 ( -1 +1 ^0) cond_pst_sorted1_x_run_strict_ord_max2
SWC275 ( -1 +1 ^0) cond_pst_sorted1_x_some_total1
SWC276 ( -1 +1 ^0) cond_pst_sorted1_x_some_total2
SWC277 ( -1 +1 ^0) cond_pst_sorted1_x_some_total3
SWC278 ( -1 +1 ^0) cond_pst_sorted2_x_pst_equal1
SWC279 ( -1 +1 ^0) cond_pst_sorted2_x_pst_sorted2
SWC280 ( -1 +1 ^0) cond_pst_sorted2_x_run_eq_front2
SWC281 ( -1 +1 ^0) cond_pst_sorted2_x_run_ord_front2
SWC282 ( -1 +1 ^0) cond_pst_sorted2_x_run_ord_max2
SWC283 ( -1 +1 ^0) cond_pst_sorted2_x_run_strict_ord_front2
SWC284 ( -1 +1 ^0) cond_pst_sorted2_x_some_total1
SWC285 ( -1 +1 ^0) cond_pst_sorted2_x_some_total3
SWC286 ( -1 +1 ^0) cond_pst_strict_sorted1_x_maximal
SWC287 ( -1 +1 ^0) cond_pst_strict_sorted1_x_minimal
SWC288 ( -1 +1 ^0) cond_pst_strict_sorted1_x_pivot
SWC289 ( -1 +1 ^0) cond_pst_strict_sorted1_x_pst_strict_sorted1
SWC290 ( -1 +1 ^0) cond_pst_strict_sorted1_x_pst_strict_sorted2
SWC291 ( -1 +1 ^0) cond_pst_strict_sorted1_x_run_strict_ord_max1
SWC292 ( -1 +1 ^0) cond_pst_strict_sorted1_x_some_total1
SWC293 ( -1 +1 ^0) cond_pst_strict_sorted1_x_some_total2
SWC294 ( -1 +1 ^0) cond_pst_strict_sorted1_x_some_total3
SWC295 ( -1 +1 ^0) cond_pst_strict_sorted2_x_maximal
SWC296 ( -1 +1 ^0) cond_pst_strict_sorted2_x_run_strict_ord
SWC297 ( -1 +1 ^0) cond_pst_strict_sorted2_x_some_total1
SWC298 ( -1 +1 ^0) cond_pst_top_sorted_x_minimal
SWC299 ( -1 +1 ^0) cond_pst_top_sorted_x_pivot
SWC300 ( -1 +1 ^0) cond_pst_top_sorted_x_pst_sorted1
SWC301 ( -1 +1 ^0) cond_pst_top_sorted_x_run_eq
SWC302 ( -1 +1 ^0) cond_pst_top_sorted_x_run_ord
SWC303 ( -1 +1 ^0) cond_pst_top_sorted_x_run_ord_front2
SWC304 ( -1 +1 ^0) cond_pst_top_sorted_x_run_ord_max2
SWC305 ( -1 +1 ^0) cond_pst_top_sorted_x_run_strict_ord_front1
SWC306 ( -1 +1 ^0) cond_pst_top_sorted_x_some_total2
SWC307 ( -1 +1 ^0) cond_pst_top_sorted_x_some_total3
SWC308 ( -1 +1 ^0) cond_rot_l1_x_rot_l_total3
SWC309 ( -1 +1 ^0) cond_rot_l2_x_rot_l_total3
SWC310 ( -1 +1 ^0) cond_rot_l_total1_x_rot_l_total2
SWC311 ( -1 +1 ^0) cond_rot_l_total2_x_rot_l_total1
SWC312 ( -1 +1 ^0) cond_rot_l_total2_x_rot_l_total2
SWC313 ( -1 +1 ^0) cond_rot_l_total2_x_rot_l_total3
SWC314 ( -1 +1 ^0) cond_rot_l_total3_x_rot_l_total1
SWC315 ( -1 +1 ^0) cond_rot_l_total3_x_rot_l_total2
SWC316 ( -1 +1 ^0) cond_rot_r1_x_rot_r2
SWC317 ( -1 +1 ^0) cond_rot_r2_x_rot_r2
SWC318 ( -1 +1 ^0) cond_rot_r2_x_rot_r_total3
SWC319 ( -1 +1 ^0) cond_rot_r_total1_x_rot_r_total3
SWC320 ( -1 +1 ^0) cond_rot_r_total2_x_rot_r_total2
SWC321 ( -1 +1 ^0) cond_rot_r_total2_x_rot_r_total3
SWC322 ( -1 +1 ^0) cond_rot_r_total3_x_rot_r_total3
SWC323 ( -1 +1 ^0) cond_rotate_x_rot_l_total2
SWC324 ( -1 +1 ^0) cond_rotate_x_rot_l_total3
SWC325 ( -1 +1 ^0) cond_rotate_x_rot_r_total2
SWC326 ( -1 +1 ^0) cond_run_eq_front2_x_run_eq_front1
SWC327 ( -1 +1 ^0) cond_run_eq_front2_x_run_eq_front2
SWC328 ( -1 +1 ^0) cond_run_eq_x_initialize
SWC329 ( -1 +1 ^0) cond_run_eq_x_maximal
SWC330 ( -1 +1 ^0) cond_run_eq_x_pivot
SWC331 ( -1 +1 ^0) cond_run_eq_x_run_eq_front2
SWC332 ( -1 +1 ^0) cond_run_eq_x_some_total3
SWC333 ( -1 +1 ^0) cond_run_ord_max1_x_run_ord_max1
SWC334 ( -1 +1 ^0) cond_run_ord_max1_x_run_ord_max2
SWC335 ( -1 +1 ^0) cond_run_ord_x_minimal
SWC336 ( -1 +1 ^0) cond_run_ord_x_pivot
SWC337 ( -1 +1 ^0) cond_run_ord_x_run_eq
SWC338 ( -1 +1 ^0) cond_run_ord_x_run_eq_max2
SWC339 ( -1 +1 ^0) cond_run_ord_x_run_ord_max2
SWC340 ( -1 +1 ^0) cond_run_ord_x_run_strict_ord
SWC341 ( -1 +1 ^0) cond_run_ord_x_some_total1
SWC342 ( -1 +1 ^0) cond_run_ord_x_some_total2
SWC343 ( -1 +1 ^0) cond_run_strict_ord_front2_x_run_strict_ord_front2
SWC344 ( -1 +1 ^0) cond_run_strict_ord_max2_x_run_strict_ord_max2
SWC345 ( -1 +1 ^0) cond_run_strict_ord_x_maximal
SWC346 ( -1 +1 ^0) cond_run_strict_ord_x_pivot
SWC347 ( -1 +1 ^0) cond_run_strict_ord_x_run_strict_ord_front2
SWC348 ( -1 +1 ^0) cond_run_strict_ord_x_some_total3
SWC349 ( -1 +1 ^0) cond_segment_front_ne_x_initialize
SWC350 ( -1 +1 ^0) cond_segment_front_ne_x_run_eq_front1
SWC351 ( -1 +1 ^0) cond_segment_front_ne_x_run_strict_ord_front2
SWC352 ( -1 +1 ^0) cond_segment_front_x_ne_segment_front_total1
SWC353 ( -1 +1 ^0) cond_segment_front_x_run_ord_front2
SWC354 ( -1 +1 ^0) cond_segment_ne_x_head1
SWC355 ( -1 +1 ^0) cond_segment_ne_x_lead
SWC356 ( -1 +1 ^0) cond_segment_ne_x_minimal
SWC357 ( -1 +1 ^0) cond_segment_ne_x_ne_segment_front_total2
SWC358 ( -1 +1 ^0) cond_segment_ne_x_ne_segment_total2
SWC359 ( -1 +1 ^0) cond_segment_ne_x_run_eq_max1
SWC360 ( -1 +1 ^0) cond_segment_ne_x_run_ord_max1
SWC361 ( -1 +1 ^0) cond_segment_ne_x_run_strict_ord_max1
SWC362 ( -1 +1 ^0) cond_segment_ne_x_segment_ne
SWC363 ( -1 +1 ^0) cond_segment_ne_x_some_total1
SWC364 ( -1 +1 ^0) cond_segment_ne_x_tail3
SWC365 ( -1 +1 ^0) cond_segment_rear_ne_x_ne_segment_rear_total1
SWC366 ( -1 +1 ^0) cond_segment_rear_ne_x_tail2
SWC367 ( -1 +1 ^0) cond_segment_rear_x_ne_segment_rear_total2
SWC368 ( -1 +1 ^0) cond_segment_x_minimal
SWC369 ( -1 +1 ^0) cond_segment_x_ne_segment_total1
SWC370 ( -1 +1 ^0) cond_segment_x_run_eq_front2
SWC371 ( -1 +1 ^0) cond_segment_x_run_ord_front2
SWC372 ( -1 +1 ^0) cond_segment_x_run_strict_ord_front2
SWC373 ( -1 +1 ^0) cond_segment_x_segment_rear
SWC374 ( -1 +1 ^0) cond_segment_x_some_total2
SWC375 ( -1 +1 ^0) cond_set_eq_x_copy
SWC376 ( -1 +1 ^0) cond_set_eq_x_rot_r_total1
SWC377 ( -1 +1 ^0) cond_set_eq_x_rot_r_total2
SWC378 ( -1 +1 ^0) cond_set_eq_x_rotate
SWC379 ( -1 +1 ^0) cond_set_min_elems_x_set_min_elems
SWC380 ( -1 +1 ^0) cond_some1_x_head3
SWC381 ( -1 +1 ^0) cond_some1_x_some1
SWC382 ( -1 +1 ^0) cond_some2_x_head1
SWC383 ( -1 +1 ^0) cond_some2_x_maximal
SWC384 ( -1 +1 ^0) cond_some2_x_pivot
SWC385 ( -1 +1 ^0) cond_some2_x_some_total3
SWC386 ( -1 +1 ^0) cond_some_total1_x_some_total2
SWC387 ( -1 +1 ^0) cond_some_total2_x_some_total1
SWC388 ( -1 +1 ^0) cond_some_total2_x_some_total3
SWC389 ( -1 +1 ^0) cond_some_total3_x_pivot
SWC390 ( -1 +1 ^0) cond_some_total3_x_some_total1
SWC391 ( -1 +1 ^0) cond_subst_x_copy
SWC392 ( -1 +1 ^0) cond_subst_x_minimal
SWC393 ( -1 +1 ^0) cond_subst_x_ne_segment_total1
SWC394 ( -1 +1 ^0) cond_subst_x_ne_segment_total2
SWC395 ( -1 +1 ^0) cond_subst_x_rot_l_total1
SWC396 ( -1 +1 ^0) cond_subst_x_rot_r_total1
SWC397 ( -1 +1 ^0) cond_subst_x_rot_r_total2
SWC398 ( -1 +1 ^0) cond_subst_x_run_eq_front2
SWC399 ( -1 +1 ^0) cond_subst_x_run_eq_max2
SWC400 ( -1 +1 ^0) cond_subst_x_run_ord
SWC401 ( -1 +1 ^0) cond_subst_x_run_ord_max1
SWC402 ( -1 +1 ^0) cond_subst_x_run_ord_max2
SWC403 ( -1 +1 ^0) cond_subst_x_run_strict_ord_max1
SWC404 ( -1 +1 ^0) cond_subst_x_run_strict_ord_max2
SWC405 ( -1 +1 ^0) cond_subst_x_set_eq
SWC406 ( -1 +1 ^0) cond_subst_x_set_min_elems
SWC407 ( -1 +1 ^0) cond_subst_x_some_total2
SWC408 ( -1 +1 ^0) cond_superst_x_double
SWC409 ( -1 +1 ^0) cond_superst_x_rot_l_total3
SWC410 ( -1 +1 ^0) cond_superst_x_rot_r_total1
SWC411 ( -1 +1 ^0) cond_superst_x_superst
SWC412 ( -1 +1 ^0) cond_swap_ends_x_swap_ends
SWC413 ( -1 +1 ^0) cond_swap_tos_x_swap_tos
SWC414 ( -1 +1 ^0) cond_swap_x_swap_tos
SWC415 ( -1 +1 ^0) cond_tail1_x_tail1
SWC416 ( -1 +1 ^0) cond_tail2_x_tail3
SWC417 ( -1 +1 ^0) cond_turn_x_rot_l2
SWC418 ( -1 +1 ^0) cond_turn_x_rot_l_total1
SWC419 ( -1 +1 ^0) cond_turn_x_rot_l_total2
SWC420 ( -1 +1 ^0) cond_turn_x_rot_l_total3
SWC421 ( -1 +1 ^0) cond_turn_x_rot_r_total1
SWC422 ( -1 +1 ^0) cond_turn_x_turn
SWC423 ( -1 +1 ^0) List specification
-------------------------------------------------------------------------------
Domain SWV = Software Verification.
667 problems (446 abstract, 342 CNF, 288 FOF, 37 THF)
-------------------------------------------------------------------------------
SWV001 ( -1 +0 ^0) PV1
SWV002 ( -1 +0 ^0) E1
SWV003 ( -1 +0 ^0) E2
SWV004 ( -1 +0 ^0) E3
SWV005 ( -1 +0 ^0) E4
SWV006 ( -1 +0 ^0) E5
SWV007 ( -1 +0 ^0) E6
SWV008 ( -1 +0 ^0) E7
SWV009 ( -1 +0 ^0) A condition from Hoare's FIND program
SWV010 ( -1 +1 ^0) Fact 1 of the Neumann-Stubblebine analysis
SWV011 ( -1 +1 ^0) Fact 2 of the Neumann-Stubblebine analysis
SWV012 ( -1 +1 ^0) Fact 3 of the Neumann-Stubblebine analysis
SWV013 ( -1 +1 ^0) Fact 5 of the Neumann-Stubblebine analysis
SWV014 ( -1 +1 ^0) Fact 6 of the Neumann-Stubblebine analysis
SWV015 ( -1 +1 ^0) Fact 7 of the Neumann-Stubblebine analysis
SWV016 ( -1 +1 ^0) Fact 7 of the Neumann-Stubblebine analysis
SWV017 ( -1 +1 ^0) Fact 8 of the Neumann-Stubblebine analysis
SWV018 ( -1 +1 ^0) Fact 8 of the Neumann-Stubblebine analysis
SWV019 ( -1 +0 ^0) Maximal array element
SWV020 ( -1 +0 ^0) Program verification axioms
SWV021 ( -1 +0 ^0) Show that the add function is commutative.
SWV022 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0001
SWV023 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0005
SWV024 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0009
SWV025 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0013
SWV026 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0017
SWV027 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0021
SWV028 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0025
SWV029 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0029
SWV030 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0033
SWV031 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0037
SWV032 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0041
SWV033 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0045
SWV034 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0049
SWV035 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0053
SWV036 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0057
SWV037 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0061
SWV038 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0065
SWV039 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0069
SWV040 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0073
SWV041 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0077
SWV042 ( -0 +1 ^0) Unsimplified proof obligation gauss_init_0081
SWV043 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0001
SWV044 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0004
SWV045 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0007
SWV046 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0010
SWV047 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0013
SWV048 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0016
SWV049 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0019
SWV050 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0022
SWV051 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0025
SWV052 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0028
SWV053 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0031
SWV054 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0034
SWV055 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0037
SWV056 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0040
SWV057 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0043
SWV058 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0046
SWV059 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_norm_0049
SWV060 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0001
SWV061 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0002
SWV062 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0003
SWV063 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0004
SWV064 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0005
SWV065 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0006
SWV066 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0007
SWV067 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0008
SWV068 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0009
SWV069 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0010
SWV070 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0011
SWV071 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0012
SWV072 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0013
SWV073 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0014
SWV074 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0015
SWV075 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0016
SWV076 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0017
SWV077 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0018
SWV078 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0019
SWV079 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0020
SWV080 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0021
SWV081 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0022
SWV082 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0023
SWV083 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0024
SWV084 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0025
SWV085 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0026
SWV086 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0027
SWV087 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0028
SWV088 ( -0 +1 ^0) Unsimplified proof obligation cl5_nebula_array_0029
SWV089 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0001
SWV090 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0002
SWV091 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0003
SWV092 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0004
SWV093 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0005
SWV094 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0006
SWV095 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0007
SWV096 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0008
SWV097 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0009
SWV098 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0010
SWV099 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0011
SWV100 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0012
SWV101 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0013
SWV102 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0014
SWV103 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0015
SWV104 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0016
SWV105 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0017
SWV106 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0018
SWV107 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_inuse_0019
SWV108 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0001
SWV109 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0002
SWV110 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0003
SWV111 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0004
SWV112 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0005
SWV113 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0006
SWV114 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0007
SWV115 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0008
SWV116 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0009
SWV117 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0010
SWV118 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0011
SWV119 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0012
SWV120 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0013
SWV121 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0014
SWV122 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0015
SWV123 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0016
SWV124 ( -0 +1 ^0) Unsimplified proof obligation quaternion_ds1_symm_0017
SWV125 ( -0 +1 ^0) Unsimplified proof obligation thruster_array_0001
SWV126 ( -0 +1 ^0) Unsimplified proof obligation thruster_init_0001
SWV127 ( -0 +1 ^0) Unsimplified proof obligation thruster_init_0002
SWV128 ( -0 +1 ^0) Unsimplified proof obligation thruster_inuse_0001
SWV129 ( -0 +1 ^0) Unsimplified proof obligation thruster_inuse_0002
SWV130 ( -0 +1 ^0) Unsimplified proof obligation thruster_symm_0001
SWV131 ( -0 +1 ^0) Simplified proof obligation gauss_array_0001
SWV132 ( -0 +1 ^0) Simplified proof obligation gauss_array_0002
SWV133 ( -0 +1 ^0) Simplified proof obligation gauss_array_0003
SWV134 ( -0 +1 ^0) Simplified proof obligation gauss_array_0004
SWV135 ( -0 +1 ^0) Simplified proof obligation gauss_array_0005
SWV136 ( -0 +1 ^0) Simplified proof obligation gauss_array_0006
SWV137 ( -0 +1 ^0) Simplified proof obligation gauss_array_0007
SWV138 ( -0 +1 ^0) Simplified proof obligation gauss_array_0008
SWV139 ( -0 +1 ^0) Simplified proof obligation gauss_array_0009
SWV140 ( -0 +1 ^0) Simplified proof obligation gauss_array_0010
SWV141 ( -0 +1 ^0) Simplified proof obligation gauss_array_0011
SWV142 ( -0 +1 ^0) Simplified proof obligation gauss_array_0012
SWV143 ( -0 +1 ^0) Simplified proof obligation gauss_array_0013
SWV144 ( -0 +1 ^0) Simplified proof obligation gauss_array_0014
SWV145 ( -0 +1 ^0) Simplified proof obligation gauss_array_0015
SWV146 ( -0 +1 ^0) Simplified proof obligation gauss_array_0016
SWV147 ( -0 +1 ^0) Simplified proof obligation gauss_array_0017
SWV148 ( -0 +1 ^0) Simplified proof obligation gauss_array_0018
SWV149 ( -0 +1 ^0) Simplified proof obligation gauss_array_0019
SWV150 ( -0 +1 ^0) Simplified proof obligation gauss_array_0020
SWV151 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0001
SWV152 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0002
SWV153 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0003
SWV154 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0004
SWV155 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0005
SWV156 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0006
SWV157 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0007
SWV158 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0008
SWV159 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0009
SWV160 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0010
SWV161 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0011
SWV162 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0012
SWV163 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0013
SWV164 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_norm_0014
SWV165 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0001
SWV166 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0006
SWV167 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0011
SWV168 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0016
SWV169 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0021
SWV170 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0026
SWV171 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0031
SWV172 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0036
SWV173 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0041
SWV174 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0046
SWV175 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0051
SWV176 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0056
SWV177 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0061
SWV178 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0066
SWV179 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0071
SWV180 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0076
SWV181 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0081
SWV182 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0086
SWV183 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0091
SWV184 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0096
SWV185 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0101
SWV186 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0106
SWV187 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0111
SWV188 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0116
SWV189 ( -0 +1 ^0) Simplified proof obligation cl5_nebula_init_0121
SWV190 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0001
SWV191 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0002
SWV192 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0003
SWV193 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0004
SWV194 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0005
SWV195 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0006
SWV196 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0007
SWV197 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0008
SWV198 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0009
SWV199 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0010
SWV200 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0011
SWV201 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0012
SWV202 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0013
SWV203 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0014
SWV204 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0015
SWV205 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0016
SWV206 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0017
SWV207 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0018
SWV208 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0019
SWV209 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0020
SWV210 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_inuse_0021
SWV211 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0001
SWV212 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0041
SWV213 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0081
SWV214 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0121
SWV215 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0161
SWV216 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0201
SWV217 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0241
SWV218 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0281
SWV219 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0321
SWV220 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0361
SWV221 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0401
SWV222 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0441
SWV223 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0481
SWV224 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0521
SWV225 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0561
SWV226 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0601
SWV227 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0641
SWV228 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0681
SWV229 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0721
SWV230 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0761
SWV231 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0801
SWV232 ( -0 +1 ^0) Simplified proof obligation quaternion_ds1_symm_0841
SWV233 ( -0 +1 ^0) Protocol attack problem
SWV234 ( -0 +2 ^0) XOR typecast attack on the 4758 CCA API
SWV235 ( -0 +1 ^0) XOR import/export attack on the 4758 CCA API
SWV236 ( -0 +1 ^0) IBM's known exporter attack on the 4758 CCA API
SWV237 ( -0 +1 ^0) Visa Security Module (VSM) attack
SWV238 ( -0 +1 ^0) Visa Security Module (VSM) attack denied
SWV239 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV240 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV241 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV242 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV243 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV244 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV245 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV246 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV247 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV248 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV249 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV250 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV251 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV252 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV253 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV254 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV255 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV256 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV257 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV258 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV259 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV260 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV261 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV262 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV263 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV264 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV265 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV266 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV267 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV268 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV269 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV270 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV271 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV272 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV273 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV274 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV275 ( -2 +0 ^0) Cryptographic protocol problem for messages
SWV276 ( -2 +0 ^0) Cryptographic protocol problem for events
SWV277 ( -2 +0 ^0) Cryptographic protocol problem for events
SWV278 ( -2 +0 ^0) Cryptographic protocol problem for events
SWV279 ( -2 +0 ^0) Cryptographic protocol problem for public
SWV280 ( -2 +0 ^0) Cryptographic protocol problem for public
SWV281 ( -2 +0 ^0) Cryptographic protocol problem for public
SWV282 ( -2 +0 ^0) Cryptographic protocol problem for public
SWV283 ( -2 +0 ^0) Cryptographic protocol problem for public
SWV284 ( -2 +0 ^0) Cryptographic protocol problem for shared
SWV286 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV287 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV288 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV289 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV290 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV291 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV292 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV293 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV294 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV295 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV296 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV297 ( -1 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV298 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV299 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV300 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV301 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV302 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV303 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV304 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV305 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV306 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV307 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV308 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV309 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV310 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV311 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV312 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV313 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV314 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV315 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV316 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV317 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV318 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV319 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV320 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV321 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV322 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV323 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV324 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV325 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV326 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV327 ( -2 +0 ^0) Cryptographic protocol problem for Otway Rees
SWV328 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV329 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV330 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV331 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV332 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV333 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV334 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV335 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV336 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV337 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV338 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV339 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV340 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV341 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV342 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV343 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV344 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV345 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV346 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV347 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV348 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV349 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV350 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV351 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV352 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV353 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV354 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV355 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV356 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV357 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV358 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV359 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV360 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV361 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV362 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV363 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV364 ( -2 +0 ^0) Cryptographic protocol problem for Yahalom
SWV365 ( -0 +1 ^0) Priority queue checker: lemma_I_s base
SWV366 ( -0 +1 ^0) Priority queue checker: lemma_I_s induction
SWV367 ( -0 +1 ^0) Priority queue checker: lemma_contains_s_I_remove base
SWV368 ( -0 +1 ^0) Priority queue checker: lemma_contains_s_I_remove induction
SWV369 ( -0 +1 ^0) Priority queue checker: lemma_contains_s_I base
SWV370 ( -0 +1 ^0) Priority queue checker: lemma_contains_s_I induction
SWV371 ( -0 +1 ^0) Priority queue checker: lemma_pi_min_elem
SWV372 ( -0 +2 ^0) Priority queue checker: lemma_contains_cpq_min_elem
SWV373 ( -0 +1 ^0) Priority queue checker: lemma_not_contains_min_not_ok
SWV374 ( -0 +1 ^0) Priority queue checker: lemma_ok_find_min
SWV375 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_not_phi
SWV376 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_persistence
SWV377 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_persistence_induction step 1
SWV378 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_persistence_induction step 2
SWV379 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_persistence_induction step 3
SWV380 ( -0 +1 ^0) Priority queue checker: lemma_not_ok_persistence_induction step 4
SWV381 ( -0 +4 ^0) Priority queue checker: lemma_min_elem_smallest
SWV382 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_phi
SWV383 ( -0 +1 ^0) Priority queue checker: lemma_not_check_not_phi
SWV384 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_induction
SWV385 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_induction02
SWV386 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_ind_steps 1
SWV387 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_ind_steps 2
SWV388 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_ind_steps 3
SWV389 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check_ind_steps 4
SWV390 ( -0 +1 ^0) Priority queue checker: tmp_not_check_01
SWV391 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02
SWV392 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_1 base
SWV393 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_1 step
SWV394 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_2
SWV395 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_2_1 base
SWV396 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_2_1 step
SWV397 ( -0 +1 ^0) Priority queue checker: tmp_not_check_02_3
SWV398 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03
SWV399 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03_1
SWV400 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03_2 base
SWV401 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03_2 step
SWV402 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03_3 base
SWV403 ( -0 +1 ^0) Priority queue checker: tmp_not_check_03_3 step
SWV404 ( -0 +1 ^0) Priority queue checker: tmp_not_check_04
SWV405 ( -0 +1 ^0) Priority queue checker: lemma_check_characterization base
SWV406 ( -0 +1 ^0) Priority queue checker: lemma_check_characterization step
SWV407 ( -0 +1 ^0) Priority queue checker: lemma_not_min_elem_not_check
SWV408 ( -0 +2 ^0) Priority queue checker: lemma_not_min_elem_pair
SWV409 ( -0 +1 ^0) Priority queue checker: lemma_contains_update
SWV410 ( -0 +1 ^0) Priority queue checker: lemma_contains_pair base
SWV411 ( -0 +1 ^0) Priority queue checker: lemma_contains_pair step
SWV412 ( -0 +1 ^0) Priority queue checker: lemma_contains_update_01
SWV413 ( -0 +1 ^0) Priority queue checker: lemma_contains_update_02
SWV414 ( -0 +1 ^0) Priority queue checker: Formula (12)
SWV415 ( -0 +2 ^0) Priority queue checker: Formula (7)
SWV416 ( -0 +2 ^0) Priority queue checker: Formula (8)
SWV417 ( -0 +2 ^0) Priority queue checker: Formula (9)
SWV418 ( -8 +0 ^0) Counter k=060
SWV419 ( -8 +0 ^0) Distributed mutual exclusion algorithm k=05
SWV420 ( -8 +0 ^0) Checking Gigamax Cache coherence protocol k=05
SWV421 (-16 +0 ^0) Mutex algorithm 1st process access A k=060
SWV422 (-16 +0 ^0) Mutex algorithm second process access A k=060
SWV423 ( -8 +0 ^0) Production cell control liveness k=010
SWV424 ( -8 +0 ^0) Simple access control busy state k=050
SWV425 ( -0 +0 ^2) ICL logic mapping to modal logic implies 'unit'
SWV426 ( -0 +0 ^4) ICL logic mapping to modal logic implies 'cuc'
SWV427 ( -0 +0 ^2) ICL logic mapping to modal logic implies 'idem'
SWV428 ( -0 +0 ^2) ICL logic mapping to modal logic K implies that Example 1 holds
SWV429 ( -0 +0 ^2) ICL^=> logic mapping to modal logic implies 'refl'
SWV430 ( -0 +0 ^2) ICL^=> logic mapping to modal logic implies 'trans'
SWV431 ( -0 +0 ^2) ICL^=> logic mapping to modal logic implies 'speaking_for'
SWV432 ( -0 +0 ^2) ICL^=> logic mapping to modal logic implies 'handoff'
SWV433 ( -0 +0 ^2) ICL^=> logic mapping to modal logic implies that Example 2 holds
SWV434 ( -0 +0 ^2) ICL^B logic mapping to modal logic implies 'trust'
SWV435 ( -0 +0 ^2) ICL^B logic mapping to modal logic implies 'untrust'
SWV436 ( -0 +0 ^2) ICL^B logic mapping to modal logic implies that Example 3 holds
SWV437 ( -0 +0 ^1) Can Alice read the secret file?
SWV438 ( -0 +0 ^1) Can Babu read the non-secret file?
SWV439 ( -0 +0 ^1) Can Babu read the secret file?
SWV440 ( -0 +0 ^1) Can Alice read the non-secret file?
SWV441 ( -0 +0 ^1) (K says (A => B)) => (K says A) => (K says B) in BL
SWV442 ( -0 +0 ^1) A => A in BL
SWV443 ( -0 +0 ^1) (K says A) => (K says A) in BL
SWV444 ( -0 +0 ^1) (loca says A) => (K says A) in BL
SWV445 ( -0 +0 ^1) (K says K says A) => (K says A) in BL
SWV446 ( -0 +0 ^1) K says ((K says A) => A) in BL
SWV447 ( -0 +0 ^1) Nipkow's simple map-cons problem
-------------------------------------------------------------------------------
Domain SYN = Syntactic.
1233 problems (985 abstract, 844 CNF, 368 FOF, 21 THF)
-------------------------------------------------------------------------------
SYN000 ( -2 +2 ^2) Basic TPTP FOF syntax
SYN001 ( -1 +1 ^0) Pelletier 2
SYN002 ( -1 +0 ^0) Odd and Even Problem
SYN003 ( -1 +0 ^0) Implications that form a contradiction
SYN004 ( -1 +0 ^0) Implications that form a contradiction
SYN005 ( -1 +0 ^0) Disjunctions that form a contradiction
SYN006 ( -1 +0 ^0) A problem to demonstrate controlling splits
SYN007 ( -0 +1 ^0) Pelletier Problem 71
SYN008 ( -1 +0 ^0) A problem to demonstrate the usefulness of relevancy testing
SYN009 ( -4 +0 ^0) A problem to demonstrate the usefulness of relevancy testing
SYN010 ( -1 +0 ^0) Example for Proposition 5.2 in [LMG94]
SYN011 ( -1 +0 ^0) A problem to demonstrate C-reduction
SYN012 ( -1 +0 ^0) A problem to demonstrate Model Elimination
SYN013 ( -1 +0 ^0) A problem in quantification theory
SYN014 ( -2 +0 ^0) A problem in quantification theory
SYN015 ( -2 +0 ^0) A problem in quantification theory
SYN028 ( -1 +0 ^0) EW1
SYN029 ( -1 +0 ^0) EW2
SYN030 ( -1 +0 ^0) EW3
SYN031 ( -1 +0 ^0) MQW
SYN032 ( -1 +0 ^0) Ances
SYN033 ( -1 +0 ^0) DM
SYN034 ( -1 +0 ^0) QW
SYN035 ( -1 +0 ^0) ROB1
SYN036 ( -4 +2 ^0) Andrews Challenge Problem
SYN037 ( -2 +0 ^0) Andrews Challenge Problem Variant
SYN038 ( -1 +0 ^0) Syntactic formula
SYN039 ( -1 +0 ^0) A challenge to resolution programs
SYN040 ( -1 +1 ^0) Pelletier Problem 1
SYN041 ( -1 +1 ^0) Pelletier Problem 3
SYN044 ( -1 +1 ^0) Pelletier Problem 10
SYN045 ( -1 +1 ^0) Pelletier Problem 13
SYN046 ( -1 +1 ^0) Pelletier Problem 15
SYN047 ( -1 +1 ^0) Pelletier Problem 17
SYN048 ( -1 +1 ^0) Pelletier Problem 18
SYN049 ( -1 +1 ^0) Pelletier Problem 19
SYN050 ( -1 +1 ^0) Pelletier Problem 20
SYN051 ( -1 +1 ^0) Pelletier Problem 21
SYN052 ( -1 +1 ^0) Pelletier Problem 22
SYN053 ( -1 +1 ^0) Pelletier Problem 23
SYN054 ( -1 +1 ^0) Pelletier Problem 24
SYN055 ( -1 +1 ^0) Pelletier Problem 25
SYN056 ( -1 +1 ^0) Pelletier Problem 26
SYN057 ( -1 +1 ^0) Pelletier Problem 27
SYN058 ( -1 +1 ^0) Pelletier Problem 28
SYN059 ( -1 +1 ^0) Pelletier Problem 29
SYN060 ( -1 +1 ^0) Pelletier Problem 30
SYN061 ( -1 +1 ^0) Pelletier Problem 31
SYN062 ( -1 +1 ^0) Pelletier Problem 32
SYN063 ( -2 +1 ^0) Pelletier Problem 33
SYN064 ( -1 +1 ^0) Pelletier Problem 35
SYN065 ( -1 +1 ^0) Pelletier Problem 36
SYN066 ( -1 +1 ^0) Pelletier Problem 37
SYN067 ( -3 +1 ^0) Pelletier Problem 38
SYN068 ( -1 +1 ^0) Pelletier Problem 44
SYN069 ( -1 +1 ^0) Pelletier Problem 45
SYN070 ( -1 +1 ^0) Pelletier Problem 46
SYN071 ( -1 +1 ^0) Pelletier Problem 48
SYN072 ( -1 +1 ^0) Pelletier Problem 49
SYN073 ( -1 +1 ^0) Pelletier Problem 50
SYN074 ( -1 +1 ^0) Pelletier Problem 51
SYN075 ( -1 +1 ^0) Pelletier Problem 52
SYN076 ( -1 +1 ^0) Pelletier Problem 53
SYN077 ( -1 +1 ^0) Pelletier Problem 54
SYN078 ( -1 +1 ^0) Pelletier Problem 56
SYN079 ( -1 +1 ^0) Pelletier Problem 57
SYN080 ( -1 +1 ^0) Pelletier Problem 58
SYN081 ( -1 +1 ^0) Pelletier Problem 59
SYN082 ( -1 +1 ^0) Pelletier Problem 60
SYN083 ( -1 +1 ^0) Pelletier Problem 61
SYN084 ( -2 +1 ^0) Pelletier Problem 62
SYN085 ( -1 +0 ^0) Plaisted problem s(1,10)
SYN086 ( -1 +0 ^0) Plaisted problem s(2,3)
SYN087 ( -1 +0 ^0) Plaisted problem s(3,3)
SYN088 ( -1 +0 ^0) Plaisted problem s(4,10)
SYN089 ( -1 +0 ^0) Plaisted problem t(2,2)
SYN090 ( -1 +0 ^0) Plaisted problem t(3,8)
SYN091 ( -1 +0 ^0) Plaisted problem sym(s(2,3))
SYN092 ( -1 +0 ^0) Plaisted problem sym(s(3,3))
SYN093 ( -1 +0 ^0) Plaisted problem u(t(2,2))
SYN094 ( -1 +0 ^0) Plaisted problem u(t(3,5))
SYN095 ( -1 +0 ^0) Plaisted problem m(t(2,2))
SYN096 ( -1 +0 ^0) Plaisted problem m(t(3,8))
SYN097 ( -1 +0 ^0) Plaisted problem sym(u(t(2,2)))
SYN098 ( -1 +0 ^0) Plaisted problem sym(u(t(3,2)))
SYN099 ( -1 +0 ^0) Plaisted problem sym(m(t(2,3)))
SYN100 ( -1 +0 ^0) Plaisted problem sym(m(t(3,5)))
SYN101 ( -1 +0 ^0) Plaisted problem n(t(2,2),2)
SYN102 ( -1 +0 ^0) Plaisted problem n(t(3,7),7)
SYN103 ( -1 +0 ^0) RPT63 synthetic problem 1 (quasi-uniform distribution)
SYN104 ( -1 +0 ^0) RPT63 synthetic problem 2 (quasi-uniform distribution)
SYN105 ( -1 +0 ^0) RPT63 synthetic problem 3 (quasi-uniform distribution)
SYN106 ( -1 +0 ^0) RPT63 synthetic problem 4 (quasi-uniform distribution)
SYN107 ( -1 +0 ^0) RPT63 synthetic problem 5 (quasi-uniform distribution)
SYN108 ( -1 +0 ^0) RPT63 synthetic problem 6 (quasi-uniform distribution)
SYN109 ( -1 +0 ^0) RPT63 synthetic problem 7 (quasi-uniform distribution)
SYN110 ( -1 +0 ^0) RPT63 synthetic problem 8 (quasi-uniform distribution)
SYN111 ( -1 +0 ^0) RPT63 synthetic problem 9 (quasi-uniform distribution)
SYN112 ( -1 +0 ^0) RPT63 synthetic problem 10 (quasi-uniform distribution)
SYN113 ( -1 +0 ^0) RPT63 synthetic problem 11 (quasi-uniform distribution)
SYN114 ( -1 +0 ^0) RPT63 synthetic problem 12 (quasi-uniform distribution)
SYN115 ( -1 +0 ^0) RPT63 synthetic problem 13 (quasi-uniform distribution)
SYN116 ( -1 +0 ^0) RPT63 synthetic problem 14 (quasi-uniform distribution)
SYN117 ( -1 +0 ^0) RPT63 synthetic problem 15 (quasi-uniform distribution)
SYN118 ( -1 +0 ^0) RPT63 synthetic problem 16 (quasi-uniform distribution)
SYN119 ( -1 +0 ^0) RPT63 synthetic problem 17 (quasi-uniform distribution)
SYN120 ( -1 +0 ^0) RPT63 synthetic problem 18 (quasi-uniform distribution)
SYN121 ( -1 +0 ^0) RPT63 synthetic problem 19 (quasi-uniform distribution)
SYN122 ( -1 +0 ^0) RPT63 synthetic problem 20 (quasi-uniform distribution)
SYN123 ( -1 +0 ^0) RPT63 synthetic problem 21 (quasi-uniform distribution)
SYN124 ( -1 +0 ^0) RPT63 synthetic problem 22 (quasi-uniform distribution)
SYN125 ( -1 +0 ^0) RPT63 synthetic problem 23 (quasi-uniform distribution)
SYN126 ( -1 +0 ^0) RPT63 synthetic problem 24 (quasi-uniform distribution)
SYN127 ( -1 +0 ^0) RPT63 synthetic problem 25 (quasi-uniform distribution)
SYN128 ( -1 +0 ^0) RPT63 synthetic problem 26 (quasi-uniform distribution)
SYN129 ( -1 +0 ^0) RPT63 synthetic problem 27 (quasi-uniform distribution)
SYN130 ( -1 +0 ^0) RPT63 synthetic problem 28 (quasi-uniform distribution)
SYN131 ( -1 +0 ^0) RPT63 synthetic problem 29 (quasi-uniform distribution)
SYN132 ( -1 +0 ^0) RPT63 synthetic problem 30 (quasi-uniform distribution)
SYN133 ( -1 +0 ^0) RPT63 synthetic problem 31 (quasi-uniform distribution)
SYN134 ( -1 +0 ^0) RPT63 synthetic problem 32 (quasi-uniform distribution)
SYN135 ( -1 +0 ^0) RPT63 synthetic problem 33 (quasi-uniform distribution)
SYN136 ( -1 +0 ^0) RPT63 synthetic problem 34 (quasi-uniform distribution)
SYN137 ( -1 +0 ^0) RPT63 synthetic problem 35 (quasi-uniform distribution)
SYN138 ( -1 +0 ^0) RPT63 synthetic problem 36 (quasi-uniform distribution)
SYN139 ( -1 +0 ^0) RPT63 synthetic problem 37 (quasi-uniform distribution)
SYN140 ( -1 +0 ^0) RPT63 synthetic problem 38 (quasi-uniform distribution)
SYN141 ( -1 +0 ^0) RPT63 synthetic problem 39 (quasi-uniform distribution)
SYN142 ( -1 +0 ^0) RPT63 synthetic problem 40 (quasi-uniform distribution)
SYN143 ( -1 +0 ^0) RPT63 synthetic problem 41 (quasi-uniform distribution)
SYN144 ( -1 +0 ^0) RPT63 synthetic problem 42 (quasi-uniform distribution)
SYN145 ( -1 +0 ^0) RPT63 synthetic problem 43 (quasi-uniform distribution)
SYN146 ( -1 +0 ^0) RPT63 synthetic problem 44 (quasi-uniform distribution)
SYN147 ( -1 +0 ^0) RPT63 synthetic problem 45 (quasi-uniform distribution)
SYN148 ( -1 +0 ^0) RPT63 synthetic problem 46 (quasi-uniform distribution)
SYN149 ( -1 +0 ^0) RPT63 synthetic problem 47 (quasi-uniform distribution)
SYN150 ( -1 +0 ^0) RPT63 synthetic problem 48 (quasi-uniform distribution)
SYN151 ( -1 +0 ^0) RPT63 synthetic problem 49 (quasi-uniform distribution)
SYN152 ( -1 +0 ^0) RPT63 synthetic problem 50 (quasi-uniform distribution)
SYN153 ( -1 +0 ^0) RPT63 synthetic problem 51 (quasi-uniform distribution)
SYN154 ( -1 +0 ^0) RPT63 synthetic problem 52 (quasi-uniform distribution)
SYN155 ( -1 +0 ^0) RPT63 synthetic problem 53 (quasi-uniform distribution)
SYN156 ( -1 +0 ^0) RPT63 synthetic problem 54 (quasi-uniform distribution)
SYN157 ( -1 +0 ^0) RPT63 synthetic problem 55 (quasi-uniform distribution)
SYN158 ( -1 +0 ^0) RPT63 synthetic problem 56 (quasi-uniform distribution)
SYN159 ( -1 +0 ^0) RPT63 synthetic problem 57 (quasi-uniform distribution)
SYN160 ( -1 +0 ^0) RPT63 synthetic problem 58 (quasi-uniform distribution)
SYN161 ( -1 +0 ^0) RPT63 synthetic problem 59 (quasi-uniform distribution)
SYN162 ( -1 +0 ^0) RPT63 synthetic problem 60 (quasi-uniform distribution)
SYN163 ( -1 +0 ^0) RPT63 synthetic problem 61 (quasi-uniform distribution)
SYN164 ( -1 +0 ^0) RPT63 synthetic problem 62 (quasi-uniform distribution)
SYN165 ( -1 +0 ^0) RPT63 synthetic problem 63 (quasi-uniform distribution)
SYN166 ( -1 +0 ^0) RPT63 synthetic problem 64 (quasi-uniform distribution)
SYN167 ( -1 +0 ^0) RPT63 synthetic problem 65 (quasi-uniform distribution)
SYN168 ( -1 +0 ^0) RPT63 synthetic problem 66 (quasi-uniform distribution)
SYN169 ( -1 +0 ^0) RPT63 synthetic problem 67 (quasi-uniform distribution)
SYN170 ( -1 +0 ^0) RPT63 synthetic problem 68 (quasi-uniform distribution)
SYN171 ( -1 +0 ^0) RPT63 synthetic problem 69 (quasi-uniform distribution)
SYN172 ( -1 +0 ^0) RPT63 synthetic problem 70 (quasi-uniform distribution)
SYN173 ( -1 +0 ^0) RPT63 synthetic problem 71 (quasi-uniform distribution)
SYN174 ( -1 +0 ^0) RPT63 synthetic problem 72 (quasi-uniform distribution)
SYN175 ( -1 +0 ^0) RPT63 synthetic problem 73 (quasi-uniform distribution)
SYN176 ( -1 +0 ^0) RPT63 synthetic problem 74 (quasi-uniform distribution)
SYN177 ( -1 +0 ^0) RPT63 synthetic problem 75 (quasi-uniform distribution)
SYN178 ( -1 +0 ^0) RPT63 synthetic problem 76 (quasi-uniform distribution)
SYN179 ( -1 +0 ^0) RPT63 synthetic problem 77 (quasi-uniform distribution)
SYN180 ( -1 +0 ^0) RPT63 synthetic problem 78 (quasi-uniform distribution)
SYN181 ( -1 +0 ^0) RPT63 synthetic problem 79 (quasi-uniform distribution)
SYN182 ( -1 +0 ^0) RPT63 synthetic problem 80 (quasi-uniform distribution)
SYN183 ( -1 +0 ^0) RPT63 synthetic problem 81 (quasi-uniform distribution)
SYN184 ( -1 +0 ^0) RPT63 synthetic problem 82 (quasi-uniform distribution)
SYN185 ( -1 +0 ^0) RPT63 synthetic problem 83 (quasi-uniform distribution)
SYN186 ( -1 +0 ^0) RPT63 synthetic problem 84 (quasi-uniform distribution)
SYN187 ( -1 +0 ^0) RPT63 synthetic problem 85 (quasi-uniform distribution)
SYN188 ( -1 +0 ^0) RPT63 synthetic problem 86 (quasi-uniform distribution)
SYN189 ( -1 +0 ^0) RPT63 synthetic problem 87 (quasi-uniform distribution)
SYN190 ( -1 +0 ^0) RPT63 synthetic problem 88 (quasi-uniform distribution)
SYN191 ( -1 +0 ^0) RPT63 synthetic problem 89 (quasi-uniform distribution)
SYN192 ( -1 +0 ^0) RPT63 synthetic problem 90 (quasi-uniform distribution)
SYN193 ( -1 +0 ^0) RPT63 synthetic problem 91 (quasi-uniform distribution)
SYN194 ( -1 +0 ^0) RPT63 synthetic problem 92 (quasi-uniform distribution)
SYN195 ( -1 +0 ^0) RPT63 synthetic problem 93 (quasi-uniform distribution)
SYN196 ( -1 +0 ^0) RPT63 synthetic problem 94 (quasi-uniform distribution)
SYN197 ( -1 +0 ^0) RPT63 synthetic problem 95 (quasi-uniform distribution)
SYN198 ( -1 +0 ^0) RPT63 synthetic problem 96 (quasi-uniform distribution)
SYN199 ( -1 +0 ^0) RPT63 synthetic problem 97 (quasi-uniform distribution)
SYN200 ( -1 +0 ^0) RPT63 synthetic problem 98 (quasi-uniform distribution)
SYN201 ( -1 +0 ^0) RPT63 synthetic problem 99 (quasi-uniform distribution)
SYN202 ( -1 +0 ^0) RPT63 synthetic problem 100 (quasi-uniform distribution)
SYN203 ( -1 +0 ^0) RPT63 synthetic problem 101 (quasi-uniform distribution)
SYN204 ( -1 +0 ^0) RPT63 synthetic problem 102 (quasi-uniform distribution)
SYN205 ( -1 +0 ^0) RPT63 synthetic problem 103 (quasi-uniform distribution)
SYN206 ( -1 +0 ^0) RPT63 synthetic problem 104 (quasi-uniform distribution)
SYN207 ( -1 +0 ^0) RPT63 synthetic problem 105 (quasi-uniform distribution)
SYN208 ( -1 +0 ^0) RPT63 synthetic problem 106 (quasi-uniform distribution)
SYN209 ( -1 +0 ^0) RPT63 synthetic problem 107 (quasi-uniform distribution)
SYN210 ( -1 +0 ^0) RPT63 synthetic problem 108 (quasi-uniform distribution)
SYN211 ( -1 +0 ^0) RPT63 synthetic problem 109 (quasi-uniform distribution)
SYN212 ( -1 +0 ^0) RPT63 synthetic problem 110 (quasi-uniform distribution)
SYN213 ( -1 +0 ^0) RPT63 synthetic problem 111 (quasi-uniform distribution)
SYN214 ( -1 +0 ^0) RPT63 synthetic problem 112 (quasi-uniform distribution)
SYN215 ( -1 +0 ^0) RPT63 synthetic problem 113 (quasi-uniform distribution)
SYN216 ( -1 +0 ^0) RPT63 synthetic problem 1 (skewed distribution)
SYN217 ( -1 +0 ^0) RPT63 synthetic problem 2 (skewed distribution)
SYN218 ( -1 +0 ^0) RPT63 synthetic problem 3 (skewed distribution)
SYN219 ( -1 +0 ^0) RPT63 synthetic problem 4 (skewed distribution)
SYN220 ( -1 +0 ^0) RPT63 synthetic problem 5 (skewed distribution)
SYN221 ( -1 +0 ^0) RPT63 synthetic problem 6 (skewed distribution)
SYN222 ( -1 +0 ^0) RPT63 synthetic problem 7 (skewed distribution)
SYN223 ( -1 +0 ^0) RPT63 synthetic problem 8 (skewed distribution)
SYN224 ( -1 +0 ^0) RPT63 synthetic problem 9 (skewed distribution)
SYN225 ( -1 +0 ^0) RPT63 synthetic problem 10 (skewed distribution)
SYN226 ( -1 +0 ^0) RPT63 synthetic problem 11 (skewed distribution)
SYN227 ( -1 +0 ^0) RPT63 synthetic problem 12 (skewed distribution)
SYN228 ( -1 +0 ^0) RPT63 synthetic problem 13 (skewed distribution)
SYN229 ( -1 +0 ^0) RPT63 synthetic problem 14 (skewed distribution)
SYN230 ( -1 +0 ^0) RPT63 synthetic problem 15 (skewed distribution)
SYN231 ( -1 +0 ^0) RPT63 synthetic problem 16 (skewed distribution)
SYN232 ( -1 +0 ^0) RPT63 synthetic problem 17 (skewed distribution)
SYN233 ( -1 +0 ^0) RPT63 synthetic problem 18 (skewed distribution)
SYN234 ( -1 +0 ^0) RPT63 synthetic problem 19 (skewed distribution)
SYN235 ( -1 +0 ^0) RPT63 synthetic problem 20 (skewed distribution)
SYN236 ( -1 +0 ^0) RPT63 synthetic problem 21 (skewed distribution)
SYN237 ( -1 +0 ^0) RPT63 synthetic problem 22 (skewed distribution)
SYN238 ( -1 +0 ^0) RPT63 synthetic problem 23 (skewed distribution)
SYN239 ( -1 +0 ^0) RPT63 synthetic problem 24 (skewed distribution)
SYN240 ( -1 +0 ^0) RPT63 synthetic problem 25 (skewed distribution)
SYN241 ( -1 +0 ^0) RPT63 synthetic problem 26 (skewed distribution)
SYN242 ( -1 +0 ^0) RPT63 synthetic problem 27 (skewed distribution)
SYN243 ( -1 +0 ^0) RPT63 synthetic problem 28 (skewed distribution)
SYN244 ( -1 +0 ^0) RPT63 synthetic problem 29 (skewed distribution)
SYN245 ( -1 +0 ^0) RPT63 synthetic problem 30 (skewed distribution)
SYN246 ( -1 +0 ^0) RPT63 synthetic problem 31 (skewed distribution)
SYN247 ( -1 +0 ^0) RPT63 synthetic problem 32 (skewed distribution)
SYN248 ( -1 +0 ^0) RPT63 synthetic problem 33 (skewed distribution)
SYN249 ( -1 +0 ^0) RPT63 synthetic problem 34 (skewed distribution)
SYN250 ( -1 +0 ^0) RPT63 synthetic problem 35 (skewed distribution)
SYN251 ( -1 +0 ^0) RPT63 synthetic problem 36 (skewed distribution)
SYN252 ( -1 +0 ^0) RPT63 synthetic problem 37 (skewed distribution)
SYN253 ( -1 +0 ^0) RPT63 synthetic problem 38 (skewed distribution)
SYN254 ( -1 +0 ^0) RPT63 synthetic problem 39 (skewed distribution)
SYN255 ( -1 +0 ^0) RPT63 synthetic problem 40 (skewed distribution)
SYN256 ( -1 +0 ^0) RPT63 synthetic problem 41 (skewed distribution)
SYN257 ( -1 +0 ^0) RPT63 synthetic problem 42 (skewed distribution)
SYN258 ( -1 +0 ^0) RPT63 synthetic problem 43 (skewed distribution)
SYN259 ( -1 +0 ^0) RPT63 synthetic problem 44 (skewed distribution)
SYN260 ( -1 +0 ^0) RPT63 synthetic problem 45 (skewed distribution)
SYN261 ( -1 +0 ^0) RPT63 synthetic problem 46 (skewed distribution)
SYN262 ( -1 +0 ^0) RPT63 synthetic problem 47 (skewed distribution)
SYN263 ( -1 +0 ^0) RPT63 synthetic problem 48 (skewed distribution)
SYN264 ( -1 +0 ^0) RPT63 synthetic problem 49 (skewed distribution)
SYN265 ( -1 +0 ^0) RPT63 synthetic problem 50 (skewed distribution)
SYN266 ( -1 +0 ^0) RPT63 synthetic problem 51 (skewed distribution)
SYN267 ( -1 +0 ^0) RPT63 synthetic problem 52 (skewed distribution)
SYN268 ( -1 +0 ^0) RPT63 synthetic problem 53 (skewed distribution)
SYN269 ( -1 +0 ^0) RPT63 synthetic problem 54 (skewed distribution)
SYN270 ( -1 +0 ^0) RPT63 synthetic problem 55 (skewed distribution)
SYN271 ( -1 +0 ^0) RPT63 synthetic problem 56 (skewed distribution)
SYN272 ( -1 +0 ^0) RPT63 synthetic problem 57 (skewed distribution)
SYN273 ( -1 +0 ^0) RPT63 synthetic problem 58 (skewed distribution)
SYN274 ( -1 +0 ^0) RPT63 synthetic problem 59 (skewed distribution)
SYN275 ( -1 +0 ^0) RPT63 synthetic problem 60 (skewed distribution)
SYN276 ( -1 +0 ^0) RPT63 synthetic problem 61 (skewed distribution)
SYN277 ( -1 +0 ^0) RPT63 synthetic problem 62 (skewed distribution)
SYN278 ( -1 +0 ^0) RPT63 synthetic problem 63 (skewed distribution)
SYN279 ( -1 +0 ^0) RPT63 synthetic problem 64 (skewed distribution)
SYN280 ( -1 +0 ^0) RPT63 synthetic problem 65 (skewed distribution)
SYN281 ( -1 +0 ^0) RPT63 synthetic problem 66 (skewed distribution)
SYN282 ( -1 +0 ^0) RPT63 synthetic problem 67 (skewed distribution)
SYN283 ( -1 +0 ^0) RPT63 synthetic problem 68 (skewed distribution)
SYN284 ( -1 +0 ^0) RPT63 synthetic problem 69 (skewed distribution)
SYN285 ( -1 +0 ^0) RPT63 synthetic problem 70 (skewed distribution)
SYN286 ( -1 +0 ^0) RPT63 synthetic problem 71 (skewed distribution)
SYN287 ( -1 +0 ^0) RPT63 synthetic problem 72 (skewed distribution)
SYN288 ( -1 +0 ^0) RPT63 synthetic problem 73 (skewed distribution)
SYN289 ( -1 +0 ^0) RPT63 synthetic problem 74 (skewed distribution)
SYN290 ( -1 +0 ^0) RPT63 synthetic problem 75 (skewed distribution)
SYN291 ( -1 +0 ^0) RPT63 synthetic problem 76 (skewed distribution)
SYN292 ( -1 +0 ^0) RPT63 synthetic problem 77 (skewed distribution)
SYN293 ( -1 +0 ^0) RPT63 synthetic problem 78 (skewed distribution)
SYN294 ( -1 +0 ^0) RPT63 synthetic problem 79 (skewed distribution)
SYN295 ( -1 +0 ^0) RPT63 synthetic problem 80 (skewed distribution)
SYN296 ( -1 +0 ^0) RPT63 synthetic problem 81 (skewed distribution)
SYN297 ( -1 +0 ^0) RPT63 synthetic problem 82 (skewed distribution)
SYN298 ( -1 +0 ^0) RPT63 synthetic problem 83 (skewed distribution)
SYN299 ( -1 +0 ^0) RPT63 synthetic problem 84 (skewed distribution)
SYN300 ( -1 +0 ^0) RPT63 synthetic problem 85 (skewed distribution)
SYN301 ( -1 +0 ^0) RPT63 synthetic problem 86 (skewed distribution)
SYN302 ( -1 +0 ^0) Plaisted problem a(3)
SYN303 ( -1 +0 ^0) Problem for testing satisfiability
SYN304 ( -1 +0 ^0) Problem for testing satisfiability
SYN305 ( -1 +0 ^0) Problem for testing satisfiability
SYN306 ( -1 +0 ^0) Problem for testing satisfiability
SYN307 ( -1 +0 ^0) Problem for testing satisfiability
SYN308 ( -1 +0 ^0) Problem for testing satisfiability
SYN309 ( -1 +0 ^0) Problem for testing satisfiability
SYN310 ( -1 +0 ^0) Problem for testing satisfiability
SYN311 ( -1 +0 ^0) Problem for testing satisfiability
SYN312 ( -1 +0 ^0) Problem for testing satisfiability
SYN313 ( -1 +0 ^0) Problem for testing satisfiability
SYN314 ( -1 +0 ^0) Problem for testing satisfiability
SYN315 ( -1 +1 ^0) Church problem 46.2 (1)
SYN316 ( -1 +1 ^0) Church problem 46.2 (2)
SYN317 ( -1 +1 ^0) Church problem 46.2 (3)
SYN318 ( -1 +1 ^0) Church problem 46.2 (4)
SYN319 ( -1 +1 ^0) Church problem 46.2 (5)
SYN320 ( -1 +1 ^0) Church problem 46.3 (1)
SYN321 ( -1 +1 ^0) Church problem 46.3 (2)
SYN322 ( -1 +1 ^0) Church problem 46.4 (1)
SYN323 ( -1 +1 ^0) Church problem 46.4 (2)
SYN324 ( -1 +1 ^0) Church problem 46.9 (1)
SYN325 ( -1 +1 ^0) Church problem 46.9 (2)
SYN326 ( -1 +1 ^0) Church problem 46.12 (1)
SYN327 ( -1 +1 ^0) Church problem 46.12 (2)
SYN328 ( -1 +1 ^0) Church problem 46.12 (3)
SYN329 ( -1 +1 ^0) Church problem 46.14 (1)
SYN330 ( -1 +1 ^0) Church problem 46.14 (2)
SYN331 ( -1 +1 ^0) Church problem 46.14 (3)
SYN332 ( -1 +1 ^0) Church problem 46.14 (4)
SYN333 ( -1 +1 ^0) Church problem 46.14 (5)
SYN334 ( -1 +1 ^0) Church problem 46.14 (6)
SYN335 ( -1 +1 ^0) Church problem 46.14 (7)
SYN336 ( -1 +1 ^0) Church problem 46.15 (1)
SYN337 ( -1 +1 ^0) Church problem 46.15 (2)
SYN338 ( -1 +1 ^0) Church problem 46.15 (3)
SYN339 ( -1 +1 ^0) Church problem 46.15 (4)
SYN340 ( -1 +1 ^0) Church problem 46.15 (5)
SYN341 ( -1 +1 ^0) Church problem 46.15 (6)
SYN342 ( -1 +1 ^0) Church problem 46.15 (7)
SYN343 ( -1 +1 ^0) Church problem 46.16 (2)
SYN344 ( -1 +1 ^0) Church problem 46.16 (3)
SYN345 ( -1 +1 ^0) Church problem 46.16 (4)
SYN346 ( -1 +1 ^0) Church problem 46.17 (2)
SYN347 ( -1 +1 ^0) Church problem 46.17 (3)
SYN348 ( -1 +1 ^0) Church problem 46.17 (4)
SYN349 ( -1 +1 ^0) Church problem 46.17 (5)
SYN350 ( -1 +1 ^0) Church problem 46.18 (2)
SYN351 ( -1 +1 ^0) Church problem 46.18 (3)
SYN352 ( -1 +1 ^0) Church problem 46.18 (4)
SYN353 ( -1 +1 ^0) Church problem 46.18 (5)
SYN354 ( -1 +1 ^0) Church problem 46.20 (1)
SYN355 ( -0 +1 ^0) Peter Andrews Problem X2106
SYN356 ( -0 +1 ^0) Peter Andrews Problem X2107
SYN357 ( -0 +1 ^0) Peter Andrews Problem X2108
SYN358 ( -0 +1 ^0) Peter Andrews Problem X2109
SYN359 ( -0 +1 ^0) Peter Andrews Problem X2110
SYN360 ( -0 +1 ^0) Peter Andrews Problem X2111
SYN361 ( -0 +1 ^0) Peter Andrews Problem X2112
SYN362 ( -0 +1 ^0) Peter Andrews Problem X2113
SYN363 ( -0 +1 ^0) Peter Andrews Problem X2114
SYN364 ( -0 +1 ^0) Peter Andrews Problem X2115
SYN365 ( -0 +1 ^0) Peter Andrews Problem X2116
SYN366 ( -0 +1 ^0) Peter Andrews Problem X2117
SYN367 ( -0 +1 ^0) Peter Andrews Problem X2118
SYN368 ( -0 +1 ^0) Peter Andrews Problem X2119
SYN369 ( -0 +1 ^0) Peter Andrews Problem X2120
SYN370 ( -0 +1 ^0) Peter Andrews Problem X2121
SYN371 ( -0 +1 ^0) Peter Andrews Problem X2122
SYN372 ( -0 +1 ^0) Peter Andrews Problem X2123
SYN373 ( -0 +1 ^0) Peter Andrews Problem X2124
SYN374 ( -0 +1 ^0) Peter Andrews Problem X2125
SYN375 ( -0 +1 ^0) Peter Andrews Problem X2126
SYN376 ( -0 +1 ^0) Peter Andrews Problem X2127
SYN377 ( -0 +1 ^0) Peter Andrews Problem X2128
SYN378 ( -0 +1 ^0) Peter Andrews Problem X2130
SYN379 ( -0 +1 ^0) Peter Andrews Problem X2131
SYN380 ( -0 +1 ^0) Peter Andrews Problem X2132
SYN381 ( -0 +1 ^0) Peter Andrews Problem X2133
SYN382 ( -0 +1 ^0) Peter Andrews Problem X2134
SYN383 ( -0 +1 ^0) Peter Andrews Problem X2135
SYN384 ( -0 +1 ^0) Peter Andrews Problem X2136
SYN385 ( -0 +1 ^0) Peter Andrews Problem X2137
SYN386 ( -0 +1 ^0) Peter Andrews Problem X2138
SYN387 ( -0 +1 ^0) The Law of Excluded Middle
SYN388 ( -0 +1 ^0) Expanded Law of Excluded Middle
SYN389 ( -0 +1 ^0) Pierce's Law
SYN390 ( -0 +1 ^0) Pelletier 11
SYN391 ( -0 +1 ^0) Pelletier 9
SYN392 ( -0 +1 ^0) Pelletier 14
SYN393 ( -0 +1 ^0) Pelletier 12
SYN394 ( -0 +1 ^0) Kalish and Montague Problem 201
SYN395 ( -0 +1 ^0) Kalish and Montague Problem 202
SYN396 ( -0 +1 ^0) Kalish and Montague Problem 203
SYN397 ( -0 +1 ^0) Kalish and Montague Problem 204
SYN398 ( -0 +1 ^0) Kalish and Montague Problem 215
SYN399 ( -0 +1 ^0) Kalish and Montague Problem 223
SYN400 ( -0 +1 ^0) Kalish and Montague Problem 227
SYN401 ( -0 +1 ^0) Kalish and Montague Problem 229
SYN402 ( -0 +1 ^0) Kalish and Montague Problem 230
SYN403 ( -0 +1 ^0) Kalish and Montague Problem 234
SYN404 ( -0 +1 ^0) Kalish and Montague Problem 238
SYN405 ( -0 +1 ^0) Kalish and Montague Problem 239
SYN406 ( -0 +1 ^0) Kalish and Montague Problem 240
SYN407 ( -0 +1 ^0) Kalish and Montague Problem 241
SYN408 ( -0 +1 ^0) Kalish and Montague Problem 244
SYN409 ( -0 +1 ^0) Kalish and Montague Problem 246
SYN410 ( -0 +1 ^0) Kalish and Montague Problem 249
SYN411 ( -0 +1 ^0) Kalish and Montague Problem 250
SYN412 ( -0 +1 ^0) Kalish and Montague Problem 255
SYN413 ( -0 +1 ^0) Kalish and Montague Problem 256
SYN414 ( -0 +1 ^0) Kalish and Montague Problem 265
SYN415 ( -0 +1 ^0) Kalish and Montague Problem 317
SYN416 ( -0 +1 ^0) Pelletier Problem 16
SYN417 ( -0 +1 ^0) Harrison's cute problem
SYN418 ( -1 +1 ^0) ALC, N=10, R=1, L=100, K=3, D=2, P=0, Index=002
SYN419 ( -1 +1 ^0) ALC, N=10, R=1, L=100, K=3, D=2, P=0, Index=078
SYN420 ( -1 +1 ^0) ALC, N=10, R=1, L=110, K=3, D=2, P=0, Index=036
SYN421 ( -1 +1 ^0) ALC, N=10, R=1, L=110, K=3, D=2, P=0, Index=069
SYN422 ( -1 +1 ^0) ALC, N=10, R=1, L=110, K=3, D=2, P=0, Index=097
SYN423 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=002
SYN424 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=009
SYN425 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=030
SYN426 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=050
SYN427 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=064
SYN428 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=084
SYN429 ( -1 +1 ^0) ALC, N=10, R=1, L=150, K=3, D=2, P=0, Index=093
SYN430 ( -1 +1 ^0) ALC, N=4, R=1, L=16, K=3, D=1, P=0, Index=037
SYN431 ( -1 +1 ^0) ALC, N=4, R=1, L=16, K=3, D=1, P=0, Index=042
SYN432 ( -1 +1 ^0) ALC, N=4, R=1, L=20, K=3, D=1, P=0, Index=020
SYN433 ( -1 +1 ^0) ALC, N=4, R=1, L=20, K=3, D=1, P=0, Index=036
SYN434 ( -1 +1 ^0) ALC, N=4, R=1, L=40, K=3, D=1, P=0, Index=037
SYN435 ( -1 +1 ^0) ALC, N=4, R=1, L=40, K=3, D=1, P=0, Index=046
SYN436 ( -1 +1 ^0) ALC, N=4, R=1, L=40, K=3, D=1, P=0, Index=078
SYN437 ( -1 +1 ^0) ALC, N=4, R=1, L=48, K=3, D=1, P=0, Index=082
SYN438 ( -1 +1 ^0) ALC, N=4, R=1, L=48, K=3, D=1, P=0, Index=089
SYN439 ( -1 +1 ^0) ALC, N=4, R=1, L=48, K=3, D=1, P=0, Index=090
SYN440 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=002
SYN441 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=010
SYN442 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=011
SYN443 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=012
SYN444 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=013
SYN445 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=015
SYN446 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=016
SYN447 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=017
SYN448 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=019
SYN449 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=026
SYN450 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=029
SYN451 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=030
SYN452 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=034
SYN453 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=044
SYN454 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=046
SYN455 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=056
SYN456 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=057
SYN457 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=060
SYN458 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=062
SYN459 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=073
SYN460 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=077
SYN461 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=081
SYN462 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=083
SYN463 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=092
SYN464 ( -1 +1 ^0) ALC, N=4, R=1, L=60, K=3, D=1, P=0, Index=093
SYN465 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=010
SYN466 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=017
SYN467 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=023
SYN468 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=031
SYN469 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=088
SYN470 ( -1 +1 ^0) ALC, N=4, R=1, L=68, K=3, D=1, P=0, Index=095
SYN471 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=000
SYN472 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=003
SYN473 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=005
SYN474 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=027
SYN475 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=058
SYN476 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=068
SYN477 ( -1 +1 ^0) ALC, N=4, R=1, L=72, K=3, D=1, P=0, Index=072
SYN478 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=006
SYN479 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=012
SYN480 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=016
SYN481 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=019
SYN482 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=034
SYN483 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=035
SYN484 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=036
SYN485 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=050
SYN486 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=051
SYN487 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=085
SYN488 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=086
SYN489 ( -1 +1 ^0) ALC, N=4, R=1, L=76, K=3, D=1, P=0, Index=091
SYN490 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=003
SYN491 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=007
SYN492 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=008
SYN493 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=021
SYN494 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=024
SYN495 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=065
SYN496 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=078
SYN497 ( -1 +1 ^0) ALC, N=4, R=1, L=8, K=3, D=1, P=0, Index=090
SYN498 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=000
SYN499 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=001
SYN500 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=010
SYN501 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=011
SYN502 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=023
SYN503 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=044
SYN504 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=049
SYN505 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=056
SYN506 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=057
SYN507 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=060
SYN508 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=066
SYN509 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=077
SYN510 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=081
SYN511 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=092
SYN512 ( -1 +1 ^0) ALC, N=4, R=1, L=80, K=3, D=1, P=0, Index=099
SYN513 ( -1 +1 ^0) ALC, N=5, R=1, L=105, K=3, D=2, P=0, Index=093
SYN514 ( -1 +1 ^0) ALC, N=5, R=1, L=110, K=3, D=2, P=0, Index=042
SYN515 ( -1 +1 ^0) ALC, N=5, R=1, L=15, K=3, D=2, P=0, Index=016
SYN516 ( -1 +1 ^0) ALC, N=5, R=1, L=15, K=3, D=2, P=0, Index=047
SYN517 ( -1 +1 ^0) ALC, N=5, R=1, L=15, K=3, D=2, P=0, Index=061
SYN518 ( -1 +1 ^0) ALC, N=5, R=1, L=150, K=3, D=2, P=0, Index=008
SYN519 ( -1 +1 ^0) ALC, N=5, R=1, L=175, K=3, D=2, P=0, Index=057
SYN520 ( -1 +1 ^0) ALC, N=5, R=1, L=175, K=3, D=2, P=0, Index=060
SYN521 ( -1 +1 ^0) ALC, N=5, R=1, L=20, K=3, D=2, P=0, Index=049
SYN522 ( -1 +1 ^0) ALC, N=5, R=1, L=20, K=3, D=2, P=0, Index=051
SYN523 ( -1 +1 ^0) ALC, N=5, R=1, L=20, K=3, D=2, P=0, Index=059
SYN524 ( -1 +1 ^0) ALC, N=5, R=1, L=20, K=3, D=2, P=0, Index=086
SYN525 ( -1 +1 ^0) ALC, N=5, R=1, L=20, K=3, D=2, P=0, Index=094
SYN526 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=011
SYN527 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=025
SYN528 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=029
SYN529 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=033
SYN530 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=034
SYN531 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=036
SYN532 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=042
SYN533 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=082
SYN534 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=090
SYN535 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=094
SYN536 ( -1 +1 ^0) ALC, N=5, R=1, L=25, K=3, D=2, P=0, Index=096
SYN537 ( -1 +1 ^0) ALC, N=5, R=1, L=40, K=3, D=2, P=0, Index=014
SYN538 ( -1 +1 ^0) ALC, N=5, R=1, L=40, K=3, D=2, P=0, Index=022
SYN539 ( -1 +1 ^0) ALC, N=5, R=1, L=40, K=3, D=2, P=0, Index=036
SYN540 ( -1 +1 ^0) ALC, N=5, R=1, L=40, K=3, D=2, P=0, Index=084
SYN541 ( -1 +1 ^0) ALC, N=5, R=1, L=45, K=3, D=2, P=0, Index=096
SYN542 ( -1 +1 ^0) ALC, N=6, R=1, L=54, K=3, D=1, P=0, Index=075
SYN543 ( -1 +1 ^0) ALC, N=6, R=1, L=60, K=3, D=1, P=0, Index=088
SYN544 ( -1 +1 ^0) ALC, N=8, R=1, L=120, K=3, D=2, P=0, Index=027
SYN545 ( -1 +1 ^0) ALC, N=8, R=1, L=120, K=3, D=2, P=0, Index=072
SYN546 ( -1 +1 ^0) ALC, N=8, R=1, L=120, K=3, D=2, P=0, Index=075
SYN547 ( -1 +1 ^0) ALC, N=8, R=1, L=120, K=3, D=2, P=0, Index=078
SYN548 ( -0 +1 ^0) dia box (box (p or box q)<=>box p or box q)
SYN549 ( -0 +1 ^0) dia box(dia(p or dia q) <=> (dia p or dia q))
SYN550 ( -0 +1 ^0) dia box p <=> dia box dia box p
SYN551 ( -0 +3 ^0) Cute Little Problem
SYN552 ( -1 +0 ^0) The E Killer
SYN553 ( -1 +0 ^0) Harrison problem 1630
SYN554 ( -1 +0 ^0) Harrison problem 1667
SYN555 ( -1 +0 ^0) Harrison problem 2162
SYN556 ( -1 +0 ^0) Harrison problem 2167
SYN557 ( -1 +0 ^0) Harrison problem 2313
SYN558 ( -1 +0 ^0) Harrison problem 2379
SYN559 ( -1 +0 ^0) Harrison problem 2418
SYN560 ( -1 +0 ^0) Harrison problem 2529
SYN561 ( -1 +0 ^0) Harrison problem 2539
SYN562 ( -1 +0 ^0) Harrison problem 2559
SYN563 ( -1 +0 ^0) Harrison problem 2755
SYN564 ( -1 +0 ^0) Harrison problem 2888
SYN565 ( -1 +0 ^0) Harrison problem 2889
SYN566 ( -1 +0 ^0) Harrison problem 2967
SYN567 ( -1 +0 ^0) Harrison problem 3022
SYN568 ( -1 +0 ^0) Harrison problem 3076
SYN569 ( -1 +0 ^0) Harrison problem 3088
SYN570 ( -1 +0 ^0) Harrison problem 3089
SYN571 ( -1 +0 ^0) Harrison problem 3108
SYN572 ( -1 +0 ^0) Harrison problem 3112
SYN573 ( -1 +0 ^0) Harrison problem 3208
SYN574 ( -1 +0 ^0) Harrison problem 3263
SYN575 ( -1 +0 ^0) Harrison problem 3265
SYN576 ( -1 +0 ^0) Harrison problem 3280
SYN577 ( -1 +0 ^0) Harrison problem 3300
SYN578 ( -1 +0 ^0) Harrison problem 3328
SYN579 ( -1 +0 ^0) Harrison problem 3330
SYN580 ( -1 +0 ^0) Harrison problem 3332
SYN581 ( -1 +0 ^0) Harrison problem 3466
SYN582 ( -1 +0 ^0) Harrison problem 3467
SYN583 ( -1 +0 ^0) Harrison problem 3468
SYN584 ( -1 +0 ^0) Harrison problem 3511
SYN585 ( -1 +0 ^0) Harrison problem 3538
SYN586 ( -1 +0 ^0) Harrison problem 3571
SYN587 ( -1 +0 ^0) Harrison problem 3572
SYN588 ( -1 +0 ^0) Harrison problem 3577
SYN589 ( -1 +0 ^0) Harrison problem 3578
SYN590 ( -1 +0 ^0) Harrison problem 3582
SYN591 ( -1 +0 ^0) Harrison problem 3583
SYN592 ( -1 +0 ^0) Harrison problem 3584
SYN593 ( -1 +0 ^0) Harrison problem 3632
SYN594 ( -1 +0 ^0) Harrison problem 3633
SYN595 ( -1 +0 ^0) Harrison problem 3634
SYN596 ( -1 +0 ^0) Harrison problem 3669
SYN597 ( -1 +0 ^0) Harrison problem 3670
SYN598 ( -1 +0 ^0) Harrison problem 3756
SYN599 ( -1 +0 ^0) Harrison problem 3757
SYN600 ( -1 +0 ^0) Harrison problem 3759
SYN601 ( -1 +0 ^0) Harrison problem 3799
SYN602 ( -1 +0 ^0) Harrison problem 3811
SYN603 ( -1 +0 ^0) Harrison problem 3812
SYN604 ( -1 +0 ^0) Harrison problem 3820
SYN605 ( -1 +0 ^0) Harrison problem 3825
SYN606 ( -1 +0 ^0) Harrison problem 3826
SYN607 ( -1 +0 ^0) Harrison problem 3827
SYN608 ( -1 +0 ^0) Harrison problem 3828
SYN609 ( -1 +0 ^0) Harrison problem 3829
SYN610 ( -1 +0 ^0) Harrison problem 3830
SYN611 ( -1 +0 ^0) Harrison problem 3831
SYN612 ( -1 +0 ^0) Harrison problem 3832
SYN613 ( -1 +0 ^0) Harrison problem 3862
SYN614 ( -1 +0 ^0) Harrison problem 3878
SYN615 ( -1 +0 ^0) Harrison problem 3879
SYN616 ( -1 +0 ^0) Harrison problem 3901
SYN617 ( -1 +0 ^0) Harrison problem 3908
SYN618 ( -1 +0 ^0) Harrison problem 3944
SYN619 ( -1 +0 ^0) Harrison problem 3992
SYN620 ( -1 +0 ^0) Harrison problem 3996
SYN621 ( -1 +0 ^0) Harrison problem 3998
SYN622 ( -1 +0 ^0) Harrison problem 4012
SYN623 ( -1 +0 ^0) Harrison problem 4027
SYN624 ( -1 +0 ^0) Harrison problem 4028
SYN625 ( -1 +0 ^0) Harrison problem 4030
SYN626 ( -1 +0 ^0) Harrison problem 4045
SYN627 ( -1 +0 ^0) Harrison problem 4072
SYN628 ( -1 +0 ^0) Harrison problem 4091
SYN629 ( -1 +0 ^0) Harrison problem 4093
SYN630 ( -1 +0 ^0) Harrison problem 4095
SYN631 ( -1 +0 ^0) Harrison problem 4139
SYN632 ( -1 +0 ^0) Harrison problem 4144
SYN633 ( -1 +0 ^0) Harrison problem 4216
SYN634 ( -1 +0 ^0) Harrison problem 4217
SYN635 ( -1 +0 ^0) Harrison problem 4218
SYN636 ( -1 +0 ^0) Harrison problem 4219
SYN637 ( -1 +0 ^0) Harrison problem 4261
SYN638 ( -1 +0 ^0) Harrison problem 4262
SYN639 ( -1 +0 ^0) Harrison problem 4292
SYN640 ( -1 +0 ^0) Harrison problem 4294
SYN641 ( -1 +0 ^0) Harrison problem 4296
SYN642 ( -1 +0 ^0) Harrison problem 4297
SYN643 ( -1 +0 ^0) Harrison problem 4298
SYN644 ( -1 +0 ^0) Harrison problem 4318
SYN645 ( -1 +0 ^0) Harrison problem 4319
SYN646 ( -1 +0 ^0) Harrison problem 4391
SYN647 ( -1 +0 ^0) Harrison problem 4392
SYN648 ( -1 +0 ^0) Harrison problem 4401
SYN649 ( -1 +0 ^0) Harrison problem 4403
SYN650 ( -1 +0 ^0) Harrison problem 4422
SYN651 ( -1 +0 ^0) Harrison problem 4423
SYN652 ( -1 +0 ^0) Harrison problem 4447
SYN653 ( -1 +0 ^0) Harrison problem 4458
SYN654 ( -1 +0 ^0) Harrison problem 4459
SYN655 ( -1 +0 ^0) Harrison problem 4460
SYN656 ( -1 +0 ^0) Harrison problem 4483
SYN657 ( -1 +0 ^0) Harrison problem 4500
SYN658 ( -1 +0 ^0) Harrison problem 4501
SYN659 ( -1 +0 ^0) Harrison problem 4504
SYN660 ( -1 +0 ^0) Harrison problem 4527
SYN661 ( -1 +0 ^0) Harrison problem 4528
SYN662 ( -1 +0 ^0) Harrison problem 4529
SYN663 ( -1 +0 ^0) Harrison problem 4530
SYN664 ( -1 +0 ^0) Harrison problem 4531
SYN665 ( -1 +0 ^0) Harrison problem 4532
SYN666 ( -1 +0 ^0) Harrison problem 4533
SYN667 ( -1 +0 ^0) Harrison problem 4534
SYN668 ( -1 +0 ^0) Harrison problem 4535
SYN669 ( -1 +0 ^0) Harrison problem 4536
SYN670 ( -1 +0 ^0) Harrison problem 4537
SYN671 ( -1 +0 ^0) Harrison problem 4538
SYN672 ( -1 +0 ^0) Harrison problem 4541
SYN673 ( -1 +0 ^0) Harrison problem 4552
SYN674 ( -1 +0 ^0) Harrison problem 4553
SYN675 ( -1 +0 ^0) Harrison problem 4554
SYN676 ( -1 +0 ^0) Harrison problem 4555
SYN677 ( -1 +0 ^0) Harrison problem 4556
SYN678 ( -1 +0 ^0) Harrison problem 4557
SYN679 ( -1 +0 ^0) Harrison problem 4558
SYN680 ( -1 +0 ^0) Harrison problem 4559
SYN681 ( -1 +0 ^0) Harrison problem 4560
SYN682 ( -1 +0 ^0) Harrison problem 4561
SYN683 ( -1 +0 ^0) Harrison problem 4562
SYN684 ( -1 +0 ^0) Harrison problem 4563
SYN685 ( -1 +0 ^0) Harrison problem 4564
SYN686 ( -1 +0 ^0) Harrison problem 4589
SYN687 ( -1 +0 ^0) Harrison problem 4601
SYN688 ( -1 +0 ^0) Harrison problem 4605
SYN689 ( -1 +0 ^0) Harrison problem 4606
SYN690 ( -1 +0 ^0) Harrison problem 4608
SYN691 ( -1 +0 ^0) Harrison problem 4624
SYN692 ( -1 +0 ^0) Harrison problem 4626
SYN693 ( -1 +0 ^0) Harrison problem 4627
SYN694 ( -1 +0 ^0) Harrison problem 4644
SYN695 ( -1 +0 ^0) Harrison problem 4645
SYN696 ( -1 +0 ^0) Harrison problem 4646
SYN697 ( -1 +0 ^0) Harrison problem 4647
SYN698 ( -1 +0 ^0) Harrison problem 4650
SYN699 ( -1 +0 ^0) Harrison problem 4651
SYN700 ( -1 +0 ^0) Harrison problem 4652
SYN701 ( -1 +0 ^0) Harrison problem 4653
SYN702 ( -1 +0 ^0) Harrison problem 4672
SYN703 ( -1 +0 ^0) Harrison problem 4673
SYN704 ( -1 +0 ^0) Harrison problem 4674
SYN705 ( -1 +0 ^0) Harrison problem 4675
SYN706 ( -1 +0 ^0) Harrison problem 4685
SYN707 ( -1 +0 ^0) Harrison problem 4690
SYN708 ( -1 +0 ^0) Harrison problem 4691
SYN709 ( -1 +0 ^0) Harrison problem 4692
SYN710 ( -1 +0 ^0) Harrison problem 4703
SYN711 ( -1 +0 ^0) Harrison problem 4711
SYN712 ( -1 +0 ^0) Harrison problem 4748
SYN713 ( -1 +0 ^0) Harrison problem 4750
SYN714 ( -1 +0 ^0) Harrison problem 4753
SYN715 ( -1 +0 ^0) Harrison problem 4755
SYN716 ( -1 +0 ^0) Harrison problem 4756
SYN717 ( -1 +0 ^0) Harrison problem 4760
SYN718 ( -1 +0 ^0) Harrison problem 4761
SYN719 ( -1 +0 ^0) Harrison problem 4766
SYN720 ( -1 +0 ^0) Synthetic domain theory for EBL
SYN721 ( -1 +1 ^0) Peter Andrews Problem LX1
SYN722 ( -0 +1 ^0) Peter Andrews Problem THM119
SYN723 ( -0 +1 ^0) Peter Andrews Problem THM138
SYN724 ( -1 +1 ^0) Peter Andrews Problem THM31
SYN725 ( -0 +1 ^0) Peter Andrews Problem THM39
SYN726 ( -1 +1 ^0) Peter Andrews Problem THM400
SYN727 ( -1 +1 ^0) Peter Andrews Problem THM68
SYN728 ( -1 +1 ^0) Peter Andrews Problem THM69
SYN729 ( -1 +1 ^0) Peter Andrews Problem THM72
SYN730 ( -0 +1 ^0) Peter Andrews Problem THM75
SYN731 ( -1 +1 ^0) Peter Andrews Problem X2150
SYN732 ( -0 +1 ^0) Peter Andrews Problem X3411
SYN733 ( -0 +1 ^0) Peter Andrews Problem Y2141
SYN734 ( -1 +0 ^0) PSAT - K=4 C=20 V=4 D=1.2
SYN735 ( -1 +0 ^0) PSAT - K=4 C=20 V=4 D=1.8
SYN736 ( -1 +0 ^0) PSAT - K=4 C=20 V=4 D=2.1
SYN737 ( -1 +0 ^0) PSAT - K=4 C=20 V=4 D=2.7
SYN738 ( -1 +0 ^0) PSAT - K=4 C=20 V=8 D=1.8
SYN739 ( -1 +0 ^0) PSAT - K=4 C=20 V=8 D=2.5
SYN740 ( -1 +0 ^0) PSAT - K=4 C=30 V=4 D=1.8
SYN741 ( -1 +0 ^0) PSAT - K=4 C=30 V=4 D=2.3
SYN742 ( -1 +0 ^0) PSAT - K=4 C=30 V=4 D=2.6
SYN743 ( -1 +0 ^0) PSAT - K=4 C=30 V=8 D=1.3
SYN744 ( -1 +0 ^0) PSAT - K=4 C=30 V=8 D=1.4
SYN745 ( -1 +0 ^0) PSAT - K=4 C=30 V=8 D=2.2
SYN746 ( -1 +0 ^0) PSAT - K=4 C=40 V=4 D=2.1
SYN747 ( -1 +0 ^0) PSAT - K=4 C=40 V=4 D=2.3
SYN748 ( -1 +0 ^0) PSAT - K=4 C=40 V=4 D=2.6
SYN749 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=1.4
SYN750 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=2.1
SYN751 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=2.3
SYN752 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=2.5
SYN753 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=2.7
SYN754 ( -1 +0 ^0) PSAT - K=4 C=40 V=8 D=2.8
SYN755 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=1.1
SYN756 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=1.7
SYN757 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=1.8
SYN758 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=2.1
SYN759 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=2.3
SYN760 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=2.4
SYN761 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=2.6
SYN762 ( -1 +0 ^0) PSAT - K=4 C=50 V=4 D=2.8
SYN763 ( -1 +0 ^0) PSAT - K=4 C=50 V=8 D=1.1
SYN764 ( -1 +0 ^0) PSAT - K=4 C=50 V=8 D=2.1
SYN765 ( -1 +0 ^0) PSAT - K=4 C=50 V=8 D=2.3
SYN766 ( -1 +0 ^0) PSAT - K=4 C=50 V=8 D=2.5
SYN767 ( -1 +0 ^0) PSAT - K=4 C=50 V=8 D=2.8
SYN768 ( -1 +0 ^0) PSAT inverse problem - K=4 C=20 V=4 D=1.6
SYN769 ( -1 +0 ^0) PSAT inverse problem - K=4 C=20 V=4 D=2.1
SYN770 ( -1 +0 ^0) PSAT inverse problem - K=4 C=20 V=4 D=2.5
SYN771 ( -1 +0 ^0) PSAT inverse problem - K=4 C=20 V=4 D=2.7
SYN772 ( -1 +0 ^0) PSAT inverse problem - K=4 C=20 V=8 D=1.6
SYN773 ( -1 +0 ^0) PSAT inverse - K=4 C=20 V=8 D=2.6
SYN774 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=1.6
SYN775 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=1.8
SYN776 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=2.1
SYN777 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=2.3
SYN778 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=2.5
SYN779 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=4 D=2.7
SYN780 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=8 D=2.2
SYN781 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=8 D=2.3
SYN782 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=8 D=2.5
SYN783 ( -1 +0 ^0) PSAT inverse - K=4 C=30 V=8 D=2.8
SYN784 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=1.1
SYN785 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=1.4
SYN786 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=2.2
SYN787 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=2.3
SYN788 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=2.5
SYN789 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=4 D=2.8
SYN790 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=1.7
SYN791 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=1.8
SYN792 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=2.2
SYN793 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=2.4
SYN794 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=2.5
SYN795 ( -1 +0 ^0) PSAT inverse - K=4 C=40 V=8 D=2.7
SYN796 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=1.2
SYN797 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=1.8
SYN798 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=2.1
SYN799 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=2.2
SYN800 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=2.4
SYN801 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=2.6
SYN802 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=4 D=2.8
SYN803 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=1.2
SYN804 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=1.4
SYN805 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=1.6
SYN806 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=2.1
SYN807 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=2.3
SYN808 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=2.4
SYN809 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=2.6
SYN810 ( -1 +0 ^0) PSAT inverse - K=4 C=50 V=8 D=2.8
SYN811 ( -1 +0 ^0) QBF - K=4 C=10 V=4 D=6.1
SYN812 ( -1 +0 ^0) QBF - K=4 C=10 V=8 D=6.3
SYN813 ( -1 +0 ^0) QBF - K=4 C=20 V=4 D=4.2
SYN814 ( -1 +0 ^0) QBF - K=4 C=20 V=4 D=6.4
SYN815 ( -1 +0 ^0) QBF - K=4 C=20 V=8 D=4.1
SYN816 ( -1 +0 ^0) QBF - K=4 C=20 V=8 D=4.2
SYN817 ( -1 +0 ^0) QBF - K=4 C=20 V=8 D=4.3
SYN818 ( -1 +0 ^0) QBF - K=4 C=20 V=8 D=6.2
SYN819 ( -1 +0 ^0) QBF - K=4 C=30 V=4 D=4.2
SYN820 ( -1 +0 ^0) QBF - K=4 C=30 V=4 D=4.4
SYN821 ( -1 +0 ^0) QBF - K=4 C=30 V=8 D=4.1
SYN822 ( -1 +0 ^0) QBF - K=4 C=30 V=8 D=4.3
SYN823 ( -1 +0 ^0) QBF, Ladn - K=4 C=10 V=4 D=4.2
SYN824 ( -1 +0 ^0) QBF, Ladn - K=4 C=10 V=8 D=4.1
SYN825 ( -1 +0 ^0) QBF, Ladn - K=4 C=10 V=8 D=6.3
SYN826 ( -1 +0 ^0) QBF, Ladn - K=4 C=10 V=8 D=6.6
SYN827 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=4 D=4.5
SYN828 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=8 D=4.7
SYN829 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=8 D=6.2
SYN830 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=8 D=6.4
SYN831 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=8 D=6.6
SYN832 ( -1 +0 ^0) QBF, Ladn - K=4 C=20 V=8 D=6.8
SYN833 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=4 D=4.3
SYN834 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=4 D=4.5
SYN835 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=4 D=4.6
SYN836 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=4 D=4.8
SYN837 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=4 D=6.8
SYN838 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=8 D=4.5
SYN839 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=8 D=6.2
SYN840 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=8 D=6.4
SYN841 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=8 D=6.6
SYN842 ( -1 +0 ^0) QBF, Ladn - K=4 C=30 V=8 D=6.8
SYN843 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=4.2
SYN844 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=4.4
SYN845 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=4.8
SYN846 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=6.1
SYN847 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=6.3
SYN848 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=6.5
SYN849 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=4 D=6.8
SYN850 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=4.1
SYN851 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=4.6
SYN852 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=6.2
SYN853 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=6.4
SYN854 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=6.6
SYN855 ( -1 +0 ^0) QBF, Ladn - K=4 C=40 V=8 D=6.8
SYN856 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=4 D=4.2
SYN857 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=4 D=4.6
SYN858 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=4 D=6.1
SYN859 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=4 D=6.5
SYN860 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=4 D=6.7
SYN861 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.1
SYN862 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.3
SYN863 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.4
SYN864 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.5
SYN865 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.7
SYN866 ( -1 +0 ^0) QBF, Ladn - K=4 C=50 V=8 D=4.8
SYN867 ( -1 +0 ^0) QBF, SSS - K=4 C=10 V=4 D=6.1
SYN868 ( -1 +0 ^0) QBF, SSS - K=4 C=10 V=4 D=6.4
SYN869 ( -1 +0 ^0) QBF, SSS - K=4 C=20 V=4 D=4.1
SYN870 ( -1 +0 ^0) QBF, SSS - K=4 C=20 V=4 D=4.4
SYN871 ( -1 +0 ^0) QBF, SSS - K=4 C=20 V=4 D=4.6
SYN872 ( -1 +0 ^0) QBF, SSS - K=4 C=20 V=8 D=6.3
SYN873 ( -1 +0 ^0) QBF, SSS - K=4 C=30 V=4 D=4.2
SYN874 ( -1 +0 ^0) QBF, SSS - K=4 C=30 V=4 D=4.6
SYN875 ( -1 +0 ^0) QBF, SSS - K=4 C=30 V=4 D=4.8
SYN876 ( -1 +0 ^0) QBF, SSS - K=4 C=30 V=4 D=6.3
SYN877 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=4.2
SYN878 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=4.5
SYN879 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=4.7
SYN880 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=6.1
SYN881 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=6.5
SYN882 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=6.6
SYN883 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=4 D=6.7
SYN884 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=8 D=4.2
SYN885 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=8 D=4.4
SYN886 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=8 D=4.6
SYN887 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=8 D=4.7
SYN888 ( -1 +0 ^0) QBF, SSS - K=4 C=40 V=8 D=6.1
SYN889 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=4.1
SYN890 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=4.3
SYN891 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=4.5
SYN892 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=4.7
SYN893 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=6.1
SYN894 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=6.3
SYN895 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=6.5
SYN896 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=4 D=6.7
SYN897 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=4.1
SYN898 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=4.3
SYN899 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=4.5
SYN900 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=4.7
SYN901 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=6.1
SYN902 ( -1 +0 ^0) QBF, SSS - K=4 C=50 V=8 D=6.4
SYN903 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=10 V=4 D=6.4
SYN904 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=10 V=8 D=4.5
SYN905 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=10 V=8 D=6.3
SYN906 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=20 V=4 D=4.5
SYN907 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=20 V=4 D=6.4
SYN908 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=20 V=8 D=6.6
SYN909 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=30 V=4 D=6.2
SYN910 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=30 V=8 D=4.3
SYN911 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=40 V=4 D=6.3
SYN912 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=40 V=8 D=4.4
SYN913 ( -1 +0 ^0) QBF converse PDL, SSS - K=4 C=50 V=4 D=4.6
SYN914 ( -1 +0 ^0) Show that 11 > 10
SYN915 ( -1 +1 ^0) TRUE
SYN916 ( -1 +1 ^0) FALSE
SYN917 ( -0 +1 ^0) Combined problems from Smullyan
SYN918 ( -0 +1 ^0) From Smullyan
SYN919 ( -0 +1 ^0) From Smullyan
SYN920 ( -0 +1 ^0) From Smullyan
SYN921 ( -0 +1 ^0) From Smullyan
SYN922 ( -0 +1 ^0) From Smullyan
SYN923 ( -0 +1 ^0) From Smullyan
SYN924 ( -0 +1 ^0) From Smullyan
SYN925 ( -0 +1 ^0) From Smullyan
SYN926 ( -0 +1 ^0) From Smullyan
SYN927 ( -0 +1 ^0) From Smullyan
SYN928 ( -0 +1 ^0) From Smullyan
SYN929 ( -0 +1 ^0) From Smullyan
SYN930 ( -0 +1 ^0) From Smullyan
SYN931 ( -0 +1 ^0) From Smullyan
SYN932 ( -0 +1 ^0) From Smullyan
SYN933 ( -0 +1 ^0) From Smullyan
SYN934 ( -0 +1 ^0) From Smullyan
SYN935 ( -0 +1 ^0) From Smullyan
SYN936 ( -0 +1 ^0) From Smullyan
SYN937 ( -0 +1 ^0) From Smullyan
SYN938 ( -0 +1 ^0) Combined syntactic from Shults
SYN939 ( -0 +1 ^0) Syntactic from Shults
SYN940 ( -0 +1 ^0) Syntactic from Shults
SYN941 ( -0 +1 ^0) Syntactic from Shults
SYN942 ( -0 +1 ^0) Syntactic from Shults
SYN943 ( -0 +1 ^0) Syntactic from Shults
SYN944 ( -0 +1 ^0) Syntactic from Shults
SYN945 ( -0 +1 ^0) Syntactic from Shults
SYN946 ( -0 +1 ^0) Syntactic from Shults
SYN947 ( -0 +1 ^0) Syntactic from Shults
SYN948 ( -0 +1 ^0) Syntactic from Shults
SYN949 ( -0 +1 ^0) Syntactic from Shults
SYN950 ( -0 +1 ^0) Syntactic from Shults
SYN951 ( -0 +1 ^0) Syntactic from Shults
SYN952 ( -0 +1 ^0) Syntactic from Shults
SYN953 ( -0 +1 ^0) Syntactic from Shults
SYN954 ( -0 +1 ^0) Syntactic from Shults
SYN955 ( -0 +1 ^0) Syntactic from Shults
SYN956 ( -0 +1 ^0) Syntactic from Shults
SYN957 ( -0 +1 ^0) Syntactic from Shults
SYN958 ( -0 +1 ^0) Syntactic from Shults
SYN959 ( -0 +1 ^0) Syntactic from Shults
SYN960 ( -0 +1 ^0) Syntactic from Shults
SYN961 ( -0 +1 ^0) Syntactic from Shults
SYN962 ( -0 +1 ^0) Syntactic from Shults
SYN963 ( -0 +1 ^0) Syntactic from Shults
SYN964 ( -0 +1 ^0) Syntactic from Shults
SYN965 ( -0 +1 ^0) Syntactic from Shults
SYN966 ( -0 +1 ^0) Syntactic from Shults
SYN967 ( -0 +1 ^0) Syntactic from Shults
SYN968 ( -0 +1 ^0) Syntactic from Shults
SYN969 ( -0 +1 ^0) Syntactic from Shults
SYN970 ( -0 +1 ^0) Syntactic from Shults
SYN971 ( -0 +1 ^0) Syntactic from Shults
SYN972 ( -0 +1 ^0) Syntactic from Shults
SYN973 ( -0 +1 ^0) Syntactic from Shults
SYN974 ( -0 +1 ^0) Syntactic from Shults
SYN975 ( -0 +1 ^0) Syntactic from Shults
SYN976 ( -0 +1 ^0) Syntactic from Shults
SYN977 ( -0 +1 ^0) Syntactic from Shults
SYN978 ( -0 +1 ^0) Syntactic from Shults
SYN979 ( -0 +1 ^0) Syntactic from Shults
SYN980 ( -0 +1 ^0) Syntactic from Shults
SYN981 ( -0 +1 ^0) Syntactic from Shults
SYN982 ( -1 +0 ^0) Problem that's Horn but resists hyper-resolution
SYN983 ( -0 +0 ^1) Factoring application over conjunction
SYN984 ( -0 +0 ^1) Factoring application over conjunction with lambda
SYN985 ( -0 +0 ^1) Factoring application over conjunction with abstraction
SYN987 ( -0 +0 ^2) All things are true
SYN988 ( -0 +0 ^2) All things are false
SYN989 ( -0 +0 ^2) All things are true or false
SYN990 ( -0 +0 ^1) Simple test for satisfiability
SYN991 ( -0 +0 ^1) Inconsistency of axioms that says all relations are reflexive
SYN992 ( -0 +0 ^1) There exists a reflexive relation
SYN993 ( -0 +0 ^1) Skolemization test 1
SYN994 ( -0 +0 ^1) Skolemization test 2
SYN995 ( -0 +0 ^1) Every function has a fixed point
SYN996 ( -0 +0 ^1) Test for naive Skolemization
SYN997 ( -0 +0 ^1) Test for validity of axiom of choice
SYN998 ( -0 +0 ^1) Leibniz equality is reflexive
SYN999 ( -0 +0 ^1) Leibniz equality is symmetric
-------------------------------------------------------------------------------
Domain SYO = Syntactic Continued.
38 problems (38 abstract, 0 CNF, 0 FOF, 38 THF)
-------------------------------------------------------------------------------
SYO001 ( -0 +0 ^1) Leibniz equality is transitive
SYO002 ( -0 +0 ^1) Leibniz equality obeys the congruence property under functions
SYO003 ( -0 +0 ^1) Leibniz equality obeys the congruence property under predicates
SYO004 ( -0 +0 ^1) Relating Leibniz equality to primitive equality
SYO005 ( -0 +0 ^1) The trivial direction of functional extensionality
SYO006 ( -0 +0 ^1) The trivial direction of Boolean extensionality
SYO007 ( -0 +0 ^1) The non-trivial direction of Boolean extensionality 
SYO008 ( -0 +0 ^1) The non-trivial direction of functional extensionality 
SYO009 ( -0 +0 ^1) Eta-equality using Leibniz equality
SYO010 ( -0 +0 ^1) Something requiring Xi but not Eta
SYO011 ( -0 +0 ^1) Invalid formula in model classes not requiring f
SYO012 ( -0 +0 ^1) Formula valid with Boolean extentionality 1
SYO013 ( -0 +0 ^1) Formula valid with Boolean extentionality 2
SYO014 ( -0 +0 ^1) A theorem of MBb
SYO015 ( -0 +0 ^1) A is not equal to not A
SYO016 ( -0 +0 ^1) Formula valid in MBb, but not in model classes not requiring b
SYO017 ( -0 +0 ^1) Formula valid in MBb, but not in model classes not requiring b
SYO018 ( -0 +0 ^1) Formula requiring b and Eta
SYO019 ( -0 +0 ^1) De Morgan by equivalance
SYO020 ( -0 +0 ^1) De Morgan by Leibnitz
SYO021 ( -0 +0 ^1) De Morgan by equality
SYO022 ( -0 +0 ^1) De Morgan lambda terms by Leibnitz 
SYO023 ( -0 +0 ^1) De Morgan lambda terms by Leibnitz
SYO024 ( -0 +0 ^1) De Morgan by connectives and Leibnitz
SYO025 ( -0 +0 ^1) De Morgan by connectives and equality
SYO026 ( -0 +0 ^1) Four functions from truth values to truth values
SYO027 ( -0 +0 ^1) Something is true
SYO028 ( -0 +0 ^1) Not all things are false
SYO029 ( -0 +0 ^1) There is an identity unary connective
SYO030 ( -0 +0 ^1) Not every unary connective is the identity
SYO031 ( -0 +0 ^1) Not every unary connective is the identity
SYO032 ( -0 +0 ^1) There is a disjunction connective
SYO033 ( -0 +0 ^1) There is a universal quantifer
SYO034 ( -0 +0 ^1) Formula not making use of projection
SYO035 ( -0 +0 ^1) Higher-order unification does not always provide projection terms
SYO036 ( -0 +0 ^1) Surjective Cantor theorem
SYO037 ( -0 +0 ^1) Injective Cantor theorem
SYO038 ( -0 +0 ^1) Boolos' Curious Inference
-------------------------------------------------------------------------------
Domain TOP = Topology.
131 problems (48 abstract, 24 CNF, 107 FOF, 0 THF)
-------------------------------------------------------------------------------
TOP001 ( -2 +0 ^0) Topology generated by a basis forms a topological space, part 1
TOP002 ( -2 +0 ^0) Topology generated by a basis forms a topological space, part 2
TOP003 ( -2 +0 ^0) Topology generated by a basis forms a topological space, part 3
TOP004 ( -2 +0 ^0) Topology generated by a basis forms a topological space, part 4
TOP005 ( -2 +0 ^0) Topology generated by a basis forms a topological space, part 5
TOP006 ( -1 +0 ^0) Topology generated by a basis forms a topological space
TOP007 ( -1 +0 ^0) Property 1 of topological spaces
TOP008 ( -1 +0 ^0) The subspace topology gives rise to a topological space
TOP009 ( -1 +0 ^0) If Y is open in X, and A is open in Y, then A is open in X
TOP010 ( -1 +0 ^0) A finer topology induces a finer subspace topology
TOP011 ( -1 +0 ^0) An alternative definition of top_of_basis
TOP012 ( -1 +0 ^0) Intersections and finite unions of closed sets are closed
TOP013 ( -1 +0 ^0) Properties of interior and closure
TOP014 ( -1 +0 ^0) Properties of open & interior and closed & closure
TOP015 ( -1 +0 ^0) The interior and the boundary of a set are disjoint
TOP016 ( -1 +0 ^0) The union of the interior and the boundary is the closure
TOP017 ( -1 +0 ^0) If the boundary of A is empty, A is both open and closed
TOP018 ( -1 +0 ^0) Propoerty of limits points and connected sets
TOP019 ( -1 +0 ^0) The closure of a connected set is connected
TOP020 ( -0 +1 ^0) Property of a Hausdorff topological space
TOP021 ( -0 +1 ^0) Locally compact tological space
TOP022 ( -0 +1 ^0) Homotopy groups
TOP023 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T01
TOP024 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T02
TOP025 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T03
TOP026 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T07
TOP027 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T08
TOP028 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T10
TOP029 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T13
TOP030 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T15
TOP031 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T17
TOP032 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T19
TOP033 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T21
TOP034 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T23
TOP035 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T24
TOP036 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T28
TOP037 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T30
TOP038 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T31
TOP039 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T32
TOP040 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T33
TOP041 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T34
TOP042 ( -0 +4 ^0) Maximal Kolmogorov Subspaces of a Topological Space T35
TOP043 ( -0 +4 ^0) The Tichonov Theorem T24
TOP044 ( -0 +4 ^0) Compactness of Lim-inf Topology T01
TOP045 ( -0 +4 ^0) Compactness of Lim-inf Topology T06
TOP046 ( -0 +4 ^0) Compactness of Lim-inf Topology T07
TOP047 ( -0 +4 ^0) Compactness of Lim-inf Topology T08
TOP048 ( -0 +4 ^0) Compactness of Lim-inf Topology T27
