TSTP Solution File: NUM622+3 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n008.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 19:08:01 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__4660,hypothesis,
    ( aFunction0(xe)
    & szDzozmdt0(xe) = szNzAzT0
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
          & ! [X2] :
              ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
             => sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
          & sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.jQS9slZ4Si/E---3.1_4933.p',m__4660) ).

fof(m__5461,hypothesis,
    ( ! [X1] :
        ( aElementOf0(X1,sdtlpdtrp0(xN,xn))
       => aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
    & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    file('/export/starexec/sandbox/tmp/tmp.jQS9slZ4Si/E---3.1_4933.p',m__5461) ).

fof(m__5309,hypothesis,
    ( aElementOf0(xn,szDzozmdt0(xd))
    & sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
    & aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(xn,szNzAzT0)
    & sdtlpdtrp0(xe,xn) = xp ),
    file('/export/starexec/sandbox/tmp/tmp.jQS9slZ4Si/E---3.1_4933.p',m__5309) ).

fof(m__,conjecture,
    aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    file('/export/starexec/sandbox/tmp/tmp.jQS9slZ4Si/E---3.1_4933.p',m__) ).

fof(c_0_4,hypothesis,
    ! [X69,X70] :
      ( aFunction0(xe)
      & szDzozmdt0(xe) = szNzAzT0
      & ( aElementOf0(sdtlpdtrp0(xe,X69),sdtlpdtrp0(xN,X69))
        | ~ aElementOf0(X69,szNzAzT0) )
      & ( ~ aElementOf0(X70,sdtlpdtrp0(xN,X69))
        | sdtlseqdt0(sdtlpdtrp0(xe,X69),X70)
        | ~ aElementOf0(X69,szNzAzT0) )
      & ( sdtlpdtrp0(xe,X69) = szmzizndt0(sdtlpdtrp0(xN,X69))
        | ~ aElementOf0(X69,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])]) ).

fof(c_0_5,hypothesis,
    ! [X87] :
      ( ( ~ aElementOf0(X87,sdtlpdtrp0(xN,xn))
        | aElementOf0(X87,sdtlpdtrp0(xN,xm)) )
      & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5461])])]) ).

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

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

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

