TSTP Solution File: NUM568+3 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : NUM568+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.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 : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 12:35:47 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__3462,hypothesis,
    xK != sz00,
    file('/export/starexec/sandbox/tmp/tmp.5Fp0biNUsI/E---3.1_7305.p',m__3462) ).

fof(m__,conjecture,
    ? [X1] :
      ( aElementOf0(X1,szNzAzT0)
      & szszuzczcdt0(X1) = xK ),
    file('/export/starexec/sandbox/tmp/tmp.5Fp0biNUsI/E---3.1_7305.p',m__) ).

fof(mNatExtra,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( X1 = sz00
        | ? [X2] :
            ( aElementOf0(X2,szNzAzT0)
            & X1 = szszuzczcdt0(X2) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.5Fp0biNUsI/E---3.1_7305.p',mNatExtra) ).

fof(m__3418,hypothesis,
    aElementOf0(xK,szNzAzT0),
    file('/export/starexec/sandbox/tmp/tmp.5Fp0biNUsI/E---3.1_7305.p',m__3418) ).

fof(c_0_4,hypothesis,
    xK != sz00,
    inference(fof_simplification,[status(thm)],[m__3462]) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] :
        ( aElementOf0(X1,szNzAzT0)
        & szszuzczcdt0(X1) = xK ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_6,plain,
    ! [X30] :
      ( ( aElementOf0(esk10_1(X30),szNzAzT0)
        | X30 = sz00
        | ~ aElementOf0(X30,szNzAzT0) )
      & ( X30 = szszuzczcdt0(esk10_1(X30))
        | X30 = sz00
        | ~ aElementOf0(X30,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])])]) ).

