TSTP Solution File: NUM180-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUM180-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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:58:26 EDT 2023

% Result   : Unsatisfiable 0.23s 0.57s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   5 unt;   3 nHn;  10 RR)
%            Number of literals    :   21 (   2 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.2AMdzDImzS/E---3.1_3637.p',intersection2) ).

cnf(limit_ordinals,axiom,
    intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
    file('/export/starexec/sandbox/tmp/tmp.2AMdzDImzS/E---3.1_3637.p',limit_ordinals) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.2AMdzDImzS/E---3.1_3637.p',not_subclass_members1) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/tmp.2AMdzDImzS/E---3.1_3637.p',not_subclass_members2) ).

cnf(prove_limit_ordinals_are_ordinals_1,negated_conjecture,
    ~ subclass(limit_ordinals,ordinal_numbers),
    file('/export/starexec/sandbox/tmp/tmp.2AMdzDImzS/E---3.1_3637.p',prove_limit_ordinals_are_ordinals_1) ).

cnf(c_0_5,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_6,axiom,
    intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
    limit_ordinals ).

cnf(c_0_7,plain,
    ( member(X1,ordinal_numbers)
    | ~ member(X1,limit_ordinals) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    not_subclass_members1 ).

cnf(c_0_9,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    not_subclass_members2 ).

cnf(c_0_10,plain,
    ( member(not_subclass_element(limit_ordinals,X1),ordinal_numbers)
    | subclass(limit_ordinals,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ subclass(limit_ordinals,ordinal_numbers),
    prove_limit_ordinals_are_ordinals_1 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : NUM180-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n011.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon Oct  2 13:57:53 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.23/0.52  Running first-order model finding
% 0.23/0.52  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.2AMdzDImzS/E---3.1_3637.p
% 0.23/0.57  # Version: 3.1pre001
% 0.23/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.57  # Starting sh5l with 300s (1) cores
% 0.23/0.57  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3715 completed with status 0
% 0.23/0.57  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57  # No SInE strategy applied
% 0.23/0.57  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.57  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.23/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57  # Starting new_bool_1 with 308s (1) cores
% 0.23/0.57  # Starting sh5l with 304s (1) cores
% 0.23/0.57  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.57  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3722 completed with status 0
% 0.23/0.57  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57  # No SInE strategy applied
% 0.23/0.57  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.57  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.23/0.57  # Preprocessing time       : 0.004 s
% 0.23/0.57  # Presaturation interreduction done
% 0.23/0.57  
% 0.23/0.57  # Proof found!
% 0.23/0.57  # SZS status Unsatisfiable
% 0.23/0.57  # SZS output start CNFRefutation
% See solution above
% 0.23/0.57  # Parsed axioms                        : 159
% 0.23/0.57  # Removed by relevancy pruning/SinE    : 0
% 0.23/0.57  # Initial clauses                      : 159
% 0.23/0.57  # Removed in clause preprocessing      : 19
% 0.23/0.57  # Initial clauses in saturation        : 140
% 0.23/0.57  # Processed clauses                    : 224
% 0.23/0.57  # ...of these trivial                  : 0
% 0.23/0.57  # ...subsumed                          : 3
% 0.23/0.57  # ...remaining for further processing  : 221
% 0.23/0.57  # Other redundant clauses eliminated   : 6
% 0.23/0.57  # Clauses deleted for lack of memory   : 0
% 0.23/0.57  # Backward-subsumed                    : 0
% 0.23/0.57  # Backward-rewritten                   : 0
% 0.23/0.57  # Generated clauses                    : 80
% 0.23/0.57  # ...of the previous two non-redundant : 70
% 0.23/0.57  # ...aggressively subsumed             : 0
% 0.23/0.57  # Contextual simplify-reflections      : 0
% 0.23/0.57  # Paramodulations                      : 74
% 0.23/0.57  # Factorizations                       : 0
% 0.23/0.57  # NegExts                              : 0
% 0.23/0.57  # Equation resolutions                 : 6
% 0.23/0.57  # Total rewrite steps                  : 8
% 0.23/0.57  # Propositional unsat checks           : 0
% 0.23/0.57  #    Propositional check models        : 0
% 0.23/0.57  #    Propositional check unsatisfiable : 0
% 0.23/0.57  #    Propositional clauses             : 0
% 0.23/0.57  #    Propositional clauses after purity: 0
% 0.23/0.57  #    Propositional unsat core size     : 0
% 0.23/0.57  #    Propositional preprocessing time  : 0.000
% 0.23/0.57  #    Propositional encoding time       : 0.000
% 0.23/0.57  #    Propositional solver time         : 0.000
% 0.23/0.57  #    Success case prop preproc time    : 0.000
% 0.23/0.57  #    Success case prop encoding time   : 0.000
% 0.23/0.57  #    Success case prop solver time     : 0.000
% 0.23/0.57  # Current number of processed clauses  : 76
% 0.23/0.57  #    Positive orientable unit clauses  : 21
% 0.23/0.57  #    Positive unorientable unit clauses: 0
% 0.23/0.57  #    Negative unit clauses             : 1
% 0.23/0.57  #    Non-unit-clauses                  : 54
% 0.23/0.57  # Current number of unprocessed clauses: 124
% 0.23/0.57  # ...number of literals in the above   : 295
% 0.23/0.57  # Current number of archived formulas  : 0
% 0.23/0.57  # Current number of archived clauses   : 158
% 0.23/0.57  # Clause-clause subsumption calls (NU) : 3113
% 0.23/0.57  # Rec. Clause-clause subsumption calls : 1546
% 0.23/0.57  # Non-unit clause-clause subsumptions  : 3
% 0.23/0.57  # Unit Clause-clause subsumption calls : 7
% 0.23/0.57  # Rewrite failures with RHS unbound    : 0
% 0.23/0.57  # BW rewrite match attempts            : 12
% 0.23/0.57  # BW rewrite match successes           : 2
% 0.23/0.57  # Condensation attempts                : 0
% 0.23/0.57  # Condensation successes               : 0
% 0.23/0.57  # Termbank termtop insertions          : 9687
% 0.23/0.57  
% 0.23/0.57  # -------------------------------------------------
% 0.23/0.57  # User time                : 0.025 s
% 0.23/0.57  # System time              : 0.007 s
% 0.23/0.57  # Total time               : 0.031 s
% 0.23/0.57  # Maximum resident set size: 2204 pages
% 0.23/0.57  
% 0.23/0.57  # -------------------------------------------------
% 0.23/0.57  # User time                : 0.090 s
% 0.23/0.57  # System time              : 0.016 s
% 0.23/0.57  # Total time               : 0.106 s
% 0.23/0.57  # Maximum resident set size: 1816 pages
% 0.23/0.57  % E---3.1 exiting
%------------------------------------------------------------------------------