↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 1.26s 0.94s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (  10 unt;   0 def)
%            Number of atoms       :   66 (  14 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   62 (  23   ~;  16   |;  18   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__5106,hypothesis,
    ( aSubsetOf0(xQ,szNzAzT0)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,szNzAzT0) ) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__5147) ).

fof(m__,conjecture,
    xp = xx,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

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

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

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

fof(m__5481,hypothesis,
    ( aElementOf0(xx,xQ)
    & aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5481) ).

fof(c_0_7,hypothesis,
    ! [X69] :
      ( aSubsetOf0(xQ,szNzAzT0)
      & ( aElementOf0(X69,szNzAzT0)
        | ~ aElementOf0(X69,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_8,hypothesis,
    ! [X10] :
      ( xp = szmzizndt0(xQ)
      & ( sdtlseqdt0(xp,X10)
        | ~ aElementOf0(X10,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_9,negated_conjecture,
    xp != xx,
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_10,plain,
    ! [X28,X29] :
      ( X28 = X29
      | ~ sdtlseqdt0(X29,X28)
      | ~ sdtlseqdt0(X28,X29)
      | ~ aElementOf0(X29,szNzAzT0)
      | ~ aElementOf0(X28,szNzAzT0) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).

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

cnf(c_0_12,hypothesis,
    aElementOf0(xp,xQ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_14,negated_conjecture,
    xp != xx,
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

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_10]) ).

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

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

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

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

fof(c_0_20,negated_conjecture,
    xp != xx,
    inference(fof_nnf,[status(thm)],[c_0_14]) ).

cnf(c_0_21,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_11]) ).

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

cnf(c_0_23,hypothesis,
    aElementOf0(xx,xQ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,hypothesis,
    aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[m__5481]) ).

cnf(c_0_25,negated_conjecture,
    xp != xx,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM623+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n020.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 02:46:18 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/0.41  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
% 1.26/0.94  % Version: 3.5.1
% 1.26/0.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.94  % Starting new_bool_3 with 300s (1) cores
% 1.26/0.94  % Starting new_bool_1 with 300s (1) cores
% 1.26/0.94  % Starting sh5l with 300s (1) cores
% 1.26/0.94  % sh5l with pid 1829102 completed with status 0
% 1.26/0.94  % Result found by sh5l
% 1.26/0.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.94  % Starting new_bool_3 with 300s (1) cores
% 1.26/0.94  % Starting new_bool_1 with 300s (1) cores
% 1.26/0.94  % Starting sh5l with 300s (1) cores
% 1.26/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.26/0.94  % SinE strategy is gf500_gu_R04_F100_L20000
% 1.26/0.94  % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.26/0.94  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.26/0.94  % Starting SubtermCWHack with 28s (1) cores
% 1.26/0.94  % SubtermCWHack with pid 1829103 completed with status 0
% 1.26/0.94  % Result found by SubtermCWHack
% 1.26/0.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.94  % Starting new_bool_3 with 300s (1) cores
% 1.26/0.94  % Starting new_bool_1 with 300s (1) cores
% 1.26/0.94  % Starting sh5l with 300s (1) cores
% 1.26/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.26/0.94  % SinE strategy is gf500_gu_R04_F100_L20000
% 1.26/0.94  % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.26/0.94  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.26/0.94  % Starting SubtermCWHack with 28s (1) cores
% 1.26/0.94  % Preprocessing time       : 0.060 s
% 1.26/0.94  
% 1.26/0.94  % Proof found!
% 1.26/0.94  % SZS status Theorem
% 1.26/0.94  % SZS output start CNFRefutation
% See solution above
% 1.26/0.94  % Parsed axioms                        : 120
% 1.26/0.94  % Removed by relevancy pruning/SinE    : 2
% 1.26/0.94  % Initial clauses                      : 4925
% 1.26/0.94  % Removed in clause preprocessing      : 7
% 1.26/0.94  % Initial clauses in saturation        : 4918
% 1.26/0.94  % Processed clauses                    : 2215
% 1.26/0.94  % ...of these trivial                  : 60
% 1.26/0.94  % ...subsumed                          : 722
% 1.26/0.94  % ...remaining for further processing  : 1433
% 1.26/0.94  % Other redundant clauses eliminated   : 57
% 1.26/0.94  % Clauses deleted for lack of memory   : 0
% 1.26/0.94  % Backward-subsumed                    : 155
% 1.26/0.94  % Backward-rewritten                   : 153
% 1.26/0.94  % Generated clauses                    : 8173
% 1.26/0.94  % ...of the previous two non-redundant : 7126
% 1.26/0.94  % ...aggressively subsumed             : 0
% 1.26/0.94  % Contextual simplify-reflections      : 36
% 1.26/0.94  % Paramodulations                      : 8117
% 1.26/0.94  % Factorizations                       : 0
% 1.26/0.94  % NegExts                              : 0
% 1.26/0.94  % Equation resolutions                 : 59
% 1.26/0.94  % Disequality decompositions           : 0
% 1.26/0.94  % Total rewrite steps                  : 5580
% 1.26/0.94  % ...of those cached                   : 5375
% 1.26/0.94  % Propositional unsat checks           : 0
% 1.26/0.94  %    Propositional check models        : 0
% 1.26/0.94  %    Propositional check unsatisfiable : 0
% 1.26/0.94  %    Propositional clauses             : 0
% 1.26/0.94  %    Propositional clauses after purity: 0
% 1.26/0.94  %    Propositional unsat core size     : 0
% 1.26/0.94  %    Propositional preprocessing time  : 0.000
% 1.26/0.94  %    Propositional encoding time       : 0.000
% 1.26/0.94  %    Propositional solver time         : 0.000
% 1.26/0.94  %    Success case prop preproc time    : 0.000
% 1.26/0.94  %    Success case prop encoding time   : 0.000
% 1.26/0.94  %    Success case prop solver time     : 0.000
% 1.26/0.94  % Current number of processed clauses  : 1082
% 1.26/0.94  %    Positive orientable unit clauses  : 231
% 1.26/0.94  %    Positive unorientable unit clauses: 0
% 1.26/0.94  %    Negative unit clauses             : 42
% 1.26/0.94  %    Non-unit-clauses                  : 809
% 1.26/0.94  % Current number of unprocessed clauses: 9078
% 1.26/0.94  % ...number of literals in the above   : 75706
% 1.26/0.94  % Current number of archived formulas  : 0
% 1.26/0.94  % Current number of archived clauses   : 310
% 1.26/0.94  % Clause-clause subsumption calls (NU) : 114971
% 1.26/0.94  % Rec. Clause-clause subsumption calls : 61218
% 1.26/0.94  % Non-unit clause-clause subsumptions  : 605
% 1.26/0.94  % Unit Clause-clause subsumption calls : 8599
% 1.26/0.94  % Rewrite failures with RHS unbound    : 0
% 1.26/0.94  % BW rewrite match attempts            : 136
% 1.26/0.94  % BW rewrite match successes           : 30
% 1.26/0.94  % Condensation attempts                : 0
% 1.26/0.94  % Condensation successes               : 0
% 1.26/0.94  % Termbank termtop insertions          : 516185
% 1.26/0.94  % Search garbage collected termcells   : 31899
% 1.26/0.94  
% 1.26/0.94  % -------------------------------------------------
% 1.26/0.94  % User time                : 0.445 s
% 1.26/0.94  % System time              : 0.044 s
% 1.26/0.94  % Total time               : 0.488 s
% 1.26/0.94  % Maximum resident set size: 16372 pages
% 1.26/0.94  
% 1.26/0.94  % -------------------------------------------------
% 1.26/0.94  % User time                : 0.450 s
% 1.26/0.94  % System time              : 0.050 s
% 1.26/0.94  % Total time               : 0.500 s
% 1.26/0.94  % Maximum resident set size: 5120 pages
% 1.26/0.94  % E exiting
%------------------------------------------------------------------------------