fof(c_0_7,hypothesis,
    xK != sz00,
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ! [X8] :
      ( ~ aElementOf0(X8,szNzAzT0)
      | szszuzczcdt0(X8) != xK ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    ( X1 = szszuzczcdt0(esk10_1(X1))
    | X1 = sz00
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,hypothesis,
    aElementOf0(xK,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3418]) ).

cnf(c_0_11,hypothesis,
    xK != sz00,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ aElementOf0(X1,szNzAzT0)
    | szszuzczcdt0(X1) != xK ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,hypothesis,
    szszuzczcdt0(esk10_1(xK)) = xK,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,plain,
    ( aElementOf0(esk10_1(X1),szNzAzT0)
    | X1 = sz00
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    ~ aElementOf0(esk10_1(xK),szNzAzT0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_11]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUM568+3 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Sun Jun 23 01:51:53 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.48  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.5Fp0biNUsI/E---3.1_7305.p
% 21.87/3.31  # Version: 3.2.0
% 21.87/3.31  # Preprocessing class: FSLSSMSSSSSNFFN.
% 21.87/3.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.87/3.31  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 21.87/3.31  # Starting new_bool_3 with 300s (1) cores
% 21.87/3.31  # Starting new_bool_1 with 300s (1) cores
% 21.87/3.31  # Starting sh5l with 300s (1) cores
% 21.87/3.31  # sh5l with pid 7386 completed with status 0
% 21.87/3.31  # Result found by sh5l
% 21.87/3.31  # Preprocessing class: FSLSSMSSSSSNFFN.
% 21.87/3.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.87/3.31  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 21.87/3.31  # Starting new_bool_3 with 300s (1) cores
% 21.87/3.31  # Starting new_bool_1 with 300s (1) cores
% 21.87/3.31  # Starting sh5l with 300s (1) cores
% 21.87/3.31  # SinE strategy is gf500_gu_R04_F100_L20000
% 21.87/3.31  # Search class: FGHSF-SMLM32-MFFFFFNN
% 21.87/3.31  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 21.87/3.31  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 21.87/3.31  # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 7394 completed with status 0
% 21.87/3.31  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 21.87/3.31  # Preprocessing class: FSLSSMSSSSSNFFN.
% 21.87/3.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.87/3.31  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 21.87/3.31  # Starting new_bool_3 with 300s (1) cores
% 21.87/3.31  # Starting new_bool_1 with 300s (1) cores
% 21.87/3.31  # Starting sh5l with 300s (1) cores
% 21.87/3.31  # SinE strategy is gf500_gu_R04_F100_L20000
% 21.87/3.31  # Search class: FGHSF-SMLM32-MFFFFFNN
% 21.87/3.31  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 21.87/3.31  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 21.87/3.31  # Preprocessing time       : 0.130 s
% 21.87/3.31  # Presaturation interreduction done
% 21.87/3.31  
% 21.87/3.31  # Proof found!
% 21.87/3.31  # SZS status Theorem
% 21.87/3.31  # SZS output start CNFRefutation
% See solution above
% 21.87/3.31  # Parsed axioms                        : 80
% 21.87/3.31  # Removed by relevancy pruning/SinE    : 2
% 21.87/3.31  # Initial clauses                      : 4129
% 21.87/3.31  # Removed in clause preprocessing      : 7
% 21.87/3.31  # Initial clauses in saturation        : 4122
% 21.87/3.31  # Processed clauses                    : 5990
% 21.87/3.31  # ...of these trivial                  : 0
% 21.87/3.31  # ...subsumed                          : 576
% 21.87/3.31  # ...remaining for further processing  : 5414
% 21.87/3.31  # Other redundant clauses eliminated   : 1929
% 21.87/3.31  # Clauses deleted for lack of memory   : 0
% 21.87/3.31  # Backward-subsumed                    : 0
% 21.87/3.31  # Backward-rewritten                   : 2
% 21.87/3.31  # Generated clauses                    : 2098
% 21.87/3.31  # ...of the previous two non-redundant : 2067
% 21.87/3.31  # ...aggressively subsumed             : 0
% 21.87/3.31  # Contextual simplify-reflections      : 13
% 21.87/3.31  # Paramodulations                      : 362
% 21.87/3.31  # Factorizations                       : 0
% 21.87/3.31  # NegExts                              : 0
% 21.87/3.31  # Equation resolutions                 : 1930
% 21.87/3.31  # Disequality decompositions           : 0
% 21.87/3.31  # Total rewrite steps                  : 56
% 21.87/3.31  # ...of those cached                   : 43
% 21.87/3.31  # Propositional unsat checks           : 0
% 21.87/3.31  #    Propositional check models        : 0
% 21.87/3.31  #    Propositional check unsatisfiable : 0
% 21.87/3.31  #    Propositional clauses             : 0
% 21.87/3.31  #    Propositional clauses after purity: 0
% 21.87/3.31  #    Propositional unsat core size     : 0
% 21.87/3.31  #    Propositional preprocessing time  : 0.000
% 21.87/3.31  #    Propositional encoding time       : 0.000
% 21.87/3.31  #    Propositional solver time         : 0.000
% 21.87/3.31  #    Success case prop preproc time    : 0.000
% 21.87/3.31  #    Success case prop encoding time   : 0.000
% 21.87/3.31  #    Success case prop solver time     : 0.000
% 21.87/3.31  # Current number of processed clauses  : 123
% 21.87/3.31  #    Positive orientable unit clauses  : 60
% 21.87/3.31  #    Positive unorientable unit clauses: 0
% 21.87/3.31  #    Negative unit clauses             : 18
% 21.87/3.31  #    Non-unit-clauses                  : 45
% 21.87/3.31  # Current number of unprocessed clauses: 3752
% 21.87/3.31  # ...number of literals in the above   : 41986
% 21.87/3.31  # Current number of archived formulas  : 0
% 21.87/3.31  # Current number of archived clauses   : 3556
% 21.87/3.31  # Clause-clause subsumption calls (NU) : 3743107
% 21.87/3.31  # Rec. Clause-clause subsumption calls : 67342
% 21.87/3.31  # Non-unit clause-clause subsumptions  : 581
% 21.87/3.31  # Unit Clause-clause subsumption calls : 505
% 21.87/3.31  # Rewrite failures with RHS unbound    : 0
% 21.87/3.31  # BW rewrite match attempts            : 176
% 21.87/3.31  # BW rewrite match successes           : 2
% 21.87/3.31  # Condensation attempts                : 0
% 21.87/3.31  # Condensation successes               : 0
% 21.87/3.31  # Termbank termtop insertions          : 602783
% 21.87/3.31  # Search garbage collected termcells   : 26027
% 21.87/3.31  
% 21.87/3.31  # -------------------------------------------------
% 21.87/3.31  # User time                : 2.776 s
% 21.87/3.31  # System time              : 0.027 s
% 21.87/3.31  # Total time               : 2.803 s
% 21.87/3.31  # Maximum resident set size: 13168 pages
% 21.87/3.31  
% 21.87/3.31  # -------------------------------------------------
% 21.87/3.31  # User time                : 2.779 s
% 21.87/3.31  # System time              : 0.031 s
% 21.87/3.31  # Total time               : 2.810 s
% 21.87/3.31  # Maximum resident set size: 1796 pages
% 21.87/3.31  % E---3.1 exiting
% 21.87/3.31  % E exiting
%------------------------------------------------------------------------------