TPTP Problem File: SYN055-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN055-1 : TPTP v8.2.0. Released v1.0.0.
% Domain : Syntactic
% Problem : Pelletier Problem 25
% Version : Especial.
% English :
% Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% Source : [Pel86]
% Names : Pelletier 25 [Pel86]
% Status : Unsatisfiable
% Rating : 0.00 v2.0.0
% Syntax : Number of clauses : 7 ( 1 unt; 2 nHn; 7 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 5 usr; 0 prp; 1-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% SPC : CNF_UNS_EPR_NEQ_NHN
% Comments :
%--------------------------------------------------------------------------
cnf(clause_1,axiom,
big_p(a) ).
cnf(clause_2,axiom,
( ~ big_f(X)
| ~ big_g(X)
| ~ big_r(X) ) ).
cnf(clause_3,axiom,
( ~ big_p(X)
| big_f(X) ) ).
cnf(clause_4,axiom,
( ~ big_p(X)
| big_g(X) ) ).
cnf(clause_5,axiom,
( ~ big_p(X)
| big_q(X)
| big_p(b) ) ).
cnf(clause_6,negated_conjecture,
( ~ big_p(X)
| big_q(X)
| big_r(b) ) ).
cnf(clause_7,negated_conjecture,
( ~ big_q(X)
| ~ big_p(X) ) ).
%--------------------------------------------------------------------------