TPTP Problem File: SYN948+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN948+1 : TPTP v9.0.0. Released v3.1.0.
% Domain : Syntactic
% Problem : Syntactic from Shults
% Version : Especial.
% English :
% Refs : [Shu04] Shults (2004), Email to G. Sutcliffe
% Source : [Shu04]
% Names :
% Status : Theorem
% Rating : 0.07 v9.0.0, 0.00 v5.5.0, 0.04 v5.3.0, 0.09 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.11 v4.0.0, 0.10 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.22 v3.1.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 3 ( 0 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 2 ( 0 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 3 ( 1 !; 2 ?)
% SPC : FOF_THM_RFO_NEQ
% Comments :
%--------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X] :
? [Y] :
( a(X,Y)
& a(Y,Y) )
=> ? [Z] : a(Z,Z) ) ).
%--------------------------------------------------------------------------