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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

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

% Result   : Theorem 0.16s 0.49s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   33 (  18 unt;   0 def)
%            Number of atoms       :  131 (  21 equ)
%            Maximal formula atoms :   52 (   3 avg)
%            Number of connectives :  166 (  68   ~;  72   |;  18   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   37 (   0 sgn;  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSub,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aSubsetOf0(X2,X1)
        <=> ( aSet0(X2)
            & ! [X3] :
                ( aElementOf0(X3,X2)
               => aElementOf0(X3,X1) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',mDefSub) ).

fof(mDefDiff,axiom,
    ! [X1,X2] :
      ( ( aSet0(X1)
        & aElement0(X2) )
     => ! [X3] :
          ( X3 = sdtmndt0(X1,X2)
        <=> ( aSet0(X3)
            & ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( aElement0(X4)
                  & aElementOf0(X4,X1)
                  & X4 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',mDefDiff) ).

fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',mEOfElem) ).

fof(m__5106,hypothesis,
    aSubsetOf0(xQ,szNzAzT0),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__5106) ).

fof(mNATSet,axiom,
    ( aSet0(szNzAzT0)
    & isCountable0(szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',mNATSet) ).

fof(m__5164,hypothesis,
    ( aSet0(xP)
    & xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__5164) ).

fof(m__5147,hypothesis,
    xp = szmzizndt0(xQ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__5147) ).

fof(m__5173,hypothesis,
    aElementOf0(xp,xQ),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__5173) ).

fof(m__5348,hypothesis,
    aElementOf0(xx,xP),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__5348) ).

fof(m__,conjecture,
    aElementOf0(xx,szNzAzT0),
    file('/export/starexec/sandbox/tmp/tmp.C2fbfpLJ50/E---3.1_16058.p',m__) ).

fof(c_0_10,plain,
    ! [X15,X16,X17,X18] :
      ( ( aSet0(X16)
        | ~ aSubsetOf0(X16,X15)
        | ~ aSet0(X15) )
      & ( ~ aElementOf0(X17,X16)
        | aElementOf0(X17,X15)
        | ~ aSubsetOf0(X16,X15)
        | ~ aSet0(X15) )
      & ( aElementOf0(esk2_2(X15,X18),X18)
        | ~ aSet0(X18)
        | aSubsetOf0(X18,X15)
        | ~ aSet0(X15) )
      & ( ~ aElementOf0(esk2_2(X15,X18),X15)
        | ~ aSet0(X18)
        | aSubsetOf0(X18,X15)
        | ~ aSet0(X15) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])]) ).

fof(c_0_11,plain,
    ! [X35,X36,X37,X38,X39,X40] :
      ( ( aSet0(X37)
        | X37 != sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( aElement0(X38)
        | ~ aElementOf0(X38,X37)
        | X37 != sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( aElementOf0(X38,X35)
        | ~ aElementOf0(X38,X37)
        | X37 != sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( X38 != X36
        | ~ aElementOf0(X38,X37)
        | X37 != sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( ~ aElement0(X39)
        | ~ aElementOf0(X39,X35)
        | X39 = X36
        | aElementOf0(X39,X37)
        | X37 != sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( ~ aElementOf0(esk4_3(X35,X36,X40),X40)
        | ~ aElement0(esk4_3(X35,X36,X40))
        | ~ aElementOf0(esk4_3(X35,X36,X40),X35)
        | esk4_3(X35,X36,X40) = X36
        | ~ aSet0(X40)
        | X40 = sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( aElement0(esk4_3(X35,X36,X40))
        | aElementOf0(esk4_3(X35,X36,X40),X40)
        | ~ aSet0(X40)
        | X40 = sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( aElementOf0(esk4_3(X35,X36,X40),X35)
        | aElementOf0(esk4_3(X35,X36,X40),X40)
        | ~ aSet0(X40)
        | X40 = sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) )
      & ( esk4_3(X35,X36,X40) != X36
        | aElementOf0(esk4_3(X35,X36,X40),X40)
        | ~ aSet0(X40)
        | X40 = sdtmndt0(X35,X36)
        | ~ aSet0(X35)
        | ~ aElement0(X36) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])])]) ).

fof(c_0_12,plain,
    ! [X7,X8] :
      ( ~ aSet0(X7)
      | ~ aElementOf0(X8,X7)
      | aElement0(X8) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).

cnf(c_0_13,plain,
    ( aSet0(X1)
    | ~ aSubsetOf0(X1,X2)
    | ~ aSet0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,hypothesis,
    aSubsetOf0(xQ,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5106]) ).

cnf(c_0_15,plain,
    aSet0(szNzAzT0),
    inference(split_conjunct,[status(thm)],[mNATSet]) ).

cnf(c_0_16,plain,
    ( aElementOf0(X1,X2)
    | ~ aElementOf0(X1,X3)
    | X3 != sdtmndt0(X2,X4)
    | ~ aSet0(X2)
    | ~ aElement0(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    xP = sdtmndt0(xQ,szmzizndt0(xQ)),
    inference(split_conjunct,[status(thm)],[m__5164]) ).

cnf(c_0_18,hypothesis,
    xp = szmzizndt0(xQ),
    inference(split_conjunct,[status(thm)],[m__5147]) ).

cnf(c_0_19,plain,
    ( aElement0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,hypothesis,
    aElementOf0(xp,xQ),
    inference(split_conjunct,[status(thm)],[m__5173]) ).

cnf(c_0_21,hypothesis,
    aSet0(xQ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_22,plain,
    ( aElementOf0(X1,X2)
    | ~ aElementOf0(X1,sdtmndt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aSet0(X2) ),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_23,hypothesis,
    sdtmndt0(xQ,xp) = xP,
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,hypothesis,
    aElement0(xp),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_25,plain,
    ( aElementOf0(X1,X3)
    | ~ aElementOf0(X1,X2)
    | ~ aSubsetOf0(X2,X3)
    | ~ aSet0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_21])]) ).

cnf(c_0_27,hypothesis,
    aElementOf0(xx,xP),
    inference(split_conjunct,[status(thm)],[m__5348]) ).

fof(c_0_28,negated_conjecture,
    ~ aElementOf0(xx,szNzAzT0),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_29,hypothesis,
    ( aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X1,xQ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_15])]) ).

cnf(c_0_30,hypothesis,
    aElementOf0(xx,xQ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ~ aElementOf0(xx,szNzAzT0),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_32,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n007.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 13:13:39 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.44  Running first-order model finding
% 0.16/0.44  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.C2fbfpLJ50/E---3.1_16058.p
% 0.16/0.49  # Version: 3.1pre001
% 0.16/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49  # Starting sh5l with 300s (1) cores
% 0.16/0.49  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16135 completed with status 0
% 0.16/0.49  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.49  # No SInE strategy applied
% 0.16/0.49  # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/0.49  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.16/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.16/0.49  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16142 completed with status 0
% 0.16/0.49  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.49  # No SInE strategy applied
% 0.16/0.49  # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.49  # Preprocessing time       : 0.003 s
% 0.16/0.49  # Presaturation interreduction done
% 0.16/0.49  
% 0.16/0.49  # Proof found!
% 0.16/0.49  # SZS status Theorem
% 0.16/0.49  # SZS output start CNFRefutation
% See solution above
% 0.16/0.49  # Parsed axioms                        : 114
% 0.16/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.49  # Initial clauses                      : 220
% 0.16/0.49  # Removed in clause preprocessing      : 7
% 0.16/0.49  # Initial clauses in saturation        : 213
% 0.16/0.49  # Processed clauses                    : 409
% 0.16/0.49  # ...of these trivial                  : 2
% 0.16/0.49  # ...subsumed                          : 4
% 0.16/0.49  # ...remaining for further processing  : 403
% 0.16/0.49  # Other redundant clauses eliminated   : 48
% 0.16/0.49  # Clauses deleted for lack of memory   : 0
% 0.16/0.49  # Backward-subsumed                    : 5
% 0.16/0.49  # Backward-rewritten                   : 1
% 0.16/0.49  # Generated clauses                    : 188
% 0.16/0.49  # ...of the previous two non-redundant : 136
% 0.16/0.49  # ...aggressively subsumed             : 0
% 0.16/0.49  # Contextual simplify-reflections      : 16
% 0.16/0.49  # Paramodulations                      : 144
% 0.16/0.49  # Factorizations                       : 0
% 0.16/0.49  # NegExts                              : 0
% 0.16/0.49  # Equation resolutions                 : 49
% 0.16/0.49  # Total rewrite steps                  : 169
% 0.16/0.49  # Propositional unsat checks           : 0
% 0.16/0.49  #    Propositional check models        : 0
% 0.16/0.49  #    Propositional check unsatisfiable : 0
% 0.16/0.49  #    Propositional clauses             : 0
% 0.16/0.49  #    Propositional clauses after purity: 0
% 0.16/0.49  #    Propositional unsat core size     : 0
% 0.16/0.49  #    Propositional preprocessing time  : 0.000
% 0.16/0.49  #    Propositional encoding time       : 0.000
% 0.16/0.49  #    Propositional solver time         : 0.000
% 0.16/0.49  #    Success case prop preproc time    : 0.000
% 0.16/0.49  #    Success case prop encoding time   : 0.000
% 0.16/0.49  #    Success case prop solver time     : 0.000
% 0.16/0.49  # Current number of processed clauses  : 146
% 0.16/0.49  #    Positive orientable unit clauses  : 70
% 0.16/0.49  #    Positive unorientable unit clauses: 0
% 0.16/0.49  #    Negative unit clauses             : 14
% 0.16/0.49  #    Non-unit-clauses                  : 62
% 0.16/0.49  # Current number of unprocessed clauses: 146
% 0.16/0.49  # ...number of literals in the above   : 606
% 0.16/0.49  # Current number of archived formulas  : 0
% 0.16/0.49  # Current number of archived clauses   : 217
% 0.16/0.49  # Clause-clause subsumption calls (NU) : 7896
% 0.16/0.49  # Rec. Clause-clause subsumption calls : 1917
% 0.16/0.49  # Non-unit clause-clause subsumptions  : 16
% 0.16/0.49  # Unit Clause-clause subsumption calls : 408
% 0.16/0.49  # Rewrite failures with RHS unbound    : 0
% 0.16/0.49  # BW rewrite match attempts            : 1
% 0.16/0.49  # BW rewrite match successes           : 1
% 0.16/0.49  # Condensation attempts                : 0
% 0.16/0.49  # Condensation successes               : 0
% 0.16/0.49  # Termbank termtop insertions          : 18059
% 0.16/0.49  
% 0.16/0.49  # -------------------------------------------------
% 0.16/0.49  # User time                : 0.033 s
% 0.16/0.49  # System time              : 0.005 s
% 0.16/0.49  # Total time               : 0.038 s
% 0.16/0.49  # Maximum resident set size: 2472 pages
% 0.16/0.49  
% 0.16/0.49  # -------------------------------------------------
% 0.16/0.49  # User time                : 0.138 s
% 0.16/0.49  # System time              : 0.015 s
% 0.16/0.49  # Total time               : 0.153 s
% 0.16/0.49  # Maximum resident set size: 1824 pages
% 0.16/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------