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

% Computer : n021.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:41:05 EDT 2022

% Result   : Theorem 3.77s 3.96s
% Output   : Refutation 3.77s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)

% Comments : 
%------------------------------------------------------------------------------
fof(t27_zfmisc_1,conjecture,
    ! [A,B,C] :
      ( subset(unordered_pair(A,B),singleton(C))
     => unordered_pair(A,B) = singleton(C) ),
    input ).

fof(c6,negated_conjecture,
    ~ ! [A,B,C] :
        ( subset(unordered_pair(A,B),singleton(C))
       => unordered_pair(A,B) = singleton(C) ),
    inference(assume_negation,status(cth),[t27_zfmisc_1]) ).

fof(c7,negated_conjecture,
    ? [A,B,C] :
      ( subset(unordered_pair(A,B),singleton(C))
      & unordered_pair(A,B) != singleton(C) ),
    inference(fof_nnf,status(thm),[c6]) ).

fof(c8,negated_conjecture,
    ? [X3,X4,X5] :
      ( subset(unordered_pair(X3,X4),singleton(X5))
      & unordered_pair(X3,X4) != singleton(X5) ),
    inference(variable_rename,status(thm),[c7]) ).

fof(c9,negated_conjecture,
    ( subset(unordered_pair(skolem0001,skolem0002),singleton(skolem0003))
    & unordered_pair(skolem0001,skolem0002) != singleton(skolem0003) ),
    inference(skolemize,status(esa),[c8]) ).

cnf(c11,negated_conjecture,
    unordered_pair(skolem0001,skolem0002) != singleton(skolem0003),
    inference(split_conjunct,status(thm),[c9]) ).

cnf(transitivity,axiom,
    ( X18 != X19
    | X19 != X20
    | X18 = X20 ),
    eq_axiom ).

cnf(symmetry,axiom,
    ( X16 != X17
    | X17 = X16 ),
    eq_axiom ).

fof(t69_enumset1,axiom,
    ! [A] : unordered_pair(A,A) = singleton(A),
    input ).

fof(c4,axiom,
    ! [X2] : unordered_pair(X2,X2) = singleton(X2),
    inference(variable_rename,status(thm),[t69_enumset1]) ).

cnf(c5,axiom,
    unordered_pair(X24,X24) = singleton(X24),
    inference(split_conjunct,status(thm),[c4]) ).

cnf(c30,plain,
    singleton(X25) = unordered_pair(X25,X25),
    inference(resolution,status(thm),[c5,symmetry]) ).

cnf(c31,plain,
    ( X66 != singleton(X65)
    | X66 = unordered_pair(X65,X65) ),
    inference(resolution,status(thm),[c30,transitivity]) ).

cnf(c1,plain,
    ( X39 != X40
    | singleton(X39) = singleton(X40) ),
    eq_axiom ).

cnf(c10,negated_conjecture,
    subset(unordered_pair(skolem0001,skolem0002),singleton(skolem0003)),
    inference(split_conjunct,status(thm),[c9]) ).

fof(t26_zfmisc_1,axiom,
    ! [A,B,C] :
      ( subset(unordered_pair(A,B),singleton(C))
     => A = C ),
    input ).

fof(c12,axiom,
    ! [A,B,C] :
      ( ~ subset(unordered_pair(A,B),singleton(C))
      | A = C ),
    inference(fof_nnf,status(thm),[t26_zfmisc_1]) ).

fof(c13,axiom,
    ! [X6,X7,X8] :
      ( ~ subset(unordered_pair(X6,X7),singleton(X8))
      | X6 = X8 ),
    inference(variable_rename,status(thm),[c12]) ).

cnf(c14,axiom,
    ( ~ subset(unordered_pair(X59,X58),singleton(X57))
    | X59 = X57 ),
    inference(split_conjunct,status(thm),[c13]) ).

cnf(c60,plain,
    skolem0001 = skolem0003,
    inference(resolution,status(thm),[c14,c10]) ).

cnf(c61,plain,
    skolem0003 = skolem0001,
    inference(resolution,status(thm),[c60,symmetry]) ).

cnf(c71,plain,
    singleton(skolem0003) = singleton(skolem0001),
    inference(resolution,status(thm),[c61,c1]) ).

cnf(c118,plain,
    singleton(skolem0003) = unordered_pair(skolem0001,skolem0001),
    inference(resolution,status(thm),[c71,c31]) ).

