↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM590+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 : n012.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:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__4448_02,hypothesis,
    ( xd = sdtlpdtrp0(xC,xi)
    & xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
    & ! [X1] :
        ( aElementOf0(X1,xY)
      <=> ( X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
          & aElementOf0(X1,sdtlpdtrp0(xN,xi))
          & aElement0(X1) ) )
    & aSet0(xY)
    & ! [X1] :
        ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
       => sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
    & aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4448_02) ).

fof(m__3671,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( isCountable0(sdtlpdtrp0(xN,X1))
        & aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
        & ! [X2] :
            ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
           => aElementOf0(X2,szNzAzT0) )
        & aSet0(sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).

fof(m__,conjecture,
    ( aSubsetOf0(xY,szNzAzT0)
    | ! [X1] :
        ( aElementOf0(X1,xY)
       => aElementOf0(X1,szNzAzT0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__4448,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4448) ).

fof(c_0_4,hypothesis,
    ( xd = sdtlpdtrp0(xC,xi)
    & xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
    & ! [X1] :
        ( aElementOf0(X1,xY)
      <=> ( X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
          & aElementOf0(X1,sdtlpdtrp0(xN,xi))
          & aElement0(X1) ) )
    & aSet0(xY)
    & ! [X1] :
        ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
       => sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
    & aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
    inference(fof_simplification,[status(thm)],[m__4448_02]) ).

fof(c_0_5,hypothesis,
    ! [X42,X43] :
      ( ( ~ aElementOf0(X42,szNzAzT0)
        | isCountable0(sdtlpdtrp0(xN,X42)) )
      & ( ~ aElementOf0(X42,szNzAzT0)
        | aSubsetOf0(sdtlpdtrp0(xN,X42),szNzAzT0) )
      & ( ~ aElementOf0(X42,szNzAzT0)
        | aElementOf0(X43,szNzAzT0)
        | ~ aElementOf0(X43,sdtlpdtrp0(xN,X42)) )
      & ( ~ aElementOf0(X42,szNzAzT0)
        | aSet0(sdtlpdtrp0(xN,X42)) ) ),
    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__3671])])])])]) ).

fof(c_0_6,hypothesis,
    ! [X60,X61] :
      ( xd = sdtlpdtrp0(xC,xi)
      & xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
      & ( aElementOf0(X61,xY)
        | X61 = szmzizndt0(sdtlpdtrp0(xN,xi))
        | ~ aElementOf0(X61,sdtlpdtrp0(xN,xi))
        | ~ aElement0(X61) )
      & ( ~ aElementOf0(X61,xY)
        | X61 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
      & ( ~ aElementOf0(X61,xY)
        | aElementOf0(X61,sdtlpdtrp0(xN,xi)) )
      & ( ~ aElementOf0(X61,xY)
        | aElement0(X61) )
      & aSet0(xY)
      & ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X60)
        | ~ aElementOf0(X60,sdtlpdtrp0(xN,xi)) )
      & aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).

