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

View Problem - Process Solution

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

% Computer : n027.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:04 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_self_difference_is_empty_set,conjecture,
    ! [X1] : difference(X1,X1) = empty_set,
    file('/export/starexec/sandbox2/tmp/tmp.FuURx6eLpb/E---3.1_10341.p',prove_self_difference_is_empty_set) ).

fof(difference_empty_set,axiom,
    ! [X1,X2] :
      ( difference(X1,X2) = empty_set
    <=> subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.FuURx6eLpb/E---3.1_10341.p',difference_empty_set) ).

fof(reflexivity_of_subset,axiom,
    ! [X1] : subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.FuURx6eLpb/E---3.1_10341.p',reflexivity_of_subset) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] : difference(X1,X1) = empty_set,
    inference(assume_negation,[status(cth)],[prove_self_difference_is_empty_set]) ).

fof(c_0_4,negated_conjecture,
    difference(esk1_0,esk1_0) != empty_set,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X5,X6] :
      ( ( difference(X5,X6) != empty_set
        | subset(X5,X6) )
      & ( ~ subset(X5,X6)
        | difference(X5,X6) = empty_set ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_empty_set])]) ).

fof(c_0_6,plain,
    ! [X19] : subset(X19,X19),
    inference(variable_rename,[status(thm)],[reflexivity_of_subset]) ).

cnf(c_0_7,negated_conjecture,
    difference(esk1_0,esk1_0) != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

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