TSTP Solution File: NUM582+1 by E---3.1

View Problem - Process Solution

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

% Computer : n025.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 18:56:28 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__3754,hypothesis,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( sdtlseqdt0(X2,X1)
       => aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',m__3754) ).

fof(m__3623,hypothesis,
    ( aFunction0(xN)
    & szDzozmdt0(xN) = szNzAzT0
    & sdtlpdtrp0(xN,sz00) = xS
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
            & isCountable0(sdtlpdtrp0(xN,X1)) )
         => ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
            & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',m__3623) ).

fof(mZeroLess,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => sdtlseqdt0(sz00,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',mZeroLess) ).

fof(m__,conjecture,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',m__) ).

fof(mZeroNum,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',mZeroNum) ).

fof(m__3989,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p',m__3989) ).

fof(c_0_6,hypothesis,
    ! [X176,X177] :
      ( ~ aElementOf0(X176,szNzAzT0)
      | ~ aElementOf0(X177,szNzAzT0)
      | ~ sdtlseqdt0(X177,X176)
      | aSubsetOf0(sdtlpdtrp0(xN,X176),sdtlpdtrp0(xN,X177)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])]) ).

fof(c_0_7,hypothesis,
    ! [X174] :
      ( aFunction0(xN)
      & szDzozmdt0(xN) = szNzAzT0
      & sdtlpdtrp0(xN,sz00) = xS
      & ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X174)),sdtmndt0(sdtlpdtrp0(xN,X174),szmzizndt0(sdtlpdtrp0(xN,X174))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X174))
        | ~ aElementOf0(X174,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X174)))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X174))
        | ~ aElementOf0(X174,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])]) ).

fof(c_0_8,plain,
    ! [X60] :
      ( ~ aElementOf0(X60,szNzAzT0)
      | sdtlseqdt0(sz00,X60) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).

fof(c_0_9,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_10,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ sdtlseqdt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(split_conjunct,[status(thm)],[mZeroNum]) ).

cnf(c_0_13,plain,
    ( sdtlseqdt0(sz00,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).

cnf(c_0_16,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3989]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM582+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n025.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 14:36:21 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.16/0.44  Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2PJmOza77L/E---3.1_18969.p
% 0.16/0.47  # Version: 3.1pre001
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47  # Starting sh5l with 300s (1) cores
% 0.16/0.47  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19057 completed with status 0
% 0.16/0.47  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # No SInE strategy applied
% 0.16/0.47  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.16/0.47  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.16/0.47  # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.16/0.47  # Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.16/0.47  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 151s (1) cores
% 0.16/0.47  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 146s (1) cores
% 0.16/0.47  # G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 19062 completed with status 0
% 0.16/0.47  # Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # No SInE strategy applied
% 0.16/0.47  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.16/0.47  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.16/0.47  # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.16/0.47  # Preprocessing time       : 0.003 s
% 0.16/0.47  
% 0.16/0.47  # Proof found!
% 0.16/0.47  # SZS status Theorem
% 0.16/0.47  # SZS output start CNFRefutation
% See solution above
% 0.16/0.47  # Parsed axioms                        : 88
% 0.16/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.47  # Initial clauses                      : 173
% 0.16/0.47  # Removed in clause preprocessing      : 7
% 0.16/0.47  # Initial clauses in saturation        : 166
% 0.16/0.47  # Processed clauses                    : 210
% 0.16/0.47  # ...of these trivial                  : 1
% 0.16/0.47  # ...subsumed                          : 34
% 0.16/0.47  # ...remaining for further processing  : 175
% 0.16/0.47  # Other redundant clauses eliminated   : 20
% 0.16/0.47  # Clauses deleted for lack of memory   : 0
% 0.16/0.47  # Backward-subsumed                    : 4
% 0.16/0.47  # Backward-rewritten                   : 2
% 0.16/0.47  # Generated clauses                    : 246
% 0.16/0.47  # ...of the previous two non-redundant : 191
% 0.16/0.47  # ...aggressively subsumed             : 0
% 0.16/0.47  # Contextual simplify-reflections      : 16
% 0.16/0.47  # Paramodulations                      : 227
% 0.16/0.47  # Factorizations                       : 0
% 0.16/0.47  # NegExts                              : 0
% 0.16/0.47  # Equation resolutions                 : 21
% 0.16/0.47  # Total rewrite steps                  : 170
% 0.16/0.47  # Propositional unsat checks           : 0
% 0.16/0.47  #    Propositional check models        : 0
% 0.16/0.47  #    Propositional check unsatisfiable : 0
% 0.16/0.47  #    Propositional clauses             : 0
% 0.16/0.47  #    Propositional clauses after purity: 0
% 0.16/0.47  #    Propositional unsat core size     : 0
% 0.16/0.47  #    Propositional preprocessing time  : 0.000
% 0.16/0.47  #    Propositional encoding time       : 0.000
% 0.16/0.47  #    Propositional solver time         : 0.000
% 0.16/0.47  #    Success case prop preproc time    : 0.000
% 0.16/0.47  #    Success case prop encoding time   : 0.000
% 0.16/0.47  #    Success case prop solver time     : 0.000
% 0.16/0.47  # Current number of processed clauses  : 155
% 0.16/0.47  #    Positive orientable unit clauses  : 38
% 0.16/0.47  #    Positive unorientable unit clauses: 0
% 0.16/0.47  #    Negative unit clauses             : 11
% 0.16/0.47  #    Non-unit-clauses                  : 106
% 0.16/0.47  # Current number of unprocessed clauses: 142
% 0.16/0.47  # ...number of literals in the above   : 730
% 0.16/0.47  # Current number of archived formulas  : 0
% 0.16/0.47  # Current number of archived clauses   : 6
% 0.16/0.47  # Clause-clause subsumption calls (NU) : 2021
% 0.16/0.47  # Rec. Clause-clause subsumption calls : 1150
% 0.16/0.47  # Non-unit clause-clause subsumptions  : 37
% 0.16/0.47  # Unit Clause-clause subsumption calls : 241
% 0.16/0.47  # Rewrite failures with RHS unbound    : 0
% 0.16/0.47  # BW rewrite match attempts            : 2
% 0.16/0.47  # BW rewrite match successes           : 2
% 0.16/0.47  # Condensation attempts                : 0
% 0.16/0.47  # Condensation successes               : 0
% 0.16/0.47  # Termbank termtop insertions          : 15085
% 0.16/0.47  
% 0.16/0.47  # -------------------------------------------------
% 0.16/0.47  # User time                : 0.018 s
% 0.16/0.47  # System time              : 0.003 s
% 0.16/0.47  # Total time               : 0.021 s
% 0.16/0.47  # Maximum resident set size: 2332 pages
% 0.16/0.47  
% 0.16/0.47  # -------------------------------------------------
% 0.16/0.47  # User time                : 0.058 s
% 0.16/0.47  # System time              : 0.010 s
% 0.16/0.47  # Total time               : 0.068 s
% 0.16/0.47  # Maximum resident set size: 1784 pages
% 0.16/0.47  % E---3.1 exiting
% 0.16/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------