TPTP Problem File: COL122-2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : COL122-2 : TPTP v9.0.0. Released v3.2.0.
% Domain : Combinatory Logic
% Problem : Problem about combinators
% Version : [Pau06] axioms : Reduced > Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names :
% Status : Unsatisfiable
% Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.00 v3.2.0
% Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 4 ( 1 sgn)
% SPC : CNF_UNS_RFO_NEQ_HRN
% Comments : The problems in the [Pau06] collection each have very many axioms,
% of which only a small selection are required for the refutation.
% The mission is to find those few axioms, after which a refutation
% can be quite easily found. This version has only the necessary
% axioms.
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(c_Pair(v_x,V_U,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ) ).
cnf(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0,axiom,
c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ).
%------------------------------------------------------------------------------