TSTP Solution File: NUM605+3 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n017.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:56 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
      & xQ = slcrc0 ),
    file('/export/starexec/sandbox2/tmp/tmp.Yl2ef68db1/E---3.1_19029.p',m__) ).

fof(m__5078,hypothesis,
    ( aSet0(xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xO) )
    & aSubsetOf0(xQ,xO)
    & sbrdtbr0(xQ) = xK
    & aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
    file('/export/starexec/sandbox2/tmp/tmp.Yl2ef68db1/E---3.1_19029.p',m__5078) ).

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

fof(m__3462,hypothesis,
    xK != sz00,
    file('/export/starexec/sandbox2/tmp/tmp.Yl2ef68db1/E---3.1_19029.p',m__3462) ).

fof(c_0_4,negated_conjecture,
    ~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
        & xQ = slcrc0 ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_5,hypothesis,
    ! [X246] :
      ( aSet0(xQ)
      & ( ~ aElementOf0(X246,xQ)
        | aElementOf0(X246,xO) )
      & aSubsetOf0(xQ,xO)
      & sbrdtbr0(xQ) = xK
      & aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])]) ).

fof(c_0_6,negated_conjecture,
    ! [X247] :
      ( ~ aElementOf0(X247,xQ)
      & xQ = slcrc0 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

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

cnf(c_0_8,hypothesis,
    sbrdtbr0(xQ) = xK,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    xQ = slcrc0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,hypothesis,
    aSet0(xQ),
    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_7]) ).

cnf(c_0_12,hypothesis,
    sbrdtbr0(slcrc0) = xK,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    aSet0(slcrc0),
    inference(rw,[status(thm)],[c_0_10,c_0_9]) ).

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

cnf(c_0_15,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM605+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 12:43:11 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.51  Running first-order model finding
% 0.21/0.51  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Yl2ef68db1/E---3.1_19029.p
% 1.57/1.02  # Version: 3.1pre001
% 1.57/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/1.02  # Starting new_bool_3 with 300s (1) cores
% 1.57/1.02  # Starting new_bool_1 with 300s (1) cores
% 1.57/1.02  # Starting sh5l with 300s (1) cores
% 1.57/1.02  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19166 completed with status 0
% 1.57/1.02  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.57/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/1.02  # No SInE strategy applied
% 1.57/1.02  # Search class: FGHSF-SMLM32-MFFFFFNN
% 1.57/1.02  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 1.57/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.57/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.57/1.02  # Starting new_bool_3 with 136s (1) cores
% 1.57/1.02  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.57/1.02  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19175 completed with status 0
% 1.57/1.02  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 1.57/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/1.02  # No SInE strategy applied
% 1.57/1.02  # Search class: FGHSF-SMLM32-MFFFFFNN
% 1.57/1.02  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 1.57/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.57/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.57/1.02  # Preprocessing time       : 0.162 s
% 1.57/1.02  # Presaturation interreduction done
% 1.57/1.02  
% 1.57/1.02  # Proof found!
% 1.57/1.02  # SZS status Theorem
% 1.57/1.02  # SZS output start CNFRefutation
% See solution above
% 1.57/1.02  # Parsed axioms                        : 100
% 1.57/1.02  # Removed by relevancy pruning/SinE    : 0
% 1.57/1.02  # Initial clauses                      : 4883
% 1.57/1.02  # Removed in clause preprocessing      : 7
% 1.57/1.02  # Initial clauses in saturation        : 4876
% 1.57/1.02  # Processed clauses                    : 61
% 1.57/1.02  # ...of these trivial                  : 1
% 1.57/1.02  # ...subsumed                          : 3
% 1.57/1.02  # ...remaining for further processing  : 57
% 1.57/1.02  # Other redundant clauses eliminated   : 4
% 1.57/1.02  # Clauses deleted for lack of memory   : 0
% 1.57/1.02  # Backward-subsumed                    : 0
% 1.57/1.02  # Backward-rewritten                   : 0
% 1.57/1.02  # Generated clauses                    : 4
% 1.57/1.02  # ...of the previous two non-redundant : 2
% 1.57/1.02  # ...aggressively subsumed             : 0
% 1.57/1.02  # Contextual simplify-reflections      : 0
% 1.57/1.02  # Paramodulations                      : 0
% 1.57/1.02  # Factorizations                       : 0
% 1.57/1.02  # NegExts                              : 0
% 1.57/1.02  # Equation resolutions                 : 4
% 1.57/1.02  # Total rewrite steps                  : 11
% 1.57/1.02  # Propositional unsat checks           : 0
% 1.57/1.02  #    Propositional check models        : 0
% 1.57/1.02  #    Propositional check unsatisfiable : 0
% 1.57/1.02  #    Propositional clauses             : 0
% 1.57/1.02  #    Propositional clauses after purity: 0
% 1.57/1.02  #    Propositional unsat core size     : 0
% 1.57/1.02  #    Propositional preprocessing time  : 0.000
% 1.57/1.02  #    Propositional encoding time       : 0.000
% 1.57/1.02  #    Propositional solver time         : 0.000
% 1.57/1.02  #    Success case prop preproc time    : 0.000
% 1.57/1.02  #    Success case prop encoding time   : 0.000
% 1.57/1.02  #    Success case prop solver time     : 0.000
% 1.57/1.02  # Current number of processed clauses  : 53
% 1.57/1.02  #    Positive orientable unit clauses  : 33
% 1.57/1.02  #    Positive unorientable unit clauses: 0
% 1.57/1.02  #    Negative unit clauses             : 3
% 1.57/1.02  #    Non-unit-clauses                  : 17
% 1.57/1.02  # Current number of unprocessed clauses: 4817
% 1.57/1.02  # ...number of literals in the above   : 55894
% 1.57/1.02  # Current number of archived formulas  : 0
% 1.57/1.02  # Current number of archived clauses   : 0
% 1.57/1.02  # Clause-clause subsumption calls (NU) : 28
% 1.57/1.02  # Rec. Clause-clause subsumption calls : 26
% 1.57/1.02  # Non-unit clause-clause subsumptions  : 0
% 1.57/1.02  # Unit Clause-clause subsumption calls : 11
% 1.57/1.02  # Rewrite failures with RHS unbound    : 0
% 1.57/1.02  # BW rewrite match attempts            : 0
% 1.57/1.02  # BW rewrite match successes           : 0
% 1.57/1.02  # Condensation attempts                : 0
% 1.57/1.02  # Condensation successes               : 0
% 1.57/1.02  # Termbank termtop insertions          : 376806
% 1.57/1.02  
% 1.57/1.02  # -------------------------------------------------
% 1.57/1.02  # User time                : 0.458 s
% 1.57/1.02  # System time              : 0.019 s
% 1.57/1.02  # Total time               : 0.477 s
% 1.57/1.02  # Maximum resident set size: 14244 pages
% 1.57/1.02  
% 1.57/1.02  # -------------------------------------------------
% 1.57/1.02  # User time                : 1.111 s
% 1.57/1.02  # System time              : 0.062 s
% 1.57/1.02  # Total time               : 1.174 s
% 1.57/1.02  # Maximum resident set size: 1852 pages
% 1.57/1.02  % E---3.1 exiting
%------------------------------------------------------------------------------