cnf(c158,plain,
    unordered_pair(skolem0001,skolem0001) = singleton(skolem0003),
    inference(resolution,status(thm),[c118,symmetry]) ).

cnf(c236,plain,
    ( X461 != unordered_pair(skolem0001,skolem0001)
    | X461 = singleton(skolem0003) ),
    inference(resolution,status(thm),[c158,transitivity]) ).

fof(commutativity_k2_tarski,axiom,
    ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
    input ).

fof(c25,axiom,
    ! [X12,X13] : unordered_pair(X12,X13) = unordered_pair(X13,X12),
    inference(variable_rename,status(thm),[commutativity_k2_tarski]) ).

cnf(c26,axiom,
    unordered_pair(X34,X35) = unordered_pair(X35,X34),
    inference(split_conjunct,status(thm),[c25]) ).

cnf(c39,plain,
    ( X87 != unordered_pair(X86,X85)
    | X87 = unordered_pair(X85,X86) ),
    inference(resolution,status(thm),[c26,transitivity]) ).

cnf(reflexivity,axiom,
    X14 = X14,
    eq_axiom ).

cnf(c0,plain,
    ( X29 != X30
    | X27 != X28
    | unordered_pair(X29,X27) = unordered_pair(X30,X28) ),
    eq_axiom ).

cnf(c35,plain,
    ( X81 != X83
    | unordered_pair(X81,X82) = unordered_pair(X83,X82) ),
    inference(resolution,status(thm),[c0,reflexivity]) ).

cnf(c69,plain,
    ( X79 != skolem0003
    | X79 = skolem0001 ),
    inference(resolution,status(thm),[c61,transitivity]) ).

cnf(c3,plain,
    ( X47 != X48
    | X45 != X46
    | ~ subset(X47,X45)
    | subset(X48,X46) ),
    eq_axiom ).

cnf(c48,plain,
    ( unordered_pair(skolem0001,skolem0002) != X107
    | singleton(skolem0003) != X108
    | subset(X107,X108) ),
    inference(resolution,status(thm),[c3,c10]) ).

cnf(c285,plain,
    ( singleton(skolem0003) != X531
    | subset(unordered_pair(skolem0002,skolem0001),X531) ),
    inference(resolution,status(thm),[c48,c26]) ).

cnf(c3326,plain,
    subset(unordered_pair(skolem0002,skolem0001),singleton(skolem0003)),
    inference(resolution,status(thm),[c285,reflexivity]) ).

cnf(c3332,plain,
    skolem0002 = skolem0003,
    inference(resolution,status(thm),[c3326,c14]) ).

cnf(c3343,plain,
    skolem0002 = skolem0001,
    inference(resolution,status(thm),[c3332,c69]) ).

cnf(c3397,plain,
    skolem0001 = skolem0002,
    inference(resolution,status(thm),[c3343,symmetry]) ).

cnf(c3482,plain,
    unordered_pair(skolem0001,X573) = unordered_pair(skolem0002,X573),
    inference(resolution,status(thm),[c3397,c35]) ).

cnf(c4281,plain,
    unordered_pair(skolem0001,X619) = unordered_pair(X619,skolem0002),
    inference(resolution,status(thm),[c3482,c39]) ).

cnf(c5367,plain,
    unordered_pair(X675,skolem0002) = unordered_pair(skolem0001,X675),
    inference(resolution,status(thm),[c4281,symmetry]) ).

cnf(c6732,plain,
    unordered_pair(skolem0001,skolem0002) = singleton(skolem0003),
    inference(resolution,status(thm),[c5367,c236]) ).

cnf(c8443,plain,
    $false,
    inference(resolution,status(thm),[c6732,c11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 08:38:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.77/3.96  # Version:  1.3
% 3.77/3.96  # SZS status Theorem
% 3.77/3.96  # SZS output start CNFRefutation
% See solution above
% 3.77/3.96  
% 3.77/3.96  # Initial clauses    : 15
% 3.77/3.96  # Processed clauses  : 469
% 3.77/3.96  # Factors computed   : 0
% 3.77/3.96  # Resolvents computed: 8452
% 3.77/3.96  # Tautologies deleted: 2
% 3.77/3.96  # Forward subsumed   : 664
% 3.77/3.96  # Backward subsumed  : 0
% 3.77/3.96  # -------- CPU Time ---------
% 3.77/3.96  # User time          : 3.586 s
% 3.77/3.96  # System time        : 0.034 s
% 3.77/3.96  # Total time         : 3.620 s
%------------------------------------------------------------------------------