↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 3.35s 1.29s
% Output   : CNFRefutation 3.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  11 unt;   0 def)
%            Number of atoms       :  102 (  19 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   98 (  31   ~;  23   |;  33   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;  10 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__5106,hypothesis,
    ( aSubsetOf0(xQ,szNzAzT0)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,szNzAzT0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).

fof(m__5147,hypothesis,
    ( xp = szmzizndt0(xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => sdtlseqdt0(xp,X1) )
    & aElementOf0(xp,xQ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).

fof(m__5348,hypothesis,
    ( aElementOf0(xx,xP)
    & xx != szmzizndt0(xQ)
    & aElementOf0(xx,xQ)
    & aElement0(xx) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5348) ).

fof(mLessASymm,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X2,szNzAzT0)
        & aElementOf0(X1,szNzAzT0) )
     => ( ( sdtlseqdt0(X2,X1)
          & sdtlseqdt0(X1,X2) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).

fof(m__5401,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,sdtlpdtrp0(xN,xm))
     => sdtlseqdt0(xx,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5401) ).

fof(m__,conjecture,
    ( ( aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
      & ! [X1] :
          ( aElementOf0(X1,sdtlpdtrp0(xN,xn))
         => aElementOf0(X1,sdtlpdtrp0(xN,xm)) ) )
   => aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

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/sandbox/benchmark/theBenchmark.p',m__4660) ).

fof(m__5309,hypothesis,
    ( sdtlpdtrp0(xe,xn) = xp
    & aElementOf0(xn,szNzAzT0)
    & aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
    & aElementOf0(xn,szDzozmdt0(xd)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5309) ).

fof(c_0_8,hypothesis,
    ! [X88] :
      ( aSubsetOf0(xQ,szNzAzT0)
      & ( aElementOf0(X88,szNzAzT0)
        | ~ aElementOf0(X88,xQ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5106])])])]) ).

fof(c_0_9,hypothesis,
    ! [X91] :
      ( xp = szmzizndt0(xQ)
      & ( sdtlseqdt0(xp,X91)
        | ~ aElementOf0(X91,xQ) )
      & aElementOf0(xp,xQ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])])]) ).

fof(c_0_10,hypothesis,
    ( aElementOf0(xx,xP)
    & xx != szmzizndt0(xQ)
    & aElementOf0(xx,xQ)
    & aElement0(xx) ),
    inference(fof_simplification,[status(thm)],[m__5348]) ).

fof(c_0_11,plain,
    ! [X215,X216] :
      ( X215 = X216
      | ~ sdtlseqdt0(X216,X215)
      | ~ sdtlseqdt0(X215,X216)
      | ~ aElementOf0(X216,szNzAzT0)
      | ~ aElementOf0(X215,szNzAzT0) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).

cnf(c_0_12,hypothesis,
    ( ~ aElementOf0(X1,xQ)
    | aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,hypothesis,
    aElementOf0(xp,xQ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_14,hypothesis,
    ( aElementOf0(xx,xP)
    & xx != szmzizndt0(xQ)
    & aElementOf0(xx,xQ)
    & aElement0(xx) ),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,hypothesis,
    ( ~ aElementOf0(X1,xQ)
    | sdtlseqdt0(xp,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,hypothesis,
    aElementOf0(xp,szNzAzT0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_18,hypothesis,
    ! [X98] :
      ( sdtlseqdt0(xx,X98)
      | ~ aElementOf0(X98,sdtlpdtrp0(xN,xm)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5401])])]) ).

cnf(c_0_19,hypothesis,
    xx != szmzizndt0(xQ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,hypothesis,
    xp = szmzizndt0(xQ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_21,negated_conjecture,
    ~ ( ( aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
        & ! [X1] :
            ( aElementOf0(X1,sdtlpdtrp0(xN,xn))
           => aElementOf0(X1,sdtlpdtrp0(xN,xm)) ) )
     => aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_22,hypothesis,
    ! [X65,X66] :
      ( ( ~ aElementOf0(X65,szNzAzT0)
        | sdtlpdtrp0(xe,X65) = szmzizndt0(sdtlpdtrp0(xN,X65)) )
      & ( ~ aElementOf0(X65,szNzAzT0)
        | sdtlseqdt0(sdtlpdtrp0(xe,X65),X66)
        | ~ aElementOf0(X66,sdtlpdtrp0(xN,X65)) )
      & ( ~ aElementOf0(X65,szNzAzT0)
        | aElementOf0(sdtlpdtrp0(xe,X65),sdtlpdtrp0(xN,X65)) )
      & 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])])])])]) ).

