TSTP Solution File: SET024+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET024+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:21:40 EDT 2023

% Result   : Theorem 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   33 (  10 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   32 (  13   ~;  11   |;   5   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   2 sgn;  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(set_in_its_singleton,conjecture,
    ! [X1] :
      ( member(X1,universal_class)
     => member(X1,singleton(X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.C5Oiula3nI/E---3.1_1662.p',set_in_its_singleton) ).

fof(singleton_set_defn,axiom,
    ! [X1] : singleton(X1) = unordered_pair(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.C5Oiula3nI/E---3.1_1662.p',singleton_set_defn) ).

fof(unordered_pair_defn,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( member(X3,universal_class)
        & ( X3 = X1
          | X3 = X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C5Oiula3nI/E---3.1_1662.p',unordered_pair_defn) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( member(X1,universal_class)
       => member(X1,singleton(X1)) ),
    inference(assume_negation,[status(cth)],[set_in_its_singleton]) ).

fof(c_0_4,negated_conjecture,
    ( member(esk8_0,universal_class)
    & ~ member(esk8_0,singleton(esk8_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X24] : singleton(X24) = unordered_pair(X24,X24),
    inference(variable_rename,[status(thm)],[singleton_set_defn]) ).

fof(c_0_6,plain,
    ! [X19,X20,X21] :
      ( ( member(X19,universal_class)
        | ~ member(X19,unordered_pair(X20,X21)) )
      & ( X19 = X20
        | X19 = X21
        | ~ member(X19,unordered_pair(X20,X21)) )
      & ( X19 != X20
        | ~ member(X19,universal_class)
        | member(X19,unordered_pair(X20,X21)) )
      & ( X19 != X21
        | ~ member(X19,universal_class)
        | member(X19,unordered_pair(X20,X21)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ member(esk8_0,singleton(esk8_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    singleton(X1) = unordered_pair(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( member(X1,unordered_pair(X3,X2))
    | X1 != X2
    | ~ member(X1,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ member(esk8_0,unordered_pair(esk8_0,esk8_0)),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( member(X1,unordered_pair(X2,X1))
    | ~ member(X1,universal_class) ),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    member(esk8_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SET024+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n016.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 17:29:36 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.15/0.41  Running first-order model finding
% 0.15/0.41  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.C5Oiula3nI/E---3.1_1662.p
% 0.15/0.43  # Version: 3.1pre001
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1744 completed with status 0
% 0.15/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # No SInE strategy applied
% 0.15/0.43  # Search class: FGHSM-FFMM21-DFFFFFNN
% 0.15/0.43  # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.15/0.43  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.43  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.15/0.43  # G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 1761 completed with status 0
% 0.15/0.43  # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # No SInE strategy applied
% 0.15/0.43  # Search class: FGHSM-FFMM21-DFFFFFNN
% 0.15/0.43  # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.15/0.43  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.43  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.002 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Theorem
% 0.15/0.43  # SZS output start CNFRefutation
% See solution above
% 0.15/0.43  # Parsed axioms                        : 44
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.43  # Initial clauses                      : 91
% 0.15/0.43  # Removed in clause preprocessing      : 8
% 0.15/0.43  # Initial clauses in saturation        : 83
% 0.15/0.43  # Processed clauses                    : 114
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 114
% 0.15/0.43  # Other redundant clauses eliminated   : 6
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 0
% 0.15/0.43  # Generated clauses                    : 9
% 0.15/0.43  # ...of the previous two non-redundant : 6
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 0
% 0.15/0.43  # Paramodulations                      : 3
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 6
% 0.15/0.43  # Total rewrite steps                  : 2
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 26
% 0.15/0.43  #    Positive orientable unit clauses  : 10
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 2
% 0.15/0.43  #    Non-unit-clauses                  : 14
% 0.15/0.43  # Current number of unprocessed clauses: 57
% 0.15/0.43  # ...number of literals in the above   : 132
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 90
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 965
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 870
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  # Unit Clause-clause subsumption calls : 2
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 2
% 0.15/0.43  # BW rewrite match successes           : 0
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 6507
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.011 s
% 0.15/0.43  # System time              : 0.002 s
% 0.15/0.43  # Total time               : 0.013 s
% 0.15/0.43  # Maximum resident set size: 2048 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.040 s
% 0.15/0.43  # System time              : 0.010 s
% 0.15/0.43  # Total time               : 0.050 s
% 0.15/0.43  # Maximum resident set size: 1728 pages
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------