↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : NUM624+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:55:45 PM UTC 2026

% Result   : Theorem 1.26s 0.95s
% 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,
    ! [X258] :
      ( aSubsetOf0(xQ,szNzAzT0)
      & ( aElementOf0(X258,szNzAzT0)
        | ~ aElementOf0(X258,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,
    ! [X261] :
      ( xp = szmzizndt0(xQ)
      & ( sdtlseqdt0(xp,X261)
        | ~ aElementOf0(X261,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,
    ! [X73,X74] :
      ( X73 = X74
      | ~ sdtlseqdt0(X74,X73)
      | ~ sdtlseqdt0(X73,X74)
      | ~ aElementOf0(X74,szNzAzT0)
      | ~ aElementOf0(X73,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,
    ! [X268] :
      ( sdtlseqdt0(xx,X268)
      | ~ aElementOf0(X268,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.02  % Problem  : NUM624+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.36  % DateTime : Mon Sep 21 02:45:48 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  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
% 1.26/0.95  % Version: 3.5.1
% 1.26/0.95  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.95  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.95  % Starting new_bool_3 with 300s (1) cores
% 1.26/0.95  % Starting new_bool_1 with 300s (1) cores
% 1.26/0.95  % Starting sh5l with 300s (1) cores
% 1.26/0.95  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2386043 completed with status 0
% 1.26/0.95  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.26/0.95  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.95  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.95  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.95  % No SInE strategy applied
% 1.26/0.95  % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.26/0.95  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.95  % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.95  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.26/0.95  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.26/0.95  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.26/0.95  % Starting new_bool_3 with 136s (1) cores
% 1.26/0.95  % SubtermCWHack with pid 2386146 completed with status 0
% 1.26/0.95  % Result found by SubtermCWHack
% 1.26/0.95  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.95  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.95  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.95  % No SInE strategy applied
% 1.26/0.95  % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.26/0.95  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.95  % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.95  % Preprocessing time       : 0.062 s
% 1.26/0.95  
% 1.26/0.95  % Proof found!
% 1.26/0.95  % SZS status Theorem
% 1.26/0.95  % SZS output start CNFRefutation
% See solution above
% 1.26/0.95  % Parsed axioms                        : 121
% 1.26/0.95  % Removed by relevancy pruning/SinE    : 0
% 1.26/0.95  % Initial clauses                      : 4938
% 1.26/0.95  % Removed in clause preprocessing      : 7
% 1.26/0.95  % Initial clauses in saturation        : 4931
% 1.26/0.95  % Processed clauses                    : 2400
% 1.26/0.95  % ...of these trivial                  : 58
% 1.26/0.95  % ...subsumed                          : 799
% 1.26/0.95  % ...remaining for further processing  : 1543
% 1.26/0.95  % Other redundant clauses eliminated   : 68
% 1.26/0.95  % Clauses deleted for lack of memory   : 0
% 1.26/0.95  % Backward-subsumed                    : 171
% 1.26/0.95  % Backward-rewritten                   : 174
% 1.26/0.95  % Generated clauses                    : 9121
% 1.26/0.95  % ...of the previous two non-redundant : 7975
% 1.26/0.95  % ...aggressively subsumed             : 0
% 1.26/0.95  % Contextual simplify-reflections      : 39
% 1.26/0.95  % Paramodulations                      : 9054
% 1.26/0.95  % Factorizations                       : 0
% 1.26/0.95  % NegExts                              : 0
% 1.26/0.95  % Equation resolutions                 : 70
% 1.26/0.95  % Disequality decompositions           : 0
% 1.26/0.95  % Total rewrite steps                  : 6225
% 1.26/0.95  % ...of those cached                   : 6007
% 1.26/0.95  % Propositional unsat checks           : 0
% 1.26/0.95  %    Propositional check models        : 0
% 1.26/0.95  %    Propositional check unsatisfiable : 0
% 1.26/0.95  %    Propositional clauses             : 0
% 1.26/0.95  %    Propositional clauses after purity: 0
% 1.26/0.95  %    Propositional unsat core size     : 0
% 1.26/0.95  %    Propositional preprocessing time  : 0.000
% 1.26/0.95  %    Propositional encoding time       : 0.000
% 1.26/0.95  %    Propositional solver time         : 0.000
% 1.26/0.95  %    Success case prop preproc time    : 0.000
% 1.26/0.95  %    Success case prop encoding time   : 0.000
% 1.26/0.95  %    Success case prop solver time     : 0.000
% 1.26/0.95  % Current number of processed clauses  : 1149
% 1.26/0.95  %    Positive orientable unit clauses  : 245
% 1.26/0.95  %    Positive unorientable unit clauses: 0
% 1.26/0.95  %    Negative unit clauses             : 42
% 1.26/0.95  %    Non-unit-clauses                  : 862
% 1.26/0.95  % Current number of unprocessed clauses: 9718
% 1.26/0.95  % ...number of literals in the above   : 79036
% 1.26/0.95  % Current number of archived formulas  : 0
% 1.26/0.95  % Current number of archived clauses   : 347
% 1.26/0.95  % Clause-clause subsumption calls (NU) : 116322
% 1.26/0.95  % Rec. Clause-clause subsumption calls : 59085
% 1.26/0.95  % Non-unit clause-clause subsumptions  : 674
% 1.26/0.95  % Unit Clause-clause subsumption calls : 8062
% 1.26/0.95  % Rewrite failures with RHS unbound    : 0
% 1.26/0.95  % BW rewrite match attempts            : 153
% 1.26/0.95  % BW rewrite match successes           : 33
% 1.26/0.95  % Condensation attempts                : 0
% 1.26/0.95  % Condensation successes               : 0
% 1.26/0.95  % Termbank termtop insertions          : 534950
% 1.26/0.95  % Search garbage collected termcells   : 32114
% 1.26/0.95  
% 1.26/0.95  % -------------------------------------------------
% 1.26/0.95  % User time                : 0.484 s
% 1.26/0.95  % System time              : 0.031 s
% 1.26/0.95  % Total time               : 0.515 s
% 1.26/0.95  % Maximum resident set size: 16068 pages
% 1.26/0.95  
% 1.26/0.95  % -------------------------------------------------
% 1.26/0.95  % User time                : 1.341 s
% 1.26/0.95  % System time              : 0.107 s
% 1.26/0.95  % Total time               : 1.448 s
% 1.26/0.95  % Maximum resident set size: 5120 pages
% 1.26/0.95  % E exiting
%------------------------------------------------------------------------------