cnf(c_0_23,hypothesis,
    ( ~ aElementOf0(X1,xQ)
    | ~ sdtlseqdt0(X1,xp)
    | X1 = xp ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_12]) ).

cnf(c_0_24,hypothesis,
    ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | sdtlseqdt0(xx,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,hypothesis,
    aElementOf0(xx,xQ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_26,hypothesis,
    xp != xx,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_27,negated_conjecture,
    ! [X100] :
      ( ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
      & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
      & ( aElementOf0(X100,sdtlpdtrp0(xN,xm))
        | ~ aElementOf0(X100,sdtlpdtrp0(xN,xn)) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).

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

cnf(c_0_29,hypothesis,
    sdtlpdtrp0(xe,xn) = xp,
    inference(split_conjunct,[status(thm)],[m__5309]) ).

cnf(c_0_30,hypothesis,
    aElementOf0(xn,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5309]) ).

cnf(c_0_31,hypothesis,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xn))
    | aElementOf0(X1,sdtlpdtrp0(xN,xm)) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_33,hypothesis,
    aElementOf0(xp,sdtlpdtrp0(xN,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM621+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.57  % Computer : n003.cluster.edu
% 0.10/0.57  % Model    : x86_64 x86_64
% 0.10/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57  % Memory   : 8046.5625MB
% 0.10/0.57  % OS       : Linux 6.8.0-71-generic
% 0.10/0.57  % CPULimit : 300
% 0.10/0.57  % WCLimit  : 300
% 0.10/0.57  % DateTime : Mon Sep 21 02:46:46 UTC 2026
% 0.10/0.57  % CPUTime  : 
% 0.10/0.58  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.62  Running first-order theorem proving
% 0.14/0.62  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
% 3.35/1.29  % Version: 3.5.1
% 3.35/1.29  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.35/1.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.35/1.29  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.35/1.29  % Starting new_bool_3 with 300s (1) cores
% 3.35/1.29  % Starting new_bool_1 with 300s (1) cores
% 3.35/1.29  % Starting sh5l with 300s (1) cores
% 3.35/1.29  % new_bool_3 with pid 3239633 completed with status 0
% 3.35/1.29  % Result found by new_bool_3
% 3.35/1.29  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.35/1.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.35/1.29  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.35/1.29  % Starting new_bool_3 with 300s (1) cores
% 3.35/1.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.35/1.29  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.35/1.29  % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.35/1.29  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.35/1.29  % Starting SubtermCWHack with 31s (1) cores
% 3.35/1.29  % SubtermCWHack with pid 3239653 completed with status 0
% 3.35/1.29  % Result found by SubtermCWHack
% 3.35/1.29  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.35/1.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.35/1.29  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.35/1.29  % Starting new_bool_3 with 300s (1) cores
% 3.35/1.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.35/1.29  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.35/1.29  % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.35/1.29  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.35/1.29  % Starting SubtermCWHack with 31s (1) cores
% 3.35/1.29  % Preprocessing time       : 0.127 s
% 3.35/1.29  
% 3.35/1.29  % Proof found!
% 3.35/1.29  % SZS status Theorem
% 3.35/1.29  % SZS output start CNFRefutation
% See solution above
% 3.35/1.29  % Parsed axioms                        : 118
% 3.35/1.29  % Removed by relevancy pruning/SinE    : 9
% 3.35/1.29  % Initial clauses                      : 4906
% 3.35/1.29  % Removed in clause preprocessing      : 7
% 3.35/1.29  % Initial clauses in saturation        : 4899
% 3.35/1.29  % Processed clauses                    : 2083
% 3.35/1.29  % ...of these trivial                  : 58
% 3.35/1.29  % ...subsumed                          : 630
% 3.35/1.29  % ...remaining for further processing  : 1395
% 3.35/1.29  % Other redundant clauses eliminated   : 48
% 3.35/1.29  % Clauses deleted for lack of memory   : 0
% 3.35/1.29  % Backward-subsumed                    : 153
% 3.35/1.29  % Backward-rewritten                   : 148
% 3.35/1.29  % Generated clauses                    : 7599
% 3.35/1.29  % ...of the previous two non-redundant : 6557
% 3.35/1.29  % ...aggressively subsumed             : 0
% 3.35/1.29  % Contextual simplify-reflections      : 30
% 3.35/1.29  % Paramodulations                      : 7552
% 3.35/1.29  % Factorizations                       : 0
% 3.35/1.29  % NegExts                              : 0
% 3.35/1.29  % Equation resolutions                 : 50
% 3.35/1.29  % Disequality decompositions           : 0
% 3.35/1.29  % Total rewrite steps                  : 5470
% 3.35/1.29  % ...of those cached                   : 5268
% 3.35/1.29  % Propositional unsat checks           : 0
% 3.35/1.29  %    Propositional check models        : 0
% 3.35/1.29  %    Propositional check unsatisfiable : 0
% 3.35/1.29  %    Propositional clauses             : 0
% 3.35/1.29  %    Propositional clauses after purity: 0
% 3.35/1.29  %    Propositional unsat core size     : 0
% 3.35/1.29  %    Propositional preprocessing time  : 0.000
% 3.35/1.29  %    Propositional encoding time       : 0.000
% 3.35/1.29  %    Propositional solver time         : 0.000
% 3.35/1.29  %    Success case prop preproc time    : 0.000
% 3.35/1.29  %    Success case prop encoding time   : 0.000
% 3.35/1.29  %    Success case prop solver time     : 0.000
% 3.35/1.29  % Current number of processed clauses  : 1056
% 3.35/1.29  %    Positive orientable unit clauses  : 226
% 3.35/1.29  %    Positive unorientable unit clauses: 0
% 3.35/1.29  %    Negative unit clauses             : 40
% 3.35/1.29  %    Non-unit-clauses                  : 790
% 3.35/1.29  % Current number of unprocessed clauses: 8671
% 3.35/1.29  % ...number of literals in the above   : 73575
% 3.35/1.29  % Current number of archived formulas  : 0
% 3.35/1.29  % Current number of archived clauses   : 303
% 3.35/1.29  % Clause-clause subsumption calls (NU) : 106079
% 3.35/1.29  % Rec. Clause-clause subsumption calls : 56706
% 3.35/1.29  % Non-unit clause-clause subsumptions  : 525
% 3.35/1.29  % Unit Clause-clause subsumption calls : 8136
% 3.35/1.29  % Rewrite failures with RHS unbound    : 0
% 3.35/1.29  % BW rewrite match attempts            : 137
% 3.35/1.29  % BW rewrite match successes           : 28
% 3.35/1.29  % Condensation attempts                : 0
% 3.35/1.29  % Condensation successes               : 0
% 3.35/1.29  % Termbank termtop insertions          : 504415
% 3.35/1.29  % Search garbage collected termcells   : 31600
% 3.35/1.29  
% 3.35/1.29  % -------------------------------------------------
% 3.35/1.29  % User time                : 0.527 s
% 3.35/1.29  % System time              : 0.034 s
% 3.35/1.29  % Total time               : 0.561 s
% 3.35/1.29  % Maximum resident set size: 16104 pages
% 3.35/1.29  
% 3.35/1.29  % -------------------------------------------------
% 3.35/1.29  % User time                : 0.533 s
% 3.35/1.29  % System time              : 0.043 s
% 3.35/1.29  % Total time               : 0.576 s
% 3.35/1.29  % Maximum resident set size: 4864 pages
% 3.35/1.29  % E exiting
%------------------------------------------------------------------------------