TPTP Problem File: LCL443-1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL443-1 : TPTP v8.2.0. Released v3.2.0.
% Domain : Logic Calculi (Propositional)
% Problem : Problem about propositional logic
% Version : [Pau06] axioms : Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names : PropLog__imp_false [Pau06]
% Status : Unsatisfiable
% Rating : 0.65 v8.2.0, 0.86 v8.1.0, 0.74 v7.5.0, 0.79 v7.4.0, 0.71 v7.3.0, 0.75 v7.1.0, 0.67 v7.0.0, 0.80 v6.4.0, 0.73 v6.2.0, 0.90 v6.1.0, 0.79 v6.0.0, 0.90 v5.5.0, 0.95 v5.3.0, 1.00 v5.2.0, 0.94 v5.0.0, 1.00 v4.1.0, 0.92 v4.0.1, 0.91 v3.7.0, 0.90 v3.5.0, 0.91 v3.4.0, 0.92 v3.3.0, 1.00 v3.2.0
% Syntax : Number of clauses : 1373 ( 225 unt; 28 nHn;1286 RR)
% Number of literals : 2584 ( 205 equ;1230 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 82 ( 81 usr; 0 prp; 1-3 aty)
% Number of functors : 129 ( 129 usr; 22 con; 0-6 aty)
% Number of variables : 1954 ( 231 sgn)
% SPC : CNF_UNS_RFO_SEQ_NHN
% 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.
%------------------------------------------------------------------------------
include('Axioms/LCL005-0.ax').
include('Axioms/MSC001-2.ax').
include('Axioms/MSC001-0.ax').
%------------------------------------------------------------------------------
cnf(cls_PropLog_Odeduction_0,axiom,
( ~ c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a))
| c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
cnf(cls_PropLog_Othms_OMP_0,axiom,
( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
| c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
( ~ c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a))
| c_in(V_p,c_PropLog_Othms(c_insert(V_a,V_G,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)) ) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
%------------------------------------------------------------------------------