object nTape6
The object nTape6 generates hard problems for higher order theorem provers containing an axiomatization of if-then-else. Formulas: f1,f2 ... if-then-else axiomatizations f3,f4 ... properties of the successor function (0 is no successor and a number is always different from its successor) conclusion0 ... there exists a function h s.t. h(0) = 1, h(1) = 0 conclusion1 ... there exists a function h s.t. h(0) = 1, h(1) = 0, h(2) = 0 conclusion2 ... there exists a function h s.t. h(0) = 1, h(1) = 0, h(2) = 1 w1 ... witness for sc w2 ... witness for sc2
The problems are (in sequent notation):
P0: f1, f2 :- conclusion0 P1: f1, f2, f3, f4 :- conclusion1 P2: f1, f2, f3, f4 :- conclusion2
The generated filenames are "ntape6-i-without-witness.tptp" for i = 0 to 2.
To show that there are actual witnesses for the function h, we provide a witness, where the witness w1 can be used for both W0 and W1:
W0: { w1 :- } x P0 W1: { w1 :- } x P1 W2: { w2 :- } x P2
The generated filenames are "ntape6-i-with-witness.tptp" for i = 0 to 2.
- Source
- nTape6.scala
- Alphabetic
- By Inheritance
- nTape6
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
export(path: String = ".", separate_axioms: Boolean = false): Unit
Export the problems P0-P2 and W0-W2 to TPTP THF.
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- val fn: String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
val
p0: Sequent[Formula]
Problem 0: sequence (0,1)
-
val
p1: Sequent[Formula]
Problem 1: sequence (1,0,0)
-
val
p2: Sequent[Formula]
Problem 0: sequence (1,0,1)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
val
w0: Sequent[Formula]
Problem 0 with witness: sequence (0,1)
-
val
w1: Sequent[Formula]
Problem 1 with witness : sequence (1,0,0)
-
val
w2: Sequent[Formula]
Problem 2 with witness: sequence (1,0,1)
-
val
w2b: Sequent[Formula]
Problem 2 with different witness: sequence (1,0,1)
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
object
formulas
Contains all the formulas used.
-
object
sequents
Contains all the conjecture sequents used.
This is the API documentation for GAPT.
The main package is at.logic.gapt.