↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n005.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:44 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    aElementOf0(xx,xS),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__5045,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
    & ! [X1] :
        ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
       => aElementOf0(X1,xS) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5045) ).

fof(m__4660,hypothesis,
    ( ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
          & ! [X2] :
              ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
             => sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
          & aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ) )
    & szDzozmdt0(xe) = szNzAzT0
    & aFunction0(xe) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).

fof(m__5034,hypothesis,
    ( sdtlpdtrp0(xe,xi) = xx
    & aElementOf0(xi,szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).

fof(c_0_4,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_5,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,hypothesis,
    ! [X255] :
      ( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
      & ( aElementOf0(X255,xS)
        | ~ aElementOf0(X255,sdtlpdtrp0(xN,xi)) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5045])])])]) ).

fof(c_0_7,hypothesis,
    ! [X235,X236] :
      ( ( ~ aElementOf0(X235,szNzAzT0)
        | sdtlpdtrp0(xe,X235) = szmzizndt0(sdtlpdtrp0(xN,X235)) )
      & ( ~ aElementOf0(X235,szNzAzT0)
        | sdtlseqdt0(sdtlpdtrp0(xe,X235),X236)
        | ~ aElementOf0(X236,sdtlpdtrp0(xN,X235)) )
      & ( ~ aElementOf0(X235,szNzAzT0)
        | aElementOf0(sdtlpdtrp0(xe,X235),sdtlpdtrp0(xN,X235)) )
      & szDzozmdt0(xe) = szNzAzT0
      & aFunction0(xe) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])])]) ).

fof(c_0_8,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

cnf(c_0_9,hypothesis,
    ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
    | aElementOf0(X1,xS) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,hypothesis,
    ( ~ aElementOf0(X1,szNzAzT0)
    | aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,hypothesis,
    sdtlpdtrp0(xe,xi) = xx,
    inference(split_conjunct,[status(thm)],[m__5034]) ).

cnf(c_0_12,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5034]) ).

cnf(c_0_13,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM604+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n005.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 02:44:03 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.93/0.68  % Version: 3.5.1
% 0.93/0.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68  % Starting new_bool_3 with 300s (1) cores
% 0.93/0.68  % Starting new_bool_1 with 300s (1) cores
% 0.93/0.68  % Starting sh5l with 300s (1) cores
% 0.93/0.68  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2381623 completed with status 0
% 0.93/0.68  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.93/0.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.68  % No SInE strategy applied
% 0.93/0.68  % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.93/0.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.68  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.93/0.68  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.93/0.68  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.93/0.68  % Starting new_bool_3 with 136s (1) cores
% 0.93/0.68  % SubtermCWHack with pid 2381685 completed with status 0
% 0.93/0.68  % Result found by SubtermCWHack
% 0.93/0.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.68  % No SInE strategy applied
% 0.93/0.68  % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.93/0.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.68  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.68  % Preprocessing time       : 0.097 s
% 0.93/0.68  
% 0.93/0.68  % Proof found!
% 0.93/0.68  % SZS status Theorem
% 0.93/0.68  % SZS output start CNFRefutation
% See solution above
% 0.93/0.68  % Parsed axioms                        : 101
% 0.93/0.68  % Removed by relevancy pruning/SinE    : 0
% 0.93/0.68  % Initial clauses                      : 4882
% 0.93/0.68  % Removed in clause preprocessing      : 7
% 0.93/0.68  % Initial clauses in saturation        : 4875
% 0.93/0.68  % Processed clauses                    : 224
% 0.93/0.68  % ...of these trivial                  : 2
% 0.93/0.68  % ...subsumed                          : 23
% 0.93/0.68  % ...remaining for further processing  : 199
% 0.93/0.68  % Other redundant clauses eliminated   : 11
% 0.93/0.68  % Clauses deleted for lack of memory   : 0
% 0.93/0.68  % Backward-subsumed                    : 2
% 0.93/0.68  % Backward-rewritten                   : 0
% 0.93/0.68  % Generated clauses                    : 195
% 0.93/0.68  % ...of the previous two non-redundant : 153
% 0.93/0.68  % ...aggressively subsumed             : 0
% 0.93/0.68  % Contextual simplify-reflections      : 4
% 0.93/0.68  % Paramodulations                      : 184
% 0.93/0.68  % Factorizations                       : 0
% 0.93/0.68  % NegExts                              : 0
% 0.93/0.68  % Equation resolutions                 : 11
% 0.93/0.68  % Disequality decompositions           : 0
% 0.93/0.68  % Total rewrite steps                  : 154
% 0.93/0.68  % ...of those cached                   : 121
% 0.93/0.68  % Propositional unsat checks           : 0
% 0.93/0.68  %    Propositional check models        : 0
% 0.93/0.68  %    Propositional check unsatisfiable : 0
% 0.93/0.68  %    Propositional clauses             : 0
% 0.93/0.68  %    Propositional clauses after purity: 0
% 0.93/0.68  %    Propositional unsat core size     : 0
% 0.93/0.68  %    Propositional preprocessing time  : 0.000
% 0.93/0.68  %    Propositional encoding time       : 0.000
% 0.93/0.68  %    Propositional solver time         : 0.000
% 0.93/0.68  %    Success case prop preproc time    : 0.000
% 0.93/0.68  %    Success case prop encoding time   : 0.000
% 0.93/0.68  %    Success case prop solver time     : 0.000
% 0.93/0.68  % Current number of processed clauses  : 187
% 0.93/0.68  %    Positive orientable unit clauses  : 61
% 0.93/0.68  %    Positive unorientable unit clauses: 0
% 0.93/0.68  %    Negative unit clauses             : 17
% 0.93/0.68  %    Non-unit-clauses                  : 109
% 0.93/0.68  % Current number of unprocessed clauses: 4802
% 0.93/0.68  % ...number of literals in the above   : 55898
% 0.93/0.68  % Current number of archived formulas  : 0
% 0.93/0.68  % Current number of archived clauses   : 2
% 0.93/0.68  % Clause-clause subsumption calls (NU) : 2365
% 0.93/0.68  % Rec. Clause-clause subsumption calls : 1912
% 0.93/0.68  % Non-unit clause-clause subsumptions  : 10
% 0.93/0.68  % Unit Clause-clause subsumption calls : 414
% 0.93/0.68  % Rewrite failures with RHS unbound    : 0
% 0.93/0.68  % BW rewrite match attempts            : 2
% 0.93/0.68  % BW rewrite match successes           : 0
% 0.93/0.68  % Condensation attempts                : 0
% 0.93/0.68  % Condensation successes               : 0
% 0.93/0.68  % Termbank termtop insertions          : 384336
% 0.93/0.68  % Search garbage collected termcells   : 31811
% 0.93/0.68  
% 0.93/0.68  % -------------------------------------------------
% 0.93/0.68  % User time                : 0.222 s
% 0.93/0.68  % System time              : 0.029 s
% 0.93/0.68  % Total time               : 0.252 s
% 0.93/0.68  % Maximum resident set size: 15844 pages
% 0.93/0.68  
% 0.93/0.68  % -------------------------------------------------
% 0.93/0.68  % User time                : 0.635 s
% 0.93/0.68  % System time              : 0.073 s
% 0.93/0.68  % Total time               : 0.708 s
% 0.93/0.68  % Maximum resident set size: 4864 pages
% 0.93/0.68  % E exiting
%------------------------------------------------------------------------------