TSTP Solution File: NUM623+3 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM623+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:56:41 EDT 2023

% Result   : Theorem 32.76s 4.78s
% Output   : CNFRefutation 32.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  11 unt;   0 def)
%            Number of atoms       :   66 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   58 (  20   ~;  17   |;  16   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn;  10   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mLessASymm,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',mLessASymm) ).

fof(m__5365,hypothesis,
    ( aElementOf0(xx,szNzAzT0)
    & ? [X1] :
        ( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        & sdtlpdtrp0(xe,X1) = xx ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5365) ).

fof(m__5106,hypothesis,
    ( ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,szNzAzT0) )
    & aSubsetOf0(xQ,szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5106) ).

fof(m__5147,hypothesis,
    ( aElementOf0(xp,xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => sdtlseqdt0(xp,X1) )
    & xp = szmzizndt0(xQ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5147) ).

fof(m__5401,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,sdtlpdtrp0(xN,xm))
     => sdtlseqdt0(xx,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5401) ).

fof(m__5481,hypothesis,
    ( aElementOf0(xp,sdtlpdtrp0(xN,xm))
    & aElementOf0(xx,xQ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5481) ).

fof(m__5348,hypothesis,
    ( aElement0(xx)
    & aElementOf0(xx,xQ)
    & xx != szmzizndt0(xQ)
    & aElementOf0(xx,xP) ),
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__5348) ).

fof(m__,conjecture,
    xp = xx,
    file('/export/starexec/sandbox2/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p',m__) ).

fof(c_0_8,plain,
    ! [X26,X27] :
      ( ~ aElementOf0(X26,szNzAzT0)
      | ~ aElementOf0(X27,szNzAzT0)
      | ~ sdtlseqdt0(X26,X27)
      | ~ sdtlseqdt0(X27,X26)
      | X26 = X27 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])]) ).

fof(c_0_9,hypothesis,
    ( aElementOf0(xx,szNzAzT0)
    & aElementOf0(esk1_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & sdtlpdtrp0(xe,esk1_0) = xx ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5365])]) ).

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

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

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

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

