TSTP Solution File: SET574+3 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 14:30:10 EDT 2023

% Result   : Theorem 0.19s 0.60s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sat Aug 26 09:41:58 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.55  start to proof:theBenchmark
% 0.19/0.60  %-------------------------------------------
% 0.19/0.60  % File        :CSE---1.6
% 0.19/0.60  % Problem     :theBenchmark
% 0.19/0.60  % Transform   :cnf
% 0.19/0.60  % Format      :tptp:raw
% 0.19/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.60  
% 0.19/0.60  % Result      :Theorem 0.000000s
% 0.19/0.60  % Output      :CNFRefutation 0.000000s
% 0.19/0.60  %-------------------------------------------
% 0.19/0.60  %--------------------------------------------------------------------------
% 0.19/0.60  % File     : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% 0.19/0.60  % Domain   : Set Theory
% 0.19/0.60  % Problem  : Trybulec's 13th Boolean property of sets
% 0.19/0.60  % Version  : [Try90] axioms : Reduced > Incomplete.
% 0.19/0.60  % English  :
% 0.19/0.60  
% 0.19/0.60  % Refs     : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int
% 0.19/0.60  %          : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory
% 0.19/0.60  %          : [TS89]  Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.19/0.60  % Source   : [ILF]
% 0.19/0.60  % Names    : BOOLE (13) [TS89]
% 0.19/0.60  
% 0.19/0.60  % Status   : Theorem
% 0.19/0.60  % Rating   : 0.07 v8.1.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.2.1
% 0.19/0.60  % Syntax   : Number of formulae    :    3 (   0 unt;   0 def)
% 0.19/0.60  %            Number of atoms       :    8 (   0 equ)
% 0.19/0.60  %            Maximal formula atoms :    3 (   2 avg)
% 0.19/0.60  %            Number of connectives :    5 (   0   ~;   0   |;   2   &)
% 0.19/0.60  %                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
% 0.19/0.60  %            Maximal formula depth :    6 (   5 avg)
% 0.19/0.60  %            Maximal term depth    :    1 (   1 avg)
% 0.19/0.60  %            Number of predicates  :    2 (   2 usr;   0 prp; 2-2 aty)
% 0.19/0.60  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.19/0.60  %            Number of variables   :    8 (   7   !;   1   ?)
% 0.19/0.60  % SPC      : FOF_THM_RFO_NEQ
% 0.19/0.60  
% 0.19/0.60  % Comments :
% 0.19/0.60  %--------------------------------------------------------------------------
% 0.19/0.60  %---- line(boole - df(5),1833080)
% 0.19/0.60  fof(intersect_defn,axiom,
% 0.19/0.60      ! [B,C] :
% 0.19/0.60        ( intersect(B,C)
% 0.19/0.60      <=> ? [D] :
% 0.19/0.60            ( member(D,B)
% 0.19/0.60            & member(D,C) ) ) ).
% 0.19/0.60  
% 0.19/0.60  %---- property(symmetry,op(intersect,2,predicate))
% 0.19/0.60  fof(symmetry_of_intersect,axiom,
% 0.19/0.60      ! [B,C] :
% 0.19/0.60        ( intersect(B,C)
% 0.19/0.60       => intersect(C,B) ) ).
% 0.19/0.60  
% 0.19/0.60  %---- line(boole - th(13),1833110)
% 0.19/0.60  fof(prove_th13,conjecture,
% 0.19/0.60      ! [B,C,D] :
% 0.19/0.60        ( ( member(B,C)
% 0.19/0.60          & member(B,D) )
% 0.19/0.60       => intersect(C,D) ) ).
% 0.19/0.60  
% 0.19/0.60  %--------------------------------------------------------------------------
% 0.19/0.60  %-------------------------------------------
% 0.19/0.60  % Proof found
% 0.19/0.60  % SZS status Theorem for theBenchmark
% 0.19/0.60  % SZS output start Proof
% 0.19/0.60  %ClaNum:7(EqnAxiom:0)
% 0.19/0.60  %VarNum:20(SingletonVarNum:9)
% 0.19/0.60  %MaxLitNum:3
% 0.19/0.60  %MaxfuncDepth:1
% 0.19/0.60  %SharedTerms:6
% 0.19/0.60  %goalClause: 1 2 3
% 0.19/0.60  %singleGoalClaCount:3
% 0.19/0.60  [1]P1(a1,a3)
% 0.19/0.60  [2]P1(a1,a4)
% 0.19/0.60  [3]~P2(a3,a4)
% 0.19/0.60  [4]~P2(x42,x41)+P2(x41,x42)
% 0.19/0.60  [6]~P2(x61,x62)+P1(f2(x61,x62),x62)
% 0.19/0.60  [7]~P2(x71,x72)+P1(f2(x71,x72),x71)
% 0.19/0.60  [5]~P1(x53,x51)+P2(x51,x52)+~P1(x53,x52)
% 0.19/0.60  %EqnAxiom
% 0.19/0.60  
% 0.19/0.60  %-------------------------------------------
% 0.19/0.61  cnf(8,plain,
% 0.19/0.61     ($false),
% 0.19/0.61     inference(scs_inference,[],[1,3,2,5]),
% 0.19/0.61     ['proof']).
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time :0.000000s
%------------------------------------------------------------------------------