%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SET639+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n026.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  : 600s
% DateTime : Tue Jul 19 04:39:19 EDT 2022

% Result   : Theorem 0.50s 0.65s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th121,conjecture,
    ! [B,C] :
      ( ( subset(B,C)
        & intersection(C,B) = empty_set )
     => B = empty_set ),
    input ).

fof(c4,negated_conjecture,
    ~ ! [B,C] :
        ( ( subset(B,C)
          & intersection(C,B) = empty_set )
       => B = empty_set ),
    inference(assume_negation,status(cth),[prove_th121]) ).

fof(c5,negated_conjecture,
    ? [B,C] :
      ( subset(B,C)
      & intersection(C,B) = empty_set
      & B != empty_set ),
    inference(fof_nnf,status(thm),[c4]) ).

fof(c6,negated_conjecture,
    ? [B] :
      ( ? [C] :
          ( subset(B,C)
          & intersection(C,B) = empty_set )
      & B != empty_set ),
    inference(shift_quantors,status(thm),[c5]) ).

fof(c7,negated_conjecture,
    ? [X2] :
      ( ? [X3] :
          ( subset(X2,X3)
          & intersection(X3,X2) = empty_set )
      & X2 != empty_set ),
    inference(variable_rename,status(thm),[c6]) ).

fof(c8,negated_conjecture,
    ( subset(skolem0001,skolem0002)
    & intersection(skolem0002,skolem0001) = empty_set
    & skolem0001 != empty_set ),
    inference(skolemize,status(esa),[c7]) ).

cnf(c11,negated_conjecture,
    skolem0001 != empty_set,
    inference(split_conjunct,status(thm),[c8]) ).

cnf(transitivity,axiom,
    ( X50 != X52
    | X52 != X51
    | X50 = X51 ),
    eq_axiom ).

cnf(c10,negated_conjecture,
    intersection(skolem0002,skolem0001) = empty_set,
    inference(split_conjunct,status(thm),[c8]) ).

cnf(c73,plain,
    ( X146 != intersection(skolem0002,skolem0001)
    | X146 = empty_set ),
    inference(resolution,status(thm),[c10,transitivity]) ).

cnf(symmetry,axiom,
    ( X40 != X41
    | X41 = X40 ),
    eq_axiom ).

cnf(c9,negated_conjecture,
    subset(skolem0001,skolem0002),
    inference(split_conjunct,status(thm),[c8]) ).

fof(subset_intersection,axiom,
    ! [B,C] :
      ( subset(B,C)
     => intersection(B,C) = B ),
    input ).

fof(c62,axiom,
    ! [B,C] :
      ( ~ subset(B,C)
      | intersection(B,C) = B ),
    inference(fof_nnf,status(thm),[subset_intersection]) ).

fof(c63,axiom,
    ! [X35,X36] :
      ( ~ subset(X35,X36)
      | intersection(X35,X36) = X35 ),
    inference(variable_rename,status(thm),[c62]) ).

cnf(c64,axiom,
    ( ~ subset(X108,X107)
    | intersection(X108,X107) = X108 ),
    inference(split_conjunct,status(thm),[c63]) ).

cnf(c122,plain,
    intersection(skolem0001,skolem0002) = skolem0001,
    inference(resolution,status(thm),[c64,c9]) ).

cnf(c215,plain,
    skolem0001 = intersection(skolem0001,skolem0002),
    inference(resolution,status(thm),[c122,symmetry]) ).

fof(commutativity_of_intersection,axiom,
    ! [B,C] : intersection(B,C) = intersection(C,B),
    input ).

fof(c32,axiom,
    ! [X16,X17] : intersection(X16,X17) = intersection(X17,X16),
    inference(variable_rename,status(thm),[commutativity_of_intersection]) ).

cnf(c33,axiom,
    intersection(X65,X66) = intersection(X66,X65),
    inference(split_conjunct,status(thm),[c32]) ).

cnf(c79,plain,
    ( X156 != intersection(X157,X158)
    | X156 = intersection(X158,X157) ),
    inference(resolution,status(thm),[c33,transitivity]) ).

cnf(c297,plain,
    skolem0001 = intersection(skolem0002,skolem0001),
    inference(resolution,status(thm),[c79,c215]) ).

cnf(c383,plain,
    skolem0001 = empty_set,
    inference(resolution,status(thm),[c297,c73]) ).

cnf(c390,plain,
    $false,
    inference(resolution,status(thm),[c383,c11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET639+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.33  % Computer : n026.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  : 600
% 0.13/0.33  % DateTime : Sat Jul  9 21:20:11 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.50/0.65  # Version:  1.3
% 0.50/0.65  # SZS status Theorem
% 0.50/0.65  # SZS output start CNFRefutation
% See solution above
% 0.50/0.65  
% 0.50/0.65  # Initial clauses    : 29
% 0.50/0.65  # Processed clauses  : 72
% 0.50/0.65  # Factors computed   : 1
% 0.50/0.65  # Resolvents computed: 333
% 0.50/0.65  # Tautologies deleted: 3
% 0.50/0.65  # Forward subsumed   : 48
% 0.50/0.65  # Backward subsumed  : 1
% 0.50/0.65  # -------- CPU Time ---------
% 0.50/0.65  # User time          : 0.295 s
% 0.50/0.65  # System time        : 0.015 s
% 0.50/0.65  # Total time         : 0.310 s
%------------------------------------------------------------------------------