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

View Problem - Process Solution

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

% Computer : n019.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:37 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(mSuccEquSucc,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
       => X1 = X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.0oHa4ghw0D/E---3.1_6052.p',mSuccEquSucc) ).

fof(m__5255,hypothesis,
    ( sbrdtbr0(xQ) = szszuzczcdt0(xk)
    & szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
    & aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/tmp.0oHa4ghw0D/E---3.1_6052.p',m__5255) ).

fof(m__3533,hypothesis,
    ( aElementOf0(xk,szNzAzT0)
    & szszuzczcdt0(xk) = xK ),
    file('/export/starexec/sandbox/tmp/tmp.0oHa4ghw0D/E---3.1_6052.p',m__3533) ).

fof(m__,conjecture,
    sbrdtbr0(xP) = xk,
    file('/export/starexec/sandbox/tmp/tmp.0oHa4ghw0D/E---3.1_6052.p',m__) ).

fof(c_0_4,plain,
    ! [X102,X103] :
      ( ~ aElementOf0(X102,szNzAzT0)
      | ~ aElementOf0(X103,szNzAzT0)
      | szszuzczcdt0(X102) != szszuzczcdt0(X103)
      | X102 = X103 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).

cnf(c_0_5,hypothesis,
    sbrdtbr0(xQ) = szszuzczcdt0(xk),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_6,hypothesis,
    szszuzczcdt0(xk) = xK,
    inference(split_conjunct,[status(thm)],[m__3533]) ).

cnf(c_0_7,plain,
    ( X1 = X2
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X2,szNzAzT0)
    | szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3533]) ).

cnf(c_0_9,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_10,hypothesis,
    sbrdtbr0(xQ) = xK,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

fof(c_0_11,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_12,hypothesis,
    ( X1 = xk
    | szszuzczcdt0(X1) != xK
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_8])]) ).

cnf(c_0_13,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = xK,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    aElementOf0(sbrdtbr0(xP),szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_15,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : NUM613+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.14  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Oct  2 14:18:06 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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.0oHa4ghw0D/E---3.1_6052.p
% 0.17/0.49  # Version: 3.1pre001
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49  # Starting sh5l with 300s (1) cores
% 0.17/0.49  # new_bool_3 with pid 6131 completed with status 0
% 0.17/0.49  # Result found by new_bool_3
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.17/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.17/0.49  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6140 completed with status 0
% 0.17/0.49  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.17/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.17/0.49  # Preprocessing time       : 0.003 s
% 0.17/0.49  # Presaturation interreduction done
% 0.17/0.49  
% 0.17/0.49  # Proof found!
% 0.17/0.49  # SZS status Theorem
% 0.17/0.49  # SZS output start CNFRefutation
% See solution above
% 0.17/0.49  # Parsed axioms                        : 110
% 0.17/0.49  # Removed by relevancy pruning/SinE    : 9
% 0.17/0.49  # Initial clauses                      : 190
% 0.17/0.49  # Removed in clause preprocessing      : 7
% 0.17/0.49  # Initial clauses in saturation        : 183
% 0.17/0.49  # Processed clauses                    : 356
% 0.17/0.49  # ...of these trivial                  : 3
% 0.17/0.49  # ...subsumed                          : 8
% 0.17/0.49  # ...remaining for further processing  : 345
% 0.17/0.49  # Other redundant clauses eliminated   : 36
% 0.17/0.49  # Clauses deleted for lack of memory   : 0
% 0.17/0.49  # Backward-subsumed                    : 1
% 0.17/0.49  # Backward-rewritten                   : 3
% 0.17/0.49  # Generated clauses                    : 140
% 0.17/0.49  # ...of the previous two non-redundant : 107
% 0.17/0.49  # ...aggressively subsumed             : 0
% 0.17/0.49  # Contextual simplify-reflections      : 15
% 0.17/0.49  # Paramodulations                      : 108
% 0.17/0.49  # Factorizations                       : 0
% 0.17/0.49  # NegExts                              : 0
% 0.17/0.49  # Equation resolutions                 : 37
% 0.17/0.49  # Total rewrite steps                  : 141
% 0.17/0.49  # Propositional unsat checks           : 0
% 0.17/0.49  #    Propositional check models        : 0
% 0.17/0.49  #    Propositional check unsatisfiable : 0
% 0.17/0.49  #    Propositional clauses             : 0
% 0.17/0.49  #    Propositional clauses after purity: 0
% 0.17/0.49  #    Propositional unsat core size     : 0
% 0.17/0.49  #    Propositional preprocessing time  : 0.000
% 0.17/0.49  #    Propositional encoding time       : 0.000
% 0.17/0.49  #    Propositional solver time         : 0.000
% 0.17/0.49  #    Success case prop preproc time    : 0.000
% 0.17/0.49  #    Success case prop encoding time   : 0.000
% 0.17/0.49  #    Success case prop solver time     : 0.000
% 0.17/0.49  # Current number of processed clauses  : 132
% 0.17/0.49  #    Positive orientable unit clauses  : 65
% 0.17/0.49  #    Positive unorientable unit clauses: 0
% 0.17/0.49  #    Negative unit clauses             : 14
% 0.17/0.49  #    Non-unit-clauses                  : 53
% 0.17/0.49  # Current number of unprocessed clauses: 114
% 0.17/0.49  # ...number of literals in the above   : 495
% 0.17/0.49  # Current number of archived formulas  : 0
% 0.17/0.49  # Current number of archived clauses   : 185
% 0.17/0.49  # Clause-clause subsumption calls (NU) : 5175
% 0.17/0.49  # Rec. Clause-clause subsumption calls : 1160
% 0.17/0.49  # Non-unit clause-clause subsumptions  : 16
% 0.17/0.49  # Unit Clause-clause subsumption calls : 125
% 0.17/0.49  # Rewrite failures with RHS unbound    : 0
% 0.17/0.49  # BW rewrite match attempts            : 3
% 0.17/0.49  # BW rewrite match successes           : 3
% 0.17/0.49  # Condensation attempts                : 0
% 0.17/0.49  # Condensation successes               : 0
% 0.17/0.49  # Termbank termtop insertions          : 15482
% 0.17/0.49  
% 0.17/0.49  # -------------------------------------------------
% 0.17/0.49  # User time                : 0.025 s
% 0.17/0.49  # System time              : 0.004 s
% 0.17/0.49  # Total time               : 0.029 s
% 0.17/0.49  # Maximum resident set size: 2436 pages
% 0.17/0.49  
% 0.17/0.49  # -------------------------------------------------
% 0.17/0.49  # User time                : 0.026 s
% 0.17/0.49  # System time              : 0.007 s
% 0.17/0.49  # Total time               : 0.033 s
% 0.17/0.49  # Maximum resident set size: 1812 pages
% 0.17/0.49  % E---3.1 exiting
% 0.17/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------