cnf(c_0_14,hypothesis,
    aElementOf0(xx,szNzAzT0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_16,hypothesis,
    aElementOf0(xp,xQ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

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

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

cnf(c_0_20,hypothesis,
    aElementOf0(xx,xQ),
    inference(split_conjunct,[status(thm)],[m__5348]) ).

fof(c_0_21,negated_conjecture,
    xp != xx,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_22,hypothesis,
    ( X1 = xx
    | ~ sdtlseqdt0(xx,X1)
    | ~ sdtlseqdt0(X1,xx)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_23,hypothesis,
    aElementOf0(xp,szNzAzT0),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_24,hypothesis,
    sdtlseqdt0(xx,xp),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,hypothesis,
    sdtlseqdt0(xp,xx),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem    : NUM623+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n006.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 2400
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Mon Oct  2 13:31:40 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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/tmp/tmp.4rtFlEtRzP/E---3.1_16604.p
% 32.76/4.78  # Version: 3.1pre001
% 32.76/4.78  # Preprocessing class: FSLSSMSMSSSNFFN.
% 32.76/4.78  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.76/4.78  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 32.76/4.78  # Starting new_bool_3 with 300s (1) cores
% 32.76/4.78  # Starting new_bool_1 with 300s (1) cores
% 32.76/4.78  # Starting sh5l with 300s (1) cores
% 32.76/4.78  # sh5l with pid 16776 completed with status 0
% 32.76/4.78  # Result found by sh5l
% 32.76/4.78  # Preprocessing class: FSLSSMSMSSSNFFN.
% 32.76/4.78  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.76/4.78  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 32.76/4.78  # Starting new_bool_3 with 300s (1) cores
% 32.76/4.78  # Starting new_bool_1 with 300s (1) cores
% 32.76/4.78  # Starting sh5l with 300s (1) cores
% 32.76/4.78  # SinE strategy is gf500_gu_R04_F100_L20000
% 32.76/4.78  # Search class: FGHSF-SMLM32-MFFFFFNN
% 32.76/4.78  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 32.76/4.78  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 32.76/4.78  # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 16835 completed with status 0
% 32.76/4.78  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 32.76/4.78  # Preprocessing class: FSLSSMSMSSSNFFN.
% 32.76/4.78  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.76/4.78  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 32.76/4.78  # Starting new_bool_3 with 300s (1) cores
% 32.76/4.78  # Starting new_bool_1 with 300s (1) cores
% 32.76/4.78  # Starting sh5l with 300s (1) cores
% 32.76/4.78  # SinE strategy is gf500_gu_R04_F100_L20000
% 32.76/4.78  # Search class: FGHSF-SMLM32-MFFFFFNN
% 32.76/4.78  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 32.76/4.78  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 32.76/4.78  # Preprocessing time       : 0.151 s
% 32.76/4.78  # Presaturation interreduction done
% 32.76/4.78  
% 32.76/4.78  # Proof found!
% 32.76/4.78  # SZS status Theorem
% 32.76/4.78  # SZS output start CNFRefutation
% See solution above
% 32.76/4.78  # Parsed axioms                        : 120
% 32.76/4.78  # Removed by relevancy pruning/SinE    : 2
% 32.76/4.78  # Initial clauses                      : 4925
% 32.76/4.78  # Removed in clause preprocessing      : 7
% 32.76/4.78  # Initial clauses in saturation        : 4918
% 32.76/4.78  # Processed clauses                    : 9245
% 32.76/4.78  # ...of these trivial                  : 37
% 32.76/4.78  # ...subsumed                          : 1538
% 32.76/4.78  # ...remaining for further processing  : 7670
% 32.76/4.78  # Other redundant clauses eliminated   : 2036
% 32.76/4.78  # Clauses deleted for lack of memory   : 0
% 32.76/4.78  # Backward-subsumed                    : 18
% 32.76/4.78  # Backward-rewritten                   : 36
% 32.76/4.78  # Generated clauses                    : 11318
% 32.76/4.78  # ...of the previous two non-redundant : 10912
% 32.76/4.78  # ...aggressively subsumed             : 0
% 32.76/4.78  # Contextual simplify-reflections      : 84
% 32.76/4.78  # Paramodulations                      : 9479
% 32.76/4.78  # Factorizations                       : 0
% 32.76/4.78  # NegExts                              : 0
% 32.76/4.78  # Equation resolutions                 : 2039
% 32.76/4.78  # Total rewrite steps                  : 4697
% 32.76/4.78  # Propositional unsat checks           : 0
% 32.76/4.78  #    Propositional check models        : 0
% 32.76/4.78  #    Propositional check unsatisfiable : 0
% 32.76/4.78  #    Propositional clauses             : 0
% 32.76/4.78  #    Propositional clauses after purity: 0
% 32.76/4.78  #    Propositional unsat core size     : 0
% 32.76/4.78  #    Propositional preprocessing time  : 0.000
% 32.76/4.78  #    Propositional encoding time       : 0.000
% 32.76/4.78  #    Propositional solver time         : 0.000
% 32.76/4.78  #    Success case prop preproc time    : 0.000
% 32.76/4.78  #    Success case prop encoding time   : 0.000
% 32.76/4.78  #    Success case prop solver time     : 0.000
% 32.76/4.78  # Current number of processed clauses  : 1774
% 32.76/4.78  #    Positive orientable unit clauses  : 811
% 32.76/4.78  #    Positive unorientable unit clauses: 0
% 32.76/4.78  #    Negative unit clauses             : 130
% 32.76/4.78  #    Non-unit-clauses                  : 833
% 32.76/4.78  # Current number of unprocessed clauses: 10566
% 32.76/4.78  # ...number of literals in the above   : 65685
% 32.76/4.78  # Current number of archived formulas  : 0
% 32.76/4.78  # Current number of archived clauses   : 4060
% 32.76/4.78  # Clause-clause subsumption calls (NU) : 7640226
% 32.76/4.78  # Rec. Clause-clause subsumption calls : 101299
% 32.76/4.78  # Non-unit clause-clause subsumptions  : 1372
% 32.76/4.78  # Unit Clause-clause subsumption calls : 39469
% 32.76/4.78  # Rewrite failures with RHS unbound    : 0
% 32.76/4.78  # BW rewrite match attempts            : 918
% 32.76/4.78  # BW rewrite match successes           : 18
% 32.76/4.78  # Condensation attempts                : 0
% 32.76/4.78  # Condensation successes               : 0
% 32.76/4.78  # Termbank termtop insertions          : 817455
% 32.76/4.78  
% 32.76/4.78  # -------------------------------------------------
% 32.76/4.78  # User time                : 4.151 s
% 32.76/4.78  # System time              : 0.040 s
% 32.76/4.78  # Total time               : 4.191 s
% 32.76/4.78  # Maximum resident set size: 14380 pages
% 32.76/4.78  
% 32.76/4.78  # -------------------------------------------------
% 32.76/4.78  # User time                : 4.157 s
% 32.76/4.78  # System time              : 0.043 s
% 32.76/4.78  # Total time               : 4.200 s
% 32.76/4.78  # Maximum resident set size: 1872 pages
% 32.76/4.78  % E---3.1 exiting
% 32.76/4.78  % E---3.1 exiting
%------------------------------------------------------------------------------