## TPTP Problem File: SYN095-1.002.p

View Solutions - Solve Problem

```%--------------------------------------------------------------------------
% File     : SYN095-1.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% Domain   : Syntactic
% Problem  : Plaisted problem m(t(2,2))
% Version  : Biased.
% English  :

% Refs     : [Pla94] Plaisted (1994), The Search Efficiency of Theorem Prov
% Source   : [Pla94]
% Names    : M(T2n) [Pla94]

% Status   : Unsatisfiable
% Rating   : 0.00 v2.1.0
% Syntax   : Number of clauses     :   13 (   5 unt;   0 nHn;  13 RR)
%            Number of literals    :   25 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   6 usr;   0 prp; 1-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    9 (   1 sgn)
% SPC      : CNF_UNS_EPR_NEQ_HRN

% Comments : Biased away from various calculi.
%          : tptp2X: -f tptp -s2 SYN095-1.g
% Bugfixes : v1.2.0 - Bugfix in SYN086-1.
%          : v1.2.1 - Bugfix in SYN086-1.
%--------------------------------------------------------------------------
cnf(m_s2_goal_1,negated_conjecture,
~ p_1_2(X) ).

cnf(m_s2_type11_1,axiom,
( p_1_2(X)
| ~ p_2_2(X)
| ~ p_1_1(X) ) ).

cnf(m_s2_type11_2,axiom,
( p_1_2(X)
| ~ q_2_2(X)
| ~ q_1_1(X) ) ).

cnf(m_s2_type12_1,axiom,
( q_1_2(X)
| ~ p_2_2(X)
| ~ q_1_1(X) ) ).

cnf(m_s2_type12_2,axiom,
( q_1_2(X)
| ~ q_2_2(X)
| ~ p_1_1(X) ) ).

cnf(m_s2_type21_1,axiom,
( p_1_1(X)
| ~ p_1_2(X) ) ).

cnf(m_s2_type21_2,axiom,
( q_1_1(X)
| ~ q_1_2(X) ) ).

cnf(m_s2_type22_1,axiom,
( p_2_2(X)
| ~ p_1_2(X) ) ).

cnf(m_s2_type22_2,axiom,
( q_2_2(X)
| ~ q_1_2(X) ) ).

cnf(m_t2_1,axiom,
p_1_1(a) ).

cnf(m_t2_2,axiom,
q_1_1(a) ).

cnf(m_t2_3,axiom,
p_2_2(a) ).

cnf(m_t2_4,axiom,
q_2_2(a) ).

%--------------------------------------------------------------------------
```