↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM539+2 : 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 : n026.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:29 PM UTC 2026

% Result   : Theorem 0.18s 0.46s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   89 (  12 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   98 (  29   ~;  23   |;  34   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :   26 (   0 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__1779,hypothesis,
    ( ~ ( xT = slcrc0
        | ~ ? [X1] : aElementOf0(X1,xT) )
    & ~ ( xS = slcrc0
        | ~ ? [X1] : aElementOf0(X1,xS) )
    & aSubsetOf0(xT,szNzAzT0)
    & ! [X1] :
        ( aElementOf0(X1,xT)
       => aElementOf0(X1,szNzAzT0) )
    & aSet0(xT)
    & aSubsetOf0(xS,szNzAzT0)
    & ! [X1] :
        ( aElementOf0(X1,xS)
       => aElementOf0(X1,szNzAzT0) )
    & aSet0(xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1779) ).

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

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__,conjecture,
    ( ( ! [X1] :
          ( aElementOf0(X1,xS)
         => sdtlseqdt0(szmzizndt0(xS),X1) )
      & aElementOf0(szmzizndt0(xS),xS) )
   => ( szmzizndt0(xS) = szmzizndt0(xT)
      | ! [X1] :
          ( aElementOf0(X1,xT)
         => sdtlseqdt0(szmzizndt0(xS),X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(c_0_4,hypothesis,
    ! [X5,X6] :
      ( xT != slcrc0
      & aElementOf0(esk2_0,xT)
      & xS != slcrc0
      & aElementOf0(esk1_0,xS)
      & aSubsetOf0(xT,szNzAzT0)
      & ( aElementOf0(X6,szNzAzT0)
        | ~ aElementOf0(X6,xT) )
      & aSet0(xT)
      & aSubsetOf0(xS,szNzAzT0)
      & ( aElementOf0(X5,szNzAzT0)
        | ~ aElementOf0(X5,xS) )
      & aSet0(xS) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1779])])])])]) ).

fof(c_0_5,hypothesis,
    ! [X9,X10] :
      ( aElementOf0(szmzizndt0(xT),xS)
      & ( sdtlseqdt0(szmzizndt0(xT),X10)
        | ~ aElementOf0(X10,xT) )
      & aElementOf0(szmzizndt0(xT),xT)
      & aElementOf0(szmzizndt0(xS),xT)
      & ( sdtlseqdt0(szmzizndt0(xS),X9)
        | ~ aElementOf0(X9,xS) )
      & aElementOf0(szmzizndt0(xS),xS) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1802])])])]) ).

fof(c_0_6,plain,
    ! [X40,X41] :
      ( X40 = X41
      | ~ sdtlseqdt0(X41,X40)
      | ~ sdtlseqdt0(X40,X41)
      | ~ aElementOf0(X41,szNzAzT0)
      | ~ aElementOf0(X40,szNzAzT0) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).

cnf(c_0_7,hypothesis,
    ( ~ aElementOf0(X1,xS)
    | aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,hypothesis,
    aElementOf0(szmzizndt0(xT),xS),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_9,negated_conjecture,
    ~ ( ( ! [X1] :
            ( aElementOf0(X1,xS)
           => sdtlseqdt0(szmzizndt0(xS),X1) )
        & aElementOf0(szmzizndt0(xS),xS) )
     => ( szmzizndt0(xS) = szmzizndt0(xT)
        | ! [X1] :
            ( aElementOf0(X1,xT)
           => sdtlseqdt0(szmzizndt0(xS),X1) ) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

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

cnf(c_0_11,hypothesis,
    ( ~ aElementOf0(X1,xT)
    | sdtlseqdt0(szmzizndt0(xT),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,hypothesis,
    aElementOf0(szmzizndt0(xT),szNzAzT0),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,hypothesis,
    ( ~ aElementOf0(X1,xT)
    | aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_14,negated_conjecture,
    ! [X11] :
      ( szmzizndt0(xS) != szmzizndt0(xT)
      & ~ sdtlseqdt0(szmzizndt0(xS),esk3_0)
      & aElementOf0(esk3_0,xT)
      & ( sdtlseqdt0(szmzizndt0(xS),X11)
        | ~ aElementOf0(X11,xS) )
      & aElementOf0(szmzizndt0(xS),xS) ),
    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_9])])])])]) ).

