TSTP Solution File: NUM550+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n020.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 : Sat May  4 09:06:40 EDT 2024

% Result   : Timeout 300.17s 100.45s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   45 (  25 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   45 (  18   ~;  12   |;  12   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :   10 (   0 sgn   6   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    xQ != slcrc0,
    file('/export/starexec/sandbox/tmp/tmp.TeN0tBafwF/E---3.1_9945.p',m__) ).

fof(mCardEmpty,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( sbrdtbr0(X1) = sz00
      <=> X1 = slcrc0 ) ),
    file('/export/starexec/sandbox/tmp/tmp.TeN0tBafwF/E---3.1_9945.p',mCardEmpty) ).

fof(mDefEmp,axiom,
    ! [X1] :
      ( X1 = slcrc0
    <=> ( aSet0(X1)
        & ~ ? [X2] : aElementOf0(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.TeN0tBafwF/E---3.1_9945.p',mDefEmp) ).

fof(m__2202_02,hypothesis,
    ( aSet0(xS)
    & aSet0(xT)
    & xk != sz00 ),
    file('/export/starexec/sandbox/tmp/tmp.TeN0tBafwF/E---3.1_9945.p',m__2202_02) ).

fof(m__2291,hypothesis,
    ( aSet0(xQ)
    & isFinite0(xQ)
    & sbrdtbr0(xQ) = xk ),
    file('/export/starexec/sandbox/tmp/tmp.TeN0tBafwF/E---3.1_9945.p',m__2291) ).

fof(c_0_5,negated_conjecture,
    xQ = slcrc0,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_6,plain,
    ! [X10] :
      ( ( sbrdtbr0(X10) != sz00
        | X10 = slcrc0
        | ~ aSet0(X10) )
      & ( X10 != slcrc0
        | sbrdtbr0(X10) = sz00
        | ~ aSet0(X10) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).

fof(c_0_7,plain,
    ! [X14,X15,X16] :
      ( ( aSet0(X14)
        | X14 != slcrc0 )
      & ( ~ aElementOf0(X15,X14)
        | X14 != slcrc0 )
      & ( ~ aSet0(X16)
        | aElementOf0(esk2_1(X16),X16)
        | X16 = slcrc0 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefEmp])])])])])])]) ).

fof(c_0_8,hypothesis,
    ( aSet0(xS)
    & aSet0(xT)
    & xk != sz00 ),
    inference(fof_simplification,[status(thm)],[m__2202_02]) ).

cnf(c_0_9,hypothesis,
    sbrdtbr0(xQ) = xk,
    inference(split_conjunct,[status(thm)],[m__2291]) ).

