TSTP Solution File: SET583+3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET583+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.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:23:00 EDT 2023

% Result   : Theorem 0.16s 0.41s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   26 (   9 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   25 (   9   ~;   6   |;   7   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_extensionality,conjecture,
    ! [X1,X2] :
      ( ( subset(X1,X2)
        & subset(X2,X1) )
     => X1 = X2 ),
    file('/export/starexec/sandbox/tmp/tmp.UvyNzy9sRo/E---3.1_8305.p',prove_extensionality) ).

fof(equal_defn,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.UvyNzy9sRo/E---3.1_8305.p',equal_defn) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( subset(X1,X2)
          & subset(X2,X1) )
       => X1 = X2 ),
    inference(assume_negation,[status(cth)],[prove_extensionality]) ).

fof(c_0_3,plain,
    ! [X6,X7] :
      ( ( subset(X6,X7)
        | X6 != X7 )
      & ( subset(X7,X6)
        | X6 != X7 )
      & ( ~ subset(X6,X7)
        | ~ subset(X7,X6)
        | X6 = X7 ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).

fof(c_0_4,negated_conjecture,
    ( subset(esk1_0,esk2_0)
    & subset(esk2_0,esk1_0)
    & esk1_0 != esk2_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( X1 = X2
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    subset(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    subset(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    esk1_0 != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SET583+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 2400
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Mon Oct  2 16:26:19 EDT 2023
% 0.11/0.31  % CPUTime    : 
% 0.16/0.40  Running first-order model finding
% 0.16/0.40  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.UvyNzy9sRo/E---3.1_8305.p
% 0.16/0.41  # Version: 3.1pre001
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41  # Starting sh5l with 300s (1) cores
% 0.16/0.41  # new_bool_3 with pid 8384 completed with status 0
% 0.16/0.41  # Result found by new_bool_3
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.41  # Search class: FHUSF-FFSF00-SFFFFFNN
% 0.16/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41  # SAT001_MinMin_p005000_rr_RG with pid 8387 completed with status 0
% 0.16/0.41  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.41  # Search class: FHUSF-FFSF00-SFFFFFNN
% 0.16/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41  # Preprocessing time       : 0.001 s
% 0.16/0.41  # Presaturation interreduction done
% 0.16/0.41  
% 0.16/0.41  # Proof found!
% 0.16/0.41  # SZS status Theorem
% 0.16/0.41  # SZS output start CNFRefutation
% See solution above
% 0.16/0.41  # Parsed axioms                        : 4
% 0.16/0.41  # Removed by relevancy pruning/SinE    : 1
% 0.16/0.41  # Initial clauses                      : 7
% 0.16/0.41  # Removed in clause preprocessing      : 0
% 0.16/0.41  # Initial clauses in saturation        : 7
% 0.16/0.41  # Processed clauses                    : 12
% 0.16/0.41  # ...of these trivial                  : 0
% 0.16/0.41  # ...subsumed                          : 0
% 0.16/0.41  # ...remaining for further processing  : 12
% 0.16/0.41  # Other redundant clauses eliminated   : 2
% 0.16/0.41  # Clauses deleted for lack of memory   : 0
% 0.16/0.41  # Backward-subsumed                    : 0
% 0.16/0.41  # Backward-rewritten                   : 0
% 0.16/0.41  # Generated clauses                    : 4
% 0.16/0.41  # ...of the previous two non-redundant : 0
% 0.16/0.41  # ...aggressively subsumed             : 0
% 0.16/0.41  # Contextual simplify-reflections      : 0
% 0.16/0.41  # Paramodulations                      : 2
% 0.16/0.41  # Factorizations                       : 0
% 0.16/0.41  # NegExts                              : 0
% 0.16/0.41  # Equation resolutions                 : 2
% 0.16/0.41  # Total rewrite steps                  : 3
% 0.16/0.41  # Propositional unsat checks           : 0
% 0.16/0.41  #    Propositional check models        : 0
% 0.16/0.41  #    Propositional check unsatisfiable : 0
% 0.16/0.41  #    Propositional clauses             : 0
% 0.16/0.41  #    Propositional clauses after purity: 0
% 0.16/0.41  #    Propositional unsat core size     : 0
% 0.16/0.41  #    Propositional preprocessing time  : 0.000
% 0.16/0.41  #    Propositional encoding time       : 0.000
% 0.16/0.41  #    Propositional solver time         : 0.000
% 0.16/0.41  #    Success case prop preproc time    : 0.000
% 0.16/0.41  #    Success case prop encoding time   : 0.000
% 0.16/0.41  #    Success case prop solver time     : 0.000
% 0.16/0.41  # Current number of processed clauses  : 5
% 0.16/0.41  #    Positive orientable unit clauses  : 3
% 0.16/0.41  #    Positive unorientable unit clauses: 0
% 0.16/0.41  #    Negative unit clauses             : 1
% 0.16/0.41  #    Non-unit-clauses                  : 1
% 0.16/0.41  # Current number of unprocessed clauses: 0
% 0.16/0.41  # ...number of literals in the above   : 0
% 0.16/0.41  # Current number of archived formulas  : 0
% 0.16/0.41  # Current number of archived clauses   : 5
% 0.16/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.41  # Unit Clause-clause subsumption calls : 0
% 0.16/0.41  # Rewrite failures with RHS unbound    : 0
% 0.16/0.41  # BW rewrite match attempts            : 2
% 0.16/0.41  # BW rewrite match successes           : 0
% 0.16/0.41  # Condensation attempts                : 0
% 0.16/0.41  # Condensation successes               : 0
% 0.16/0.41  # Termbank termtop insertions          : 253
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.001 s
% 0.16/0.41  # System time              : 0.002 s
% 0.16/0.41  # Total time               : 0.003 s
% 0.16/0.41  # Maximum resident set size: 1768 pages
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.001 s
% 0.16/0.41  # System time              : 0.004 s
% 0.16/0.41  # Total time               : 0.005 s
% 0.16/0.41  # Maximum resident set size: 1672 pages
% 0.16/0.41  % E---3.1 exiting
%------------------------------------------------------------------------------