TSTP Solution File: SET152-6 by E---3.1

View Problem - Process Solution

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

% Computer : n027.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:18:41 EDT 2023

% Result   : Unsatisfiable 0.17s 0.49s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   5 unt;   3 nHn;   9 RR)
%            Number of literals    :   25 (   6 equ;  12 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    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   18 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.WfnQkvwpIS/E---3.1_3312.p',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox2/tmp/tmp.WfnQkvwpIS/E---3.1_3312.p',class_elements_are_sets) ).

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

cnf(regularity1,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.WfnQkvwpIS/E---3.1_3312.p',regularity1) ).

cnf(prove_complement_of_universal_class_1,negated_conjecture,
    complement(universal_class) != null_class,
    file('/export/starexec/sandbox2/tmp/tmp.WfnQkvwpIS/E---3.1_3312.p',prove_complement_of_universal_class_1) ).

cnf(c_0_5,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    subclass_members ).

cnf(c_0_6,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

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

cnf(c_0_8,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    regularity1 ).

cnf(c_0_9,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,plain,
    ( complement(X1) = null_class
    | ~ member(regular(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( X1 = null_class
    | member(regular(X1),universal_class) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    complement(universal_class) != null_class,
    prove_complement_of_universal_class_1 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SET152-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 2400
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Oct  2 18:11:30 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.17/0.46  Running first-order theorem proving
% 0.17/0.46  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.WfnQkvwpIS/E---3.1_3312.p
% 0.17/0.49  # Version: 3.1pre001
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49  # Starting sh5l with 300s (1) cores
% 0.17/0.49  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3390 completed with status 0
% 0.17/0.49  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # No SInE strategy applied
% 0.17/0.49  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.49  # Starting new_bool_1 with 308s (1) cores
% 0.17/0.49  # Starting sh5l with 304s (1) cores
% 0.17/0.49  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.49  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3398 completed with status 0
% 0.17/0.49  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49  # No SInE strategy applied
% 0.17/0.49  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.49  # Preprocessing time       : 0.006 s
% 0.17/0.49  # Presaturation interreduction done
% 0.17/0.49  
% 0.17/0.49  # Proof found!
% 0.17/0.49  # SZS status Unsatisfiable
% 0.17/0.49  # SZS output start CNFRefutation
% See solution above
% 0.17/0.49  # Parsed axioms                        : 113
% 0.17/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.49  # Initial clauses                      : 113
% 0.17/0.49  # Removed in clause preprocessing      : 17
% 0.17/0.49  # Initial clauses in saturation        : 96
% 0.17/0.49  # Processed clauses                    : 167
% 0.17/0.49  # ...of these trivial                  : 0
% 0.17/0.49  # ...subsumed                          : 1
% 0.17/0.49  # ...remaining for further processing  : 166
% 0.17/0.49  # Other redundant clauses eliminated   : 4
% 0.17/0.49  # Clauses deleted for lack of memory   : 0
% 0.17/0.49  # Backward-subsumed                    : 1
% 0.17/0.49  # Backward-rewritten                   : 1
% 0.17/0.49  # Generated clauses                    : 88
% 0.17/0.49  # ...of the previous two non-redundant : 74
% 0.17/0.49  # ...aggressively subsumed             : 0
% 0.17/0.49  # Contextual simplify-reflections      : 0
% 0.17/0.49  # Paramodulations                      : 84
% 0.17/0.49  # Factorizations                       : 0
% 0.17/0.49  # NegExts                              : 0
% 0.17/0.49  # Equation resolutions                 : 4
% 0.17/0.49  # Total rewrite steps                  : 6
% 0.17/0.49  # Propositional unsat checks           : 0
% 0.17/0.49  #    Propositional check models        : 0
% 0.17/0.49  #    Propositional check unsatisfiable : 0
% 0.17/0.49  #    Propositional clauses             : 0
% 0.17/0.49  #    Propositional clauses after purity: 0
% 0.17/0.49  #    Propositional unsat core size     : 0
% 0.17/0.49  #    Propositional preprocessing time  : 0.000
% 0.17/0.49  #    Propositional encoding time       : 0.000
% 0.17/0.49  #    Propositional solver time         : 0.000
% 0.17/0.49  #    Success case prop preproc time    : 0.000
% 0.17/0.49  #    Success case prop encoding time   : 0.000
% 0.17/0.49  #    Success case prop solver time     : 0.000
% 0.17/0.49  # Current number of processed clauses  : 65
% 0.17/0.49  #    Positive orientable unit clauses  : 20
% 0.17/0.49  #    Positive unorientable unit clauses: 0
% 0.17/0.49  #    Negative unit clauses             : 1
% 0.17/0.49  #    Non-unit-clauses                  : 44
% 0.17/0.49  # Current number of unprocessed clauses: 97
% 0.17/0.49  # ...number of literals in the above   : 235
% 0.17/0.49  # Current number of archived formulas  : 0
% 0.17/0.49  # Current number of archived clauses   : 114
% 0.17/0.49  # Clause-clause subsumption calls (NU) : 1481
% 0.17/0.49  # Rec. Clause-clause subsumption calls : 721
% 0.17/0.49  # Non-unit clause-clause subsumptions  : 2
% 0.17/0.49  # Unit Clause-clause subsumption calls : 4
% 0.17/0.49  # Rewrite failures with RHS unbound    : 0
% 0.17/0.49  # BW rewrite match attempts            : 8
% 0.17/0.49  # BW rewrite match successes           : 2
% 0.17/0.49  # Condensation attempts                : 0
% 0.17/0.49  # Condensation successes               : 0
% 0.17/0.49  # Termbank termtop insertions          : 7834
% 0.17/0.49  
% 0.17/0.49  # -------------------------------------------------
% 0.17/0.49  # User time                : 0.011 s
% 0.17/0.49  # System time              : 0.011 s
% 0.17/0.49  # Total time               : 0.021 s
% 0.17/0.49  # Maximum resident set size: 2000 pages
% 0.17/0.49  
% 0.17/0.49  # -------------------------------------------------
% 0.17/0.49  # User time                : 0.063 s
% 0.17/0.49  # System time              : 0.032 s
% 0.17/0.49  # Total time               : 0.095 s
% 0.17/0.49  # Maximum resident set size: 1772 pages
% 0.17/0.49  % E---3.1 exiting
% 0.17/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------