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

View Problem - Process Solution

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

% Computer : n002.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:27 EDT 2023

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   25 (  14 unt;   4 nHn;  21 RR)
%            Number of literals    :   37 (  12 equ;  11 neg)
%            Maximal clause size   :    3 (   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   :   19 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(omega_is_inductive1,axiom,
    inductive(omega),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',omega_is_inductive1) ).

cnf(prove_omega_is_not_null_1,negated_conjecture,
    omega = null_class,
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',prove_omega_is_not_null_1) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',intersection1) ).

cnf(regularity2,axiom,
    ( X1 = null_class
    | intersection(X1,regular(X1)) = null_class ),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',regularity2) ).

cnf(inductive1,axiom,
    ( member(null_class,X1)
    | ~ inductive(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',inductive1) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',complement1) ).

cnf(omega_in_universal,axiom,
    member(omega,universal_class),
    file('/export/starexec/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p',omega_in_universal) ).

cnf(c_0_7,axiom,
    inductive(omega),
    omega_is_inductive1 ).

cnf(c_0_8,negated_conjecture,
    omega = null_class,
    prove_omega_is_not_null_1 ).

cnf(c_0_9,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection1 ).

cnf(c_0_10,axiom,
    ( X1 = null_class
    | intersection(X1,regular(X1)) = null_class ),
    regularity2 ).

cnf(c_0_11,axiom,
    ( member(null_class,X1)
    | ~ inductive(X1) ),
    inductive1 ).

cnf(c_0_12,plain,
    inductive(null_class),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,plain,
    ( X1 = null_class
    | member(X2,X1)
    | ~ member(X2,null_class) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    member(null_class,null_class),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    complement1 ).

cnf(c_0_16,plain,
    ( X1 = null_class
    | member(null_class,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    member(omega,universal_class),
    omega_in_universal ).

cnf(c_0_18,plain,
    ( complement(X1) = null_class
    | ~ member(null_class,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    member(null_class,universal_class),
    inference(rw,[status(thm)],[c_0_17,c_0_8]) ).

cnf(c_0_20,plain,
    complement(null_class) = null_class,
    inference(spm,[status(thm)],[c_0_18,c_0_14]) ).

cnf(c_0_21,plain,
    null_class = complement(universal_class),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    complement(complement(universal_class)) = complement(universal_class),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).

cnf(c_0_23,plain,
    ~ member(X1,complement(universal_class)),
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_21]),c_0_21]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM190-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 15:10:29 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.r9OGFPuaR8/E---3.1_15440.p
% 0.20/0.51  # Version: 3.1pre001
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15517 completed with status 0
% 0.20/0.51  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # No SInE strategy applied
% 0.20/0.51  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 308s (1) cores
% 0.20/0.51  # Starting sh5l with 304s (1) cores
% 0.20/0.51  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.51  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15526 completed with status 0
% 0.20/0.51  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # No SInE strategy applied
% 0.20/0.51  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.003 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 159
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.51  # Initial clauses                      : 159
% 0.20/0.51  # Removed in clause preprocessing      : 19
% 0.20/0.51  # Initial clauses in saturation        : 140
% 0.20/0.51  # Processed clauses                    : 216
% 0.20/0.51  # ...of these trivial                  : 1
% 0.20/0.51  # ...subsumed                          : 1
% 0.20/0.51  # ...remaining for further processing  : 213
% 0.20/0.51  # Other redundant clauses eliminated   : 6
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 34
% 0.20/0.51  # Generated clauses                    : 61
% 0.20/0.51  # ...of the previous two non-redundant : 69
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 55
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 6
% 0.20/0.51  # Total rewrite steps                  : 57
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 34
% 0.20/0.51  #    Positive orientable unit clauses  : 12
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 1
% 0.20/0.51  #    Non-unit-clauses                  : 21
% 0.20/0.51  # Current number of unprocessed clauses: 127
% 0.20/0.51  # ...number of literals in the above   : 290
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 192
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 3124
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 1514
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.51  # Unit Clause-clause subsumption calls : 11
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 20
% 0.20/0.51  # BW rewrite match successes           : 15
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 9410
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.022 s
% 0.20/0.51  # System time              : 0.004 s
% 0.20/0.51  # Total time               : 0.026 s
% 0.20/0.51  # Maximum resident set size: 2208 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.076 s
% 0.20/0.51  # System time              : 0.011 s
% 0.20/0.51  # Total time               : 0.087 s
% 0.20/0.51  # Maximum resident set size: 1816 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------