cnf(c_0_10,negated_conjecture,
    xQ = slcrc0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_13,hypothesis,
    ( aSet0(xS)
    & aSet0(xT)
    & xk != sz00 ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

cnf(c_0_14,hypothesis,
    sbrdtbr0(slcrc0) = xk,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0 ),
    inference(csr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    xk != sz00,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NUM550+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 09:15:46 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  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.TeN0tBafwF/E---3.1_9945.p
% 300.17/100.45  # Version: 3.1.0
% 300.17/100.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 300.17/100.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.17/100.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 300.17/100.45  # Starting new_bool_3 with 300s (1) cores
% 300.17/100.45  # Starting new_bool_1 with 300s (1) cores
% 300.17/100.45  # Starting sh5l with 300s (1) cores
% 300.17/100.45  # new_bool_3 with pid 10028 completed with status 0
% 300.17/100.45  # Result found by new_bool_3
% 300.17/100.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 300.17/100.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.17/100.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 300.17/100.45  # Starting new_bool_3 with 300s (1) cores
% 300.17/100.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.17/100.45  # Search class: FGHSF-FFMM31-MFFFFFNN
% 300.17/100.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.17/100.45  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 300.17/100.45  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10033 completed with status 0
% 300.17/100.45  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 300.17/100.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 300.17/100.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.17/100.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 300.17/100.45  # Starting new_bool_3 with 300s (1) cores
% 300.17/100.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.17/100.45  # Search class: FGHSF-FFMM31-MFFFFFNN
% 300.17/100.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.17/100.45  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 300.17/100.45  # Preprocessing time       : 0.003 s
% 300.17/100.45  
% 300.17/100.45  # Proof found!
% 300.17/100.45  # SZS status Theorem
% 300.17/100.45  # SZS output start CNFRefutation
% See solution above
% 300.17/100.45  # Parsed axioms                        : 67
% 300.17/100.45  # Removed by relevancy pruning/SinE    : 5
% 300.17/100.45  # Initial clauses                      : 111
% 300.17/100.45  # Removed in clause preprocessing      : 5
% 300.17/100.45  # Initial clauses in saturation        : 106
% 300.17/100.45  # Processed clauses                    : 23
% 300.17/100.45  # ...of these trivial                  : 1
% 300.17/100.45  # ...subsumed                          : 0
% 300.17/100.45  # ...remaining for further processing  : 22
% 300.17/100.45  # Other redundant clauses eliminated   : 0
% 300.17/100.45  # Clauses deleted for lack of memory   : 0
% 300.17/100.45  # Backward-subsumed                    : 0
% 300.17/100.45  # Backward-rewritten                   : 0
% 300.17/100.45  # Generated clauses                    : 6
% 300.17/100.45  # ...of the previous two non-redundant : 5
% 300.17/100.45  # ...aggressively subsumed             : 0
% 300.17/100.45  # Contextual simplify-reflections      : 1
% 300.17/100.45  # Paramodulations                      : 6
% 300.17/100.45  # Factorizations                       : 0
% 300.17/100.45  # NegExts                              : 0
% 300.17/100.45  # Equation resolutions                 : 0
% 300.17/100.45  # Disequality decompositions           : 0
% 300.17/100.45  # Total rewrite steps                  : 6
% 300.17/100.45  # ...of those cached                   : 3
% 300.17/100.45  # Propositional unsat checks           : 0
% 300.17/100.45  #    Propositional check models        : 0
% 300.17/100.45  #    Propositional check unsatisfiable : 0
% 300.17/100.45  #    Propositional clauses             : 0
% 300.17/100.45  #    Propositional clauses after purity: 0
% 300.17/100.45  #    Propositional unsat core size     : 0
% 300.17/100.45  #    Propositional preprocessing time  : 0.000
% 300.17/100.45  #    Propositional encoding time       : 0.000
% 300.17/100.45  #    Propositional solver time         : 0.000
% 300.17/100.45  #    Success case prop preproc time    : 0.000
% 300.17/100.45  #    Success case prop encoding time   : 0.000
% 300.17/100.45  #    Success case prop solver time     : 0.000
% 300.17/100.45  # Current number of processed clauses  : 22
% 300.17/100.45  #    Positive orientable unit clauses  : 14
% 300.17/100.45  #    Positive unorientable unit clauses: 0
% 300.17/100.45  #    Negative unit clauses             : 2
% 300.17/100.45  #    Non-unit-clauses                  : 6
% 300.17/100.45  # Current number of unprocessed clauses: 88
% 300.17/100.45  # ...number of literals in the above   : 367
% 300.17/100.45  # Current number of archived formulas  : 0
% 300.17/100.45  # Current number of archived clauses   : 0
% 300.17/100.45  # Clause-clause subsumption calls (NU) : 5
% 300.17/100.45  # Rec. Clause-clause subsumption calls : 5
% 300.17/100.45  # Non-unit clause-clause subsumptions  : 1
% 300.17/100.45  # Unit Clause-clause subsumption calls : 1
% 300.17/100.45  # Rewrite failures with RHS unbound    : 0
% 300.17/100.45  # BW rewrite match attempts            : 0
% 300.17/100.45  # BW rewrite match successes           : 0
% 300.17/100.45  # Condensation attempts                : 0
% 300.17/100.45  # Condensation successes               : 0
% 300.17/100.45  # Termbank termtop insertions          : 8168
% 300.17/100.45  # Search garbage collected termcells   : 2052
% 300.17/100.45  
% 300.17/100.45  # -------------------------------------------------
% 300.17/100.45  # User time                : 0.011 s
% 300.17/100.45  # System time              : 0.004 s
% 300.17/100.45  # Total time               : 0.015 s
% 300.17/100.45  # Maximum resident set size: 2076 pages
% 300.17/100.45  
% 300.17/100.45  # -------------------------------------------------
% 300.17/100.45  # User time                : 0.013 s
% 300.17/100.45  # System time              : 0.006 s
% 300.17/100.45  # Total time               : 0.020 s
% 300.17/100.45  # Maximum resident set size: 1764 pages
% 300.17/100.45  % E---3.1 exiting
%------------------------------------------------------------------------------