TPTP Problem File: LCL468+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL468+1 : TPTP v9.0.0. Released v3.3.0.
% Domain : Logic Calculi (Propositional)
% Problem : Prove Hilbert's and_3 axiom from Lukasiewicz's axiomatization
% Version : [Zem73] axioms.
% English :
% Refs : [Zem73] Zeman (1973), Modal Logic, the Lewis-Modal systems
% : [Hal] Halleck (URL), John Halleck's Logic Systems
% Source : [TPTP]
% Names :
% Status : Theorem
% Rating : 0.91 v9.0.0, 0.94 v8.1.0, 0.89 v7.5.0, 0.94 v7.4.0, 0.93 v7.1.0, 0.91 v7.0.0, 0.97 v6.4.0, 0.96 v6.2.0, 0.92 v6.1.0, 0.97 v6.0.0, 0.96 v5.3.0, 1.00 v5.0.0, 0.96 v4.1.0, 0.91 v4.0.1, 0.87 v4.0.0, 0.88 v3.7.0, 0.90 v3.5.0, 0.89 v3.3.0
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 77 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 0 ~; 0 |; 1 &)
% ( 26 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 34 ( 33 usr; 32 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 65 ( 65 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
%----Include axioms of propositional logic
include('Axioms/LCL006+0.ax').
include('Axioms/LCL006+1.ax').
%----Include Lukasiewicz's axiomatization of propositional logic
include('Axioms/LCL006+3.ax').
%------------------------------------------------------------------------------
%----Operator definitions to reduce everything to and & not
fof(hilbert_op_or,axiom,
op_or ).
fof(hilbert_op_implies_and,axiom,
op_implies_and ).
fof(hilbert_op_equiv,axiom,
op_equiv ).
fof(hilbert_and_3,conjecture,
and_3 ).
%------------------------------------------------------------------------------