TSTP Solution File: SET195-6 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET195-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 02:53:36 EDT 2024

% Result   : Unsatisfiable 4.25s 0.98s
% Output   : CNFRefutation 4.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   55 (  16 unt;  11 nHn;  34 RR)
%            Number of literals    :  107 (   8 equ;  49 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   :  109 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

cnf(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).

cnf(intersection3,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).

cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).

cnf(subclass_implies_equal,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).

cnf(prove_lattice_upper_bound2_1,negated_conjecture,
    ~ subclass(y,union(x,y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lattice_upper_bound2_1) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).

cnf(c_0_12,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    inference(fof_simplification,[status(thm)],[subclass_members]) ).

cnf(c_0_13,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    c_0_12 ).

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

cnf(c_0_15,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).

cnf(c_0_16,plain,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    inference(fof_simplification,[status(thm)],[complement2]) ).

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

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

cnf(c_0_19,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[complement1]) ).

cnf(c_0_20,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    c_0_15 ).

cnf(c_0_21,plain,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    c_0_16 ).

cnf(c_0_22,plain,
    ( member(not_subclass_element(X1,X2),universal_class)
    | subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    inference(fof_simplification,[status(thm)],[intersection3]) ).

cnf(c_0_24,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[intersection1]) ).

cnf(c_0_25,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    c_0_19 ).

cnf(c_0_26,plain,
    ( member(not_subclass_element(X1,complement(X2)),X2)
    | subclass(X1,complement(X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_27,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    c_0_23 ).

cnf(c_0_28,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_24 ).

cnf(c_0_29,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[intersection2]) ).

cnf(c_0_30,plain,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).

cnf(c_0_31,plain,
    ( subclass(X1,complement(complement(X2)))
    | ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    ( subclass(complement(X1),X2)
    | ~ member(not_subclass_element(complement(X1),X2),X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_18]) ).

cnf(c_0_33,plain,
    ( subclass(X1,intersection(X2,X3))
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_27]) ).

cnf(c_0_34,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X1)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_28,c_0_18]) ).

cnf(c_0_35,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_29 ).

cnf(c_0_36,plain,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    c_0_30 ).

cnf(c_0_37,plain,
    subclass(X1,complement(complement(X1))),
    inference(spm,[status(thm)],[c_0_31,c_0_18]) ).

cnf(c_0_38,plain,
    ( member(not_subclass_element(complement(complement(X1)),X2),X1)
    | subclass(complement(complement(X1)),X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_22]) ).

cnf(c_0_39,negated_conjecture,
    ~ subclass(y,union(x,y)),
    inference(fof_simplification,[status(thm)],[prove_lattice_upper_bound2_1]) ).

cnf(c_0_40,plain,
    ( subclass(intersection(X1,X2),intersection(X3,X1))
    | ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_41,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X2)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_35,c_0_18]) ).