fof(c_0_7,negated_conjecture,
    ~ ( aSubsetOf0(xY,szNzAzT0)
      | ! [X1] :
          ( aElementOf0(X1,xY)
         => aElementOf0(X1,szNzAzT0) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_8,hypothesis,
    ( ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
    | aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_10,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__4448]) ).

fof(c_0_11,negated_conjecture,
    ( ~ aSubsetOf0(xY,szNzAzT0)
    & ~ aElementOf0(esk15_0,szNzAzT0)
    & aElementOf0(esk15_0,xY) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_12,hypothesis,
    ( ~ aElementOf0(X1,xY)
    | aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_13,negated_conjecture,
    aElementOf0(esk15_0,xY),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ aElementOf0(esk15_0,szNzAzT0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NUM590+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Mon Sep 21 02:42:32 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.45/0.55  % Version: 3.5.1
% 0.45/0.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.45/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.45/0.55  % Starting sh5l with 300s (1) cores
% 0.45/0.55  % new_bool_1 with pid 1397758 completed with status 0
% 0.45/0.55  % Result found by new_bool_1
% 0.45/0.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.45/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.45/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.55  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.55  % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.45/0.55  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.45/0.55  % SubtermCWHack with pid 1397760 completed with status 0
% 0.45/0.55  % Result found by SubtermCWHack
% 0.45/0.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.45/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.45/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.55  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.55  % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.45/0.55  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.45/0.55  % Preprocessing time       : 0.059 s
% 0.45/0.55  
% 0.45/0.55  % Proof found!
% 0.45/0.55  % SZS status Theorem
% 0.45/0.55  % SZS output start CNFRefutation
% See solution above
% 0.45/0.55  % Parsed axioms                        : 92
% 0.45/0.55  % Removed by relevancy pruning/SinE    : 5
% 0.45/0.55  % Initial clauses                      : 4806
% 0.45/0.55  % Removed in clause preprocessing      : 7
% 0.45/0.55  % Initial clauses in saturation        : 4799
% 0.45/0.55  % Processed clauses                    : 222
% 0.45/0.55  % ...of these trivial                  : 1
% 0.45/0.55  % ...subsumed                          : 28
% 0.45/0.55  % ...remaining for further processing  : 193
% 0.45/0.55  % Other redundant clauses eliminated   : 14
% 0.45/0.55  % Clauses deleted for lack of memory   : 0
% 0.45/0.55  % Backward-subsumed                    : 4
% 0.45/0.55  % Backward-rewritten                   : 2
% 0.45/0.55  % Generated clauses                    : 239
% 0.45/0.55  % ...of the previous two non-redundant : 191
% 0.45/0.55  % ...aggressively subsumed             : 0
% 0.45/0.55  % Contextual simplify-reflections      : 4
% 0.45/0.55  % Paramodulations                      : 223
% 0.45/0.55  % Factorizations                       : 0
% 0.45/0.55  % NegExts                              : 0
% 0.45/0.55  % Equation resolutions                 : 15
% 0.45/0.55  % Disequality decompositions           : 0
% 0.45/0.55  % Total rewrite steps                  : 161
% 0.45/0.55  % ...of those cached                   : 129
% 0.45/0.55  % Propositional unsat checks           : 0
% 0.45/0.55  %    Propositional check models        : 0
% 0.45/0.55  %    Propositional check unsatisfiable : 0
% 0.45/0.55  %    Propositional clauses             : 0
% 0.45/0.55  %    Propositional clauses after purity: 0
% 0.45/0.55  %    Propositional unsat core size     : 0
% 0.45/0.55  %    Propositional preprocessing time  : 0.000
% 0.45/0.55  %    Propositional encoding time       : 0.000
% 0.45/0.55  %    Propositional solver time         : 0.000
% 0.45/0.55  %    Success case prop preproc time    : 0.000
% 0.45/0.55  %    Success case prop encoding time   : 0.000
% 0.45/0.55  %    Success case prop solver time     : 0.000
% 0.45/0.55  % Current number of processed clauses  : 176
% 0.45/0.55  %    Positive orientable unit clauses  : 54
% 0.45/0.55  %    Positive unorientable unit clauses: 0
% 0.45/0.55  %    Negative unit clauses             : 17
% 0.45/0.55  %    Non-unit-clauses                  : 105
% 0.45/0.55  % Current number of unprocessed clauses: 4764
% 0.45/0.55  % ...number of literals in the above   : 55756
% 0.45/0.55  % Current number of archived formulas  : 0
% 0.45/0.55  % Current number of archived clauses   : 7
% 0.45/0.55  % Clause-clause subsumption calls (NU) : 1922
% 0.45/0.55  % Rec. Clause-clause subsumption calls : 1468
% 0.45/0.55  % Non-unit clause-clause subsumptions  : 18
% 0.45/0.55  % Unit Clause-clause subsumption calls : 386
% 0.45/0.55  % Rewrite failures with RHS unbound    : 0
% 0.45/0.55  % BW rewrite match attempts            : 3
% 0.45/0.55  % BW rewrite match successes           : 3
% 0.45/0.55  % Condensation attempts                : 0
% 0.45/0.55  % Condensation successes               : 0
% 0.45/0.55  % Termbank termtop insertions          : 379472
% 0.45/0.55  % Search garbage collected termcells   : 30668
% 0.45/0.55  
% 0.45/0.55  % -------------------------------------------------
% 0.45/0.55  % User time                : 0.183 s
% 0.45/0.55  % System time              : 0.020 s
% 0.45/0.55  % Total time               : 0.203 s
% 0.45/0.55  % Maximum resident set size: 15824 pages
% 0.45/0.55  
% 0.45/0.55  % -------------------------------------------------
% 0.45/0.55  % User time                : 0.186 s
% 0.45/0.55  % System time              : 0.023 s
% 0.45/0.55  % Total time               : 0.209 s
% 0.45/0.55  % Maximum resident set size: 4608 pages
% 0.45/0.55  % E exiting
%------------------------------------------------------------------------------