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

View Problem - Process Solution

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

% Computer : n008.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:59 EDT 2023

% Result   : Theorem 0.14s 0.42s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  12 unt;   0 def)
%            Number of atoms       :   12 (   3 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 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   :   11 (   2 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(singletons_are_sets,conjecture,
    ! [X1] : member(singleton(X1),universal_class),
    file('/export/starexec/sandbox2/tmp/tmp.fgv4eYwGbS/E---3.1_15455.p',singletons_are_sets) ).

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

fof(unordered_pair,axiom,
    ! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
    file('/export/starexec/sandbox2/tmp/tmp.fgv4eYwGbS/E---3.1_15455.p',unordered_pair) ).

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

fof(c_0_4,negated_conjecture,
    ~ member(singleton(esk8_0),universal_class),
    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]) ).

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

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

fof(c_0_8,plain,
    ! [X22,X23] : member(unordered_pair(X22,X23),universal_class),
    inference(variable_rename,[status(thm)],[unordered_pair]) ).

cnf(c_0_9,negated_conjecture,
    ~ member(unordered_pair(esk8_0,esk8_0),universal_class),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    member(unordered_pair(X1,X2),universal_class),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SET077+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n008.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Oct  2 17:35:58 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.14/0.41  Running first-order model finding
% 0.14/0.41  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.fgv4eYwGbS/E---3.1_15455.p
% 0.14/0.42  # Version: 3.1pre001
% 0.14/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42  # Starting sh5l with 300s (1) cores
% 0.14/0.42  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15532 completed with status 0
% 0.14/0.42  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42  # No SInE strategy applied
% 0.14/0.42  # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.14/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  # Starting new_ho_10 with 271s (1) cores
% 0.14/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42  # Starting ho_unfolding_3 with 271s (1) cores
% 0.14/0.42  # Starting new_ho_10_cnf2 with 271s (1) cores
% 0.14/0.42  # Starting pre_casc_2 with 271s (1) cores
% 0.14/0.42  # new_ho_10 with pid 15544 completed with status 0
% 0.14/0.42  # Result found by new_ho_10
% 0.14/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42  # No SInE strategy applied
% 0.14/0.42  # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.14/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  # Starting new_ho_10 with 271s (1) cores
% 0.14/0.42  # Preprocessing time       : 0.002 s
% 0.14/0.42  # Presaturation interreduction done
% 0.14/0.42  
% 0.14/0.42  # Proof found!
% 0.14/0.42  # SZS status Theorem
% 0.14/0.42  # SZS output start CNFRefutation
% See solution above
% 0.14/0.42  # Parsed axioms                        : 44
% 0.14/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.14/0.42  # Initial clauses                      : 90
% 0.14/0.42  # Removed in clause preprocessing      : 8
% 0.14/0.42  # Initial clauses in saturation        : 82
% 0.14/0.42  # Processed clauses                    : 7
% 0.14/0.42  # ...of these trivial                  : 0
% 0.14/0.42  # ...subsumed                          : 0
% 0.14/0.42  # ...remaining for further processing  : 7
% 0.14/0.42  # Other redundant clauses eliminated   : 0
% 0.14/0.42  # Clauses deleted for lack of memory   : 0
% 0.14/0.42  # Backward-subsumed                    : 0
% 0.14/0.42  # Backward-rewritten                   : 1
% 0.14/0.42  # Generated clauses                    : 0
% 0.14/0.42  # ...of the previous two non-redundant : 0
% 0.14/0.42  # ...aggressively subsumed             : 0
% 0.14/0.42  # Contextual simplify-reflections      : 0
% 0.14/0.42  # Paramodulations                      : 0
% 0.14/0.42  # Factorizations                       : 0
% 0.14/0.42  # NegExts                              : 0
% 0.14/0.42  # Equation resolutions                 : 0
% 0.14/0.42  # Total rewrite steps                  : 1
% 0.14/0.42  # Propositional unsat checks           : 0
% 0.14/0.42  #    Propositional check models        : 0
% 0.14/0.42  #    Propositional check unsatisfiable : 0
% 0.14/0.42  #    Propositional clauses             : 0
% 0.14/0.42  #    Propositional clauses after purity: 0
% 0.14/0.42  #    Propositional unsat core size     : 0
% 0.14/0.42  #    Propositional preprocessing time  : 0.000
% 0.14/0.42  #    Propositional encoding time       : 0.000
% 0.14/0.42  #    Propositional solver time         : 0.000
% 0.14/0.42  #    Success case prop preproc time    : 0.000
% 0.14/0.42  #    Success case prop encoding time   : 0.000
% 0.14/0.42  #    Success case prop solver time     : 0.000
% 0.14/0.42  # Current number of processed clauses  : 6
% 0.14/0.42  #    Positive orientable unit clauses  : 5
% 0.14/0.42  #    Positive unorientable unit clauses: 0
% 0.14/0.42  #    Negative unit clauses             : 1
% 0.14/0.42  #    Non-unit-clauses                  : 0
% 0.14/0.42  # Current number of unprocessed clauses: 75
% 0.14/0.42  # ...number of literals in the above   : 171
% 0.14/0.42  # Current number of archived formulas  : 0
% 0.14/0.42  # Current number of archived clauses   : 9
% 0.14/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.14/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.14/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.14/0.42  # Unit Clause-clause subsumption calls : 0
% 0.14/0.42  # Rewrite failures with RHS unbound    : 0
% 0.14/0.42  # BW rewrite match attempts            : 1
% 0.14/0.42  # BW rewrite match successes           : 1
% 0.14/0.42  # Condensation attempts                : 7
% 0.14/0.42  # Condensation successes               : 0
% 0.14/0.42  # Termbank termtop insertions          : 4873
% 0.14/0.42  
% 0.14/0.42  # -------------------------------------------------
% 0.14/0.42  # User time                : 0.007 s
% 0.14/0.42  # System time              : 0.002 s
% 0.14/0.42  # Total time               : 0.009 s
% 0.14/0.42  # Maximum resident set size: 2024 pages
% 0.14/0.42  
% 0.14/0.42  # -------------------------------------------------
% 0.14/0.42  # User time                : 0.014 s
% 0.14/0.42  # System time              : 0.009 s
% 0.14/0.42  # Total time               : 0.022 s
% 0.14/0.42  # Maximum resident set size: 1724 pages
% 0.14/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------