TPTP Problem File: SYN334-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN334-1 : TPTP v9.0.0. Released v1.2.0.
% Domain : Syntactic
% Problem : Church problem 46.14 (6)
% 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 : Ch14N6 [Tam94]
% Status : Unsatisfiable
% Rating : 0.09 v9.0.0, 0.08 v8.2.0, 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.25 v3.3.0, 0.33 v3.2.0, 0.00 v2.0.0
% Syntax : Number of clauses : 7 ( 0 unt; 2 nHn; 5 RR)
% Number of literals : 17 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 14 ( 0 sgn)
% SPC : CNF_UNS_RFO_NEQ_NHN
% 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,Y)
| f(X,z(X,Y))
| ~ g(Y,z(X,Y)) ) ).
cnf(clause2,negated_conjecture,
( ~ f(X,Y)
| ~ f(X,z(X,Y))
| g(Y,z(X,Y)) ) ).
cnf(clause3,negated_conjecture,
( ~ f(z(X,Y),z(X,Y))
| g(z(X,Y),z(X,Y))
| ~ f(X,Y) ) ).
cnf(clause4,negated_conjecture,
( f(z(X,Y),z(X,Y))
| f(X,Y) ) ).
cnf(clause5,negated_conjecture,
( ~ g(z(X,Y),z(X,Y))
| f(X,Y) ) ).
cnf(clause6,negated_conjecture,
( g(X,Y)
| g(z(X,Y),z(X,Y)) ) ).
cnf(clause7,negated_conjecture,
( ~ g(X,Y)
| ~ g(z(X,Y),z(X,Y)) ) ).
%--------------------------------------------------------------------------