fof(c_0_9,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_10,hypothesis,
    ( aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xn)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,hypothesis,
    aElementOf0(xp,sdtlpdtrp0(xN,xn)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : NUM622+3 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 2400
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon Oct  2 13:47:58 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.46  Running first-order model finding
% 0.17/0.46  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jQS9slZ4Si/E---3.1_4933.p
% 41.74/5.85  # Version: 3.1pre001
% 41.74/5.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.74/5.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.74/5.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.74/5.85  # Starting new_bool_3 with 300s (1) cores
% 41.74/5.85  # Starting new_bool_1 with 300s (1) cores
% 41.74/5.85  # Starting sh5l with 300s (1) cores
% 41.74/5.85  # sh5l with pid 5013 completed with status 0
% 41.74/5.85  # Result found by sh5l
% 41.74/5.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.74/5.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.74/5.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.74/5.85  # Starting new_bool_3 with 300s (1) cores
% 41.74/5.85  # Starting new_bool_1 with 300s (1) cores
% 41.74/5.85  # Starting sh5l with 300s (1) cores
% 41.74/5.85  # SinE strategy is gf500_gu_R04_F100_L20000
% 41.74/5.85  # Search class: FGHSF-SMLM32-MFFFFFNN
% 41.74/5.85  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.74/5.85  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 41.74/5.85  # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 5020 completed with status 0
% 41.74/5.85  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 41.74/5.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.74/5.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.74/5.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.74/5.85  # Starting new_bool_3 with 300s (1) cores
% 41.74/5.85  # Starting new_bool_1 with 300s (1) cores
% 41.74/5.85  # Starting sh5l with 300s (1) cores
% 41.74/5.85  # SinE strategy is gf500_gu_R04_F100_L20000
% 41.74/5.85  # Search class: FGHSF-SMLM32-MFFFFFNN
% 41.74/5.85  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.74/5.85  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 41.74/5.85  # Preprocessing time       : 0.113 s
% 41.74/5.85  # Presaturation interreduction done
% 41.74/5.85  
% 41.74/5.85  # Proof found!
% 41.74/5.85  # SZS status Theorem
% 41.74/5.85  # SZS output start CNFRefutation
% See solution above
% 41.74/5.85  # Parsed axioms                        : 119
% 41.74/5.85  # Removed by relevancy pruning/SinE    : 2
% 41.74/5.85  # Initial clauses                      : 4923
% 41.74/5.85  # Removed in clause preprocessing      : 7
% 41.74/5.85  # Initial clauses in saturation        : 4916
% 41.74/5.85  # Processed clauses                    : 7054
% 41.74/5.85  # ...of these trivial                  : 8
% 41.74/5.85  # ...subsumed                          : 909
% 41.74/5.85  # ...remaining for further processing  : 6137
% 41.74/5.85  # Other redundant clauses eliminated   : 2036
% 41.74/5.85  # Clauses deleted for lack of memory   : 0
% 41.74/5.85  # Backward-subsumed                    : 12
% 41.74/5.85  # Backward-rewritten                   : 3
% 41.74/5.85  # Generated clauses                    : 2266
% 41.74/5.85  # ...of the previous two non-redundant : 2226
% 41.74/5.85  # ...aggressively subsumed             : 0
% 41.74/5.85  # Contextual simplify-reflections      : 71
% 41.74/5.85  # Paramodulations                      : 430
% 41.74/5.85  # Factorizations                       : 0
% 41.74/5.85  # NegExts                              : 0
% 41.74/5.85  # Equation resolutions                 : 2036
% 41.74/5.85  # Total rewrite steps                  : 237
% 41.74/5.85  # Propositional unsat checks           : 0
% 41.74/5.85  #    Propositional check models        : 0
% 41.74/5.85  #    Propositional check unsatisfiable : 0
% 41.74/5.85  #    Propositional clauses             : 0
% 41.74/5.85  #    Propositional clauses after purity: 0
% 41.74/5.85  #    Propositional unsat core size     : 0
% 41.74/5.85  #    Propositional preprocessing time  : 0.000
% 41.74/5.85  #    Propositional encoding time       : 0.000
% 41.74/5.85  #    Propositional solver time         : 0.000
% 41.74/5.85  #    Success case prop preproc time    : 0.000
% 41.74/5.85  #    Success case prop encoding time   : 0.000
% 41.74/5.85  #    Success case prop solver time     : 0.000
% 41.74/5.85  # Current number of processed clauses  : 280
% 41.74/5.85  #    Positive orientable unit clauses  : 173
% 41.74/5.85  #    Positive unorientable unit clauses: 0
% 41.74/5.85  #    Negative unit clauses             : 28
% 41.74/5.85  #    Non-unit-clauses                  : 79
% 41.74/5.85  # Current number of unprocessed clauses: 4094
% 41.74/5.85  # ...number of literals in the above   : 44412
% 41.74/5.85  # Current number of archived formulas  : 0
% 41.74/5.85  # Current number of archived clauses   : 4021
% 41.74/5.85  # Clause-clause subsumption calls (NU) : 7571808
% 41.74/5.85  # Rec. Clause-clause subsumption calls : 74402
% 41.74/5.85  # Non-unit clause-clause subsumptions  : 980
% 41.74/5.85  # Unit Clause-clause subsumption calls : 1784
% 41.74/5.85  # Rewrite failures with RHS unbound    : 0
% 41.74/5.85  # BW rewrite match attempts            : 3
% 41.74/5.85  # BW rewrite match successes           : 3
% 41.74/5.85  # Condensation attempts                : 0
% 41.74/5.85  # Condensation successes               : 0
% 41.74/5.85  # Termbank termtop insertions          : 667113
% 41.74/5.85  
% 41.74/5.85  # -------------------------------------------------
% 41.74/5.85  # User time                : 5.181 s
% 41.74/5.85  # System time              : 0.032 s
% 41.74/5.85  # Total time               : 5.213 s
% 41.74/5.85  # Maximum resident set size: 14460 pages
% 41.74/5.85  
% 41.74/5.85  # -------------------------------------------------
% 41.74/5.85  # User time                : 5.185 s
% 41.74/5.85  # System time              : 0.034 s
% 41.74/5.85  # Total time               : 5.219 s
% 41.74/5.85  # Maximum resident set size: 1876 pages
% 41.74/5.85  % E---3.1 exiting
%------------------------------------------------------------------------------