cnf(c_0_15,hypothesis,
    ( ~ aElementOf0(X1,xT)
    | ~ sdtlseqdt0(X1,szmzizndt0(xT))
    | X1 = szmzizndt0(xT) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).

cnf(c_0_16,hypothesis,
    ( ~ aElementOf0(X1,xS)
    | sdtlseqdt0(szmzizndt0(xS),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_17,hypothesis,
    aElementOf0(szmzizndt0(xS),xT),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,negated_conjecture,
    szmzizndt0(xS) != szmzizndt0(xT),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_8])]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM539+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n026.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 21 02:41:22 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  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
% 0.18/0.46  % Version: 3.5.1
% 0.18/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  % Starting sh5l with 300s (1) cores
% 0.18/0.46  % new_bool_1 with pid 1190705 completed with status 0
% 0.18/0.46  % Result found by new_bool_1
% 0.18/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.18/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.46  % SubtermCWHack with pid 1190707 completed with status 0
% 0.18/0.46  % Result found by SubtermCWHack
% 0.18/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.18/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.46  % Preprocessing time       : 0.002 s
% 0.18/0.46  
% 0.18/0.46  % Proof found!
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  % SZS output start CNFRefutation
% See solution above
% 0.18/0.46  % Parsed axioms                        : 51
% 0.18/0.46  % Removed by relevancy pruning/SinE    : 3
% 0.18/0.46  % Initial clauses                      : 97
% 0.18/0.46  % Removed in clause preprocessing      : 5
% 0.18/0.46  % Initial clauses in saturation        : 92
% 0.18/0.46  % Processed clauses                    : 177
% 0.18/0.46  % ...of these trivial                  : 8
% 0.18/0.46  % ...subsumed                          : 24
% 0.18/0.46  % ...remaining for further processing  : 145
% 0.18/0.46  % Other redundant clauses eliminated   : 18
% 0.18/0.46  % Clauses deleted for lack of memory   : 0
% 0.18/0.46  % Backward-subsumed                    : 3
% 0.18/0.46  % Backward-rewritten                   : 1
% 0.18/0.46  % Generated clauses                    : 217
% 0.18/0.46  % ...of the previous two non-redundant : 154
% 0.18/0.46  % ...aggressively subsumed             : 0
% 0.18/0.46  % Contextual simplify-reflections      : 10
% 0.18/0.46  % Paramodulations                      : 200
% 0.18/0.46  % Factorizations                       : 0
% 0.18/0.46  % NegExts                              : 0
% 0.18/0.46  % Equation resolutions                 : 19
% 0.18/0.46  % Disequality decompositions           : 0
% 0.18/0.46  % Total rewrite steps                  : 141
% 0.18/0.46  % ...of those cached                   : 118
% 0.18/0.46  % Propositional unsat checks           : 0
% 0.18/0.46  %    Propositional check models        : 0
% 0.18/0.46  %    Propositional check unsatisfiable : 0
% 0.18/0.46  %    Propositional clauses             : 0
% 0.18/0.46  %    Propositional clauses after purity: 0
% 0.18/0.46  %    Propositional unsat core size     : 0
% 0.18/0.46  %    Propositional preprocessing time  : 0.000
% 0.18/0.46  %    Propositional encoding time       : 0.000
% 0.18/0.46  %    Propositional solver time         : 0.000
% 0.18/0.46  %    Success case prop preproc time    : 0.000
% 0.18/0.46  %    Success case prop encoding time   : 0.000
% 0.18/0.46  %    Success case prop solver time     : 0.000
% 0.18/0.46  % Current number of processed clauses  : 127
% 0.18/0.46  %    Positive orientable unit clauses  : 34
% 0.18/0.46  %    Positive unorientable unit clauses: 0
% 0.18/0.46  %    Negative unit clauses             : 9
% 0.18/0.46  %    Non-unit-clauses                  : 84
% 0.18/0.46  % Current number of unprocessed clauses: 66
% 0.18/0.46  % ...number of literals in the above   : 394
% 0.18/0.46  % Current number of archived formulas  : 0
% 0.18/0.46  % Current number of archived clauses   : 4
% 0.18/0.46  % Clause-clause subsumption calls (NU) : 948
% 0.18/0.46  % Rec. Clause-clause subsumption calls : 357
% 0.18/0.46  % Non-unit clause-clause subsumptions  : 27
% 0.18/0.46  % Unit Clause-clause subsumption calls : 34
% 0.18/0.46  % Rewrite failures with RHS unbound    : 0
% 0.18/0.46  % BW rewrite match attempts            : 1
% 0.18/0.46  % BW rewrite match successes           : 1
% 0.18/0.46  % Condensation attempts                : 0
% 0.18/0.46  % Condensation successes               : 0
% 0.18/0.46  % Termbank termtop insertions          : 10376
% 0.18/0.46  % Search garbage collected termcells   : 1705
% 0.18/0.46  
% 0.18/0.46  % -------------------------------------------------
% 0.18/0.46  % User time                : 0.014 s
% 0.18/0.46  % System time              : 0.004 s
% 0.18/0.46  % Total time               : 0.018 s
% 0.18/0.46  % Maximum resident set size: 3948 pages
% 0.18/0.46  
% 0.18/0.46  % -------------------------------------------------
% 0.18/0.46  % User time                : 0.015 s
% 0.18/0.46  % System time              : 0.010 s
% 0.18/0.46  % Total time               : 0.026 s
% 0.18/0.46  % Maximum resident set size: 4864 pages
% 0.18/0.46  % E exiting
%------------------------------------------------------------------------------