TSTP Solution File: SET186-6 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n013.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:22:24 EDT 2023

% Result   : Unsatisfiable 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  10 unt;   7 nHn;  18 RR)
%            Number of literals    :   50 (   5 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_subclass_property4_1,negated_conjecture,
    union(x,y) = y,
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',prove_subclass_property4_1) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',union) ).

cnf(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',complement2) ).

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

cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',class_elements_are_sets) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',complement1) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.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.RYqEjNwPFw/E---3.1_1921.p',not_subclass_members2) ).

cnf(prove_subclass_property4_2,negated_conjecture,
    ~ subclass(x,y),
    file('/export/starexec/sandbox/tmp/tmp.RYqEjNwPFw/E---3.1_1921.p',prove_subclass_property4_2) ).

cnf(c_0_10,negated_conjecture,
    union(x,y) = y,
    prove_subclass_property4_1 ).

cnf(c_0_11,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    union ).

cnf(c_0_12,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    complement2 ).

cnf(c_0_13,negated_conjecture,
    complement(intersection(complement(x),complement(y))) = y,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

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

cnf(c_0_15,negated_conjecture,
    ( member(X1,intersection(complement(x),complement(y)))
    | member(X1,y)
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

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

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

cnf(c_0_19,negated_conjecture,
    ( member(X1,complement(x))
    | member(X1,y)
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ( member(X1,y)
    | ~ member(X1,x) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

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

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

cnf(c_0_24,negated_conjecture,
    ( member(not_subclass_element(x,X1),y)
    | subclass(x,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ~ subclass(x,y),
    prove_subclass_property4_2 ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SET186-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n013.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 16:52:29 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.16/0.41  Running first-order model finding
% 0.16/0.41  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.RYqEjNwPFw/E---3.1_1921.p
% 0.16/0.45  # Version: 3.1pre001
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2036 completed with status 0
% 0.16/0.45  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 308s (1) cores
% 0.16/0.45  # Starting sh5l with 304s (1) cores
% 0.16/0.45  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.45  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2048 completed with status 0
% 0.16/0.45  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.002 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Unsatisfiable
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 114
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.45  # Initial clauses                      : 114
% 0.16/0.45  # Removed in clause preprocessing      : 17
% 0.16/0.45  # Initial clauses in saturation        : 97
% 0.16/0.45  # Processed clauses                    : 355
% 0.16/0.45  # ...of these trivial                  : 0
% 0.16/0.45  # ...subsumed                          : 50
% 0.16/0.45  # ...remaining for further processing  : 305
% 0.16/0.45  # Other redundant clauses eliminated   : 4
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 2
% 0.16/0.45  # Backward-rewritten                   : 27
% 0.16/0.45  # Generated clauses                    : 446
% 0.16/0.45  # ...of the previous two non-redundant : 423
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 2
% 0.16/0.45  # Paramodulations                      : 442
% 0.16/0.45  # Factorizations                       : 0
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 4
% 0.16/0.45  # Total rewrite steps                  : 81
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 176
% 0.16/0.45  #    Positive orientable unit clauses  : 25
% 0.16/0.45  #    Positive unorientable unit clauses: 1
% 0.16/0.45  #    Negative unit clauses             : 1
% 0.16/0.45  #    Non-unit-clauses                  : 149
% 0.16/0.45  # Current number of unprocessed clauses: 241
% 0.16/0.45  # ...number of literals in the above   : 727
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 142
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 5666
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 3002
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 54
% 0.16/0.45  # Unit Clause-clause subsumption calls : 13
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 8
% 0.16/0.45  # BW rewrite match successes           : 4
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 19878
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.020 s
% 0.16/0.45  # System time              : 0.006 s
% 0.16/0.45  # Total time               : 0.026 s
% 0.16/0.45  # Maximum resident set size: 2000 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.098 s
% 0.16/0.45  # System time              : 0.017 s
% 0.16/0.45  # Total time               : 0.115 s
% 0.16/0.45  # Maximum resident set size: 1772 pages
% 0.16/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------