cnf(c_0_42,plain,
    ( complement(complement(X1)) = X1
    | ~ subclass(complement(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,plain,
    subclass(complement(complement(X1)),X1),
    inference(spm,[status(thm)],[c_0_20,c_0_38]) ).

cnf(c_0_44,negated_conjecture,
    ~ subclass(y,union(x,y)),
    c_0_39 ).

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

cnf(c_0_46,plain,
    subclass(intersection(X1,X2),intersection(X2,X1)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_47,plain,
    complement(complement(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).

cnf(c_0_48,negated_conjecture,
    ~ subclass(y,complement(intersection(complement(x),complement(y)))),
    inference(rw,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_49,plain,
    intersection(X1,X2) = intersection(X2,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_46])]) ).

cnf(c_0_50,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),complement(X1)) ),
    inference(spm,[status(thm)],[c_0_32,c_0_47]) ).

cnf(c_0_51,plain,
    ( member(not_subclass_element(X1,complement(intersection(X2,X3))),X2)
    | subclass(X1,complement(intersection(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_28,c_0_26]) ).

cnf(c_0_52,negated_conjecture,
    ~ subclass(y,complement(intersection(complement(y),complement(x)))),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_53,plain,
    subclass(X1,complement(intersection(complement(X1),X2))),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SET195-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n019.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon May 20 12:17:23 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.15/0.42  Running first-order theorem proving
% 0.15/0.42  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/benchmark/theBenchmark.p
% 4.25/0.98  # Version: 3.1.0
% 4.25/0.98  # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.25/0.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.25/0.98  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.25/0.98  # Starting new_bool_3 with 300s (1) cores
% 4.25/0.98  # Starting new_bool_1 with 300s (1) cores
% 4.25/0.98  # Starting sh5l with 300s (1) cores
% 4.25/0.98  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7555 completed with status 0
% 4.25/0.98  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.25/0.98  # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.25/0.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.25/0.98  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.25/0.98  # No SInE strategy applied
% 4.25/0.98  # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.25/0.98  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.25/0.98  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.25/0.98  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.25/0.98  # Starting new_bool_1 with 308s (1) cores
% 4.25/0.98  # Starting sh5l with 304s (1) cores
% 4.25/0.98  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.25/0.98  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7563 completed with status 0
% 4.25/0.98  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.25/0.98  # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.25/0.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.25/0.98  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.25/0.98  # No SInE strategy applied
% 4.25/0.98  # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.25/0.98  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.25/0.98  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.25/0.98  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.25/0.98  # Preprocessing time       : 0.003 s
% 4.25/0.98  # Presaturation interreduction done
% 4.25/0.98  
% 4.25/0.98  # Proof found!
% 4.25/0.98  # SZS status Unsatisfiable
% 4.25/0.98  # SZS output start CNFRefutation
% See solution above
% 4.25/0.98  # Parsed axioms                        : 113
% 4.25/0.98  # Removed by relevancy pruning/SinE    : 0
% 4.25/0.98  # Initial clauses                      : 113
% 4.25/0.98  # Removed in clause preprocessing      : 17
% 4.25/0.98  # Initial clauses in saturation        : 96
% 4.25/0.98  # Processed clauses                    : 5254
% 4.25/0.98  # ...of these trivial                  : 118
% 4.25/0.98  # ...subsumed                          : 3630
% 4.25/0.98  # ...remaining for further processing  : 1506
% 4.25/0.98  # Other redundant clauses eliminated   : 18
% 4.25/0.98  # Clauses deleted for lack of memory   : 0
% 4.25/0.98  # Backward-subsumed                    : 88
% 4.25/0.98  # Backward-rewritten                   : 387
% 4.25/0.98  # Generated clauses                    : 24238
% 4.25/0.98  # ...of the previous two non-redundant : 19734
% 4.25/0.98  # ...aggressively subsumed             : 0
% 4.25/0.98  # Contextual simplify-reflections      : 20
% 4.25/0.98  # Paramodulations                      : 24206
% 4.25/0.98  # Factorizations                       : 14
% 4.25/0.98  # NegExts                              : 0
% 4.25/0.98  # Equation resolutions                 : 18
% 4.25/0.98  # Disequality decompositions           : 0
% 4.25/0.98  # Total rewrite steps                  : 10507
% 4.25/0.98  # ...of those cached                   : 9454
% 4.25/0.98  # Propositional unsat checks           : 0
% 4.25/0.98  #    Propositional check models        : 0
% 4.25/0.98  #    Propositional check unsatisfiable : 0
% 4.25/0.98  #    Propositional clauses             : 0
% 4.25/0.98  #    Propositional clauses after purity: 0
% 4.25/0.98  #    Propositional unsat core size     : 0
% 4.25/0.98  #    Propositional preprocessing time  : 0.000
% 4.25/0.98  #    Propositional encoding time       : 0.000
% 4.25/0.98  #    Propositional solver time         : 0.000
% 4.25/0.98  #    Success case prop preproc time    : 0.000
% 4.25/0.98  #    Success case prop encoding time   : 0.000
% 4.25/0.98  #    Success case prop solver time     : 0.000
% 4.25/0.98  # Current number of processed clauses  : 932
% 4.25/0.98  #    Positive orientable unit clauses  : 162
% 4.25/0.98  #    Positive unorientable unit clauses: 1
% 4.25/0.98  #    Negative unit clauses             : 11
% 4.25/0.98  #    Non-unit-clauses                  : 758
% 4.25/0.98  # Current number of unprocessed clauses: 14265
% 4.25/0.98  # ...number of literals in the above   : 44129
% 4.25/0.98  # Current number of archived formulas  : 0
% 4.25/0.98  # Current number of archived clauses   : 587
% 4.25/0.98  # Clause-clause subsumption calls (NU) : 135598
% 4.25/0.98  # Rec. Clause-clause subsumption calls : 79544
% 4.25/0.98  # Non-unit clause-clause subsumptions  : 3001
% 4.25/0.98  # Unit Clause-clause subsumption calls : 7549
% 4.25/0.98  # Rewrite failures with RHS unbound    : 0
% 4.25/0.98  # BW rewrite match attempts            : 706
% 4.25/0.98  # BW rewrite match successes           : 470
% 4.25/0.98  # Condensation attempts                : 0
% 4.25/0.98  # Condensation successes               : 0
% 4.25/0.98  # Termbank termtop insertions          : 752889
% 4.25/0.98  # Search garbage collected termcells   : 185
% 4.25/0.98  
% 4.25/0.98  # -------------------------------------------------
% 4.25/0.98  # User time                : 0.518 s
% 4.25/0.98  # System time              : 0.024 s
% 4.25/0.98  # Total time               : 0.542 s
% 4.25/0.98  # Maximum resident set size: 1988 pages
% 4.25/0.98  
% 4.25/0.98  # -------------------------------------------------
% 4.25/0.98  # User time                : 2.658 s
% 4.25/0.98  # System time              : 0.050 s
% 4.25/0.98  # Total time               : 2.708 s
% 4.25/0.98  # Maximum resident set size: 1796 pages
% 4.25/0.98  % E---3.1 exiting
% 4.25/0.98  % E exiting
%------------------------------------------------------------------------------