TPTP Problem File: SYN329-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN329-1 : TPTP v9.0.0. Released v1.2.0.
% Domain : Syntactic
% Problem : Church problem 46.14 (1)
% Version : Especial.
% English :
% Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% Source : [Tam94]
% Names : Ch14N1 [Tam94]
% Status : Satisfiable
% Rating : 0.00 v5.5.0, 0.25 v5.4.0, 0.00 v2.5.0, 0.17 v2.4.0, 0.00 v2.1.0, 0.00 v2.0.0
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 1 RR)
% Number of literals : 4 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 6 ( 2 sgn)
% SPC : CNF_SAT_RFO_NEQ
% Comments : All the problems here can be decided by using a certain
% completeness-preserving term ordering strategies. See [FL+93].
% : The conversion from the full 1st order form in [Chu56]
% to clause form was done by hand by Tanel Tammet.
%--------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
f(X,X) ).
cnf(clause2,negated_conjecture,
f(Y,Y) ).
cnf(clause3,negated_conjecture,
f(X,z(X,Y)) ).
cnf(clause4,negated_conjecture,
~ f(z(X,Y),Y) ).
%--------------------------------------------------------------------------