↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM565+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:49:35 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ! [X1] :
      ( ( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
        & sbrdtbr0(X1) = sz00
        & aSubsetOf0(X1,xS)
        & ! [X2] :
            ( aElementOf0(X2,X1)
           => aElementOf0(X2,xS) )
        & aSet0(X1) )
     => ( ( ~ ? [X2] : aElementOf0(X2,slcrc0)
          & aSet0(slcrc0) )
       => sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(mCardEmpty,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( sbrdtbr0(X1) = sz00
      <=> X1 = slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).

fof(m__3462,hypothesis,
    xK = sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( ( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
          & sbrdtbr0(X1) = sz00
          & aSubsetOf0(X1,xS)
          & ! [X2] :
              ( aElementOf0(X2,X1)
             => aElementOf0(X2,xS) )
          & aSet0(X1) )
       => ( ( ~ ? [X2] : aElementOf0(X2,slcrc0)
            & aSet0(slcrc0) )
         => sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

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

fof(c_0_5,negated_conjecture,
    ! [X39,X40] :
      ( sdtlpdtrp0(xc,esk12_0) != sdtlpdtrp0(xc,slcrc0)
      & ~ aElementOf0(X40,slcrc0)
      & aSet0(slcrc0)
      & aElementOf0(esk12_0,slbdtsldtrb0(xS,sz00))
      & sbrdtbr0(esk12_0) = sz00
      & aSubsetOf0(esk12_0,xS)
      & ( aElementOf0(X39,xS)
        | ~ aElementOf0(X39,esk12_0) )
      & aSet0(esk12_0) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).

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

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

cnf(c_0_8,negated_conjecture,
    sbrdtbr0(esk12_0) = sz00,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ aSet0(X1)
    | sbrdtbr0(X1) != xK
    | X1 = slcrc0 ),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    sbrdtbr0(esk12_0) = xK,
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    aSet0(esk12_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    sdtlpdtrp0(xc,esk12_0) != sdtlpdtrp0(xc,slcrc0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    esk12_0 = slcrc0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM565+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46  % Computer : n004.cluster.edu
% 0.20/0.46  % Model    : x86_64 x86_64
% 0.20/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46  % Memory   : 8046.5625MB
% 0.20/0.46  % OS       : Linux 6.8.0-71-generic
% 0.20/0.46  % CPULimit : 300
% 0.20/0.46  % WCLimit  : 300
% 0.20/0.46  % DateTime : Mon Sep 21 02:40:05 UTC 2026
% 0.20/0.46  % CPUTime  : 
% 0.20/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  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/benchmark/theBenchmark.p
% 1.20/0.92  % Version: 3.5.1
% 1.20/0.92  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.20/0.92  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.92  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.20/0.92  % Starting new_bool_3 with 300s (1) cores
% 1.20/0.92  % Starting new_bool_1 with 300s (1) cores
% 1.20/0.92  % Starting sh5l with 300s (1) cores
% 1.20/0.92  % new_bool_1 with pid 2075171 completed with status 0
% 1.20/0.92  % Result found by new_bool_1
% 1.20/0.92  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.20/0.92  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.92  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.20/0.92  % Starting new_bool_3 with 300s (1) cores
% 1.20/0.92  % Starting new_bool_1 with 300s (1) cores
% 1.20/0.92  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.20/0.92  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.92  % Search class: FGHSF-SMLM32-SFFFFFNN
% 1.20/0.92  % partial match(1): FGHSF-SMLM33-SFFFFFNN
% 1.20/0.92  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.20/0.92  % Starting SubtermCWHack with 28s (1) cores
% 1.20/0.92  % SubtermCWHack with pid 2075173 completed with status 0
% 1.20/0.92  % Result found by SubtermCWHack
% 1.20/0.92  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.20/0.92  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.92  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.20/0.92  % Starting new_bool_3 with 300s (1) cores
% 1.20/0.92  % Starting new_bool_1 with 300s (1) cores
% 1.20/0.92  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.20/0.92  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.92  % Search class: FGHSF-SMLM32-SFFFFFNN
% 1.20/0.92  % partial match(1): FGHSF-SMLM33-SFFFFFNN
% 1.20/0.92  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.20/0.92  % Starting SubtermCWHack with 28s (1) cores
% 1.20/0.92  % Preprocessing time       : 0.096 s
% 1.20/0.92  
% 1.20/0.92  % Proof found!
% 1.20/0.92  % SZS status Theorem
% 1.20/0.92  % SZS output start CNFRefutation
% See solution above
% 1.20/0.92  % Parsed axioms                        : 80
% 1.20/0.92  % Removed by relevancy pruning/SinE    : 24
% 1.20/0.92  % Initial clauses                      : 4082
% 1.20/0.92  % Removed in clause preprocessing      : 7
% 1.20/0.92  % Initial clauses in saturation        : 4075
% 1.20/0.92  % Processed clauses                    : 56
% 1.20/0.92  % ...of these trivial                  : 2
% 1.20/0.92  % ...subsumed                          : 5
% 1.20/0.92  % ...remaining for further processing  : 48
% 1.20/0.92  % Other redundant clauses eliminated   : 4
% 1.20/0.92  % Clauses deleted for lack of memory   : 0
% 1.20/0.92  % Backward-subsumed                    : 0
% 1.20/0.92  % Backward-rewritten                   : 5
% 1.20/0.92  % Generated clauses                    : 21
% 1.20/0.92  % ...of the previous two non-redundant : 13
% 1.20/0.92  % ...aggressively subsumed             : 0
% 1.20/0.92  % Contextual simplify-reflections      : 0
% 1.20/0.92  % Paramodulations                      : 17
% 1.20/0.92  % Factorizations                       : 0
% 1.20/0.92  % NegExts                              : 0
% 1.20/0.92  % Equation resolutions                 : 4
% 1.20/0.92  % Disequality decompositions           : 0
% 1.20/0.92  % Total rewrite steps                  : 44
% 1.20/0.92  % ...of those cached                   : 29
% 1.20/0.92  % Propositional unsat checks           : 0
% 1.20/0.92  %    Propositional check models        : 0
% 1.20/0.92  %    Propositional check unsatisfiable : 0
% 1.20/0.92  %    Propositional clauses             : 0
% 1.20/0.92  %    Propositional clauses after purity: 0
% 1.20/0.92  %    Propositional unsat core size     : 0
% 1.20/0.92  %    Propositional preprocessing time  : 0.000
% 1.20/0.92  %    Propositional encoding time       : 0.000
% 1.20/0.92  %    Propositional solver time         : 0.000
% 1.20/0.92  %    Success case prop preproc time    : 0.000
% 1.20/0.92  %    Success case prop encoding time   : 0.000
% 1.20/0.92  %    Success case prop solver time     : 0.000
% 1.20/0.92  % Current number of processed clauses  : 39
% 1.20/0.92  %    Positive orientable unit clauses  : 22
% 1.20/0.92  %    Positive unorientable unit clauses: 0
% 1.20/0.92  %    Negative unit clauses             : 3
% 1.20/0.92  %    Non-unit-clauses                  : 14
% 1.20/0.92  % Current number of unprocessed clauses: 4032
% 1.20/0.92  % ...number of literals in the above   : 50598
% 1.20/0.92  % Current number of archived formulas  : 0
% 1.20/0.92  % Current number of archived clauses   : 5
% 1.20/0.92  % Clause-clause subsumption calls (NU) : 7
% 1.20/0.92  % Rec. Clause-clause subsumption calls : 5
% 1.20/0.92  % Non-unit clause-clause subsumptions  : 0
% 1.20/0.92  % Unit Clause-clause subsumption calls : 3
% 1.20/0.92  % Rewrite failures with RHS unbound    : 0
% 1.20/0.92  % BW rewrite match attempts            : 1
% 1.20/0.92  % BW rewrite match successes           : 1
% 1.20/0.92  % Condensation attempts                : 0
% 1.20/0.92  % Condensation successes               : 0
% 1.20/0.92  % Termbank termtop insertions          : 324843
% 1.20/0.92  % Search garbage collected termcells   : 25047
% 1.20/0.92  
% 1.20/0.92  % -------------------------------------------------
% 1.20/0.92  % User time                : 0.322 s
% 1.20/0.92  % System time              : 0.026 s
% 1.20/0.92  % Total time               : 0.348 s
% 1.20/0.92  % Maximum resident set size: 15016 pages
% 1.20/0.92  
% 1.20/0.92  % -------------------------------------------------
% 1.20/0.92  % User time                : 0.329 s
% 1.20/0.92  % System time              : 0.033 s
% 1.20/0.92  % Total time               : 0.362 s
% 1.20/0.92  % Maximum resident set size: 4608 pages
% 1.20/0.92  % E exiting
%------------------------------------------------------------------------------