TPTP Problem File: SET033-4.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SET033-4 : TPTP v9.0.0. Released v1.0.0.
% Domain : Set Theory
% Problem : Domain of composition
% Version : [BL+86] axioms.
% English :
% Refs : [BL+86] Boyer et al. (1986), Set Theory in First-Order Logic:
% Source : [BL+86]
% Names : Lemma 18 [BL+86]
% Status : Unknown
% Rating : 1.00 v2.0.0
% Syntax : Number of clauses : 143 ( 13 unt; 20 nHn; 120 RR)
% Number of literals : 357 ( 48 equ; 198 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 0 prp; 1-5 aty)
% Number of functors : 61 ( 61 usr; 8 con; 0-5 aty)
% Number of variables : 320 ( 28 sgn)
% SPC : CNF_UNK_RFO_SEQ_NHN
% Comments :
%--------------------------------------------------------------------------
%----Include Godel's set axioms
include('Axioms/SET003-0.ax').
%--------------------------------------------------------------------------
cnf(range_subset_of_domain,hypothesis,
subset(range_of(a),domain_of(b)) ).
cnf(prove_domain_of_composition,negated_conjecture,
domain_of(a) != domain_of(compose(b,a)) ).
%--------------------------------------------------------------------------