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

View Problem - Process Solution

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

% Computer : n020.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:38 EDT 2024

% Result   : Unsatisfiable 0.65s 0.53s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   41 (  12 unt;   5 nHn;  35 RR)
%            Number of literals    :   80 (   4 equ;  38 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   70 (   7 sgn)

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

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

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

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

cnf(prove_greatest_lower_bound_2,negated_conjecture,
    subclass(z,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).

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

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

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

cnf(prove_greatest_lower_bound_1,negated_conjecture,
    subclass(z,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).

cnf(prove_greatest_lower_bound_3,negated_conjecture,
    ~ subclass(z,intersection(x,y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).

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

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

cnf(c_0_12,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    c_0_10 ).

cnf(c_0_13,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    c_0_11 ).

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

cnf(c_0_15,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_12,c_0_13]) ).

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

cnf(c_0_17,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    c_0_14 ).

cnf(c_0_18,negated_conjecture,
    subclass(z,y),
    prove_greatest_lower_bound_2 ).

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

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

cnf(c_0_21,negated_conjecture,
    ( member(X1,y)
    | ~ member(X1,z) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_19 ).

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

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

cnf(c_0_25,negated_conjecture,
    ( subclass(X1,intersection(y,X1))
    | ~ member(not_subclass_element(X1,intersection(y,X1)),z) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

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

cnf(c_0_28,plain,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    c_0_24 ).

cnf(c_0_29,negated_conjecture,
    subclass(z,intersection(y,z)),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_30,plain,
    subclass(intersection(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_12,c_0_26]) ).

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

cnf(c_0_32,negated_conjecture,
    intersection(y,z) = z,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_33,negated_conjecture,
    ( member(not_subclass_element(z,X1),y)
    | subclass(z,X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    subclass(z,x),
    prove_greatest_lower_bound_1 ).

cnf(c_0_35,negated_conjecture,
    ~ subclass(z,intersection(x,y)),
    inference(fof_simplification,[status(thm)],[prove_greatest_lower_bound_3]) ).

cnf(c_0_36,negated_conjecture,
    ( subclass(z,intersection(X1,y))
    | ~ member(not_subclass_element(z,intersection(X1,y)),X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    ( member(X1,x)
    | ~ member(X1,z) ),
    inference(spm,[status(thm)],[c_0_17,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    ~ subclass(z,intersection(x,y)),
    c_0_35 ).

cnf(c_0_39,negated_conjecture,
    ~ member(not_subclass_element(z,intersection(x,y)),z),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET199-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n020.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   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 20 12:03:23 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.65/0.53  # Version: 3.1.0
% 0.65/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.65/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.65/0.53  # Starting sh5l with 300s (1) cores
% 0.65/0.53  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31949 completed with status 0
% 0.65/0.53  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.65/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.53  # No SInE strategy applied
% 0.65/0.53  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.65/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.65/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.65/0.53  # Starting new_bool_1 with 308s (1) cores
% 0.65/0.53  # Starting sh5l with 304s (1) cores
% 0.65/0.53  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.65/0.53  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31957 completed with status 0
% 0.65/0.53  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.65/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.53  # No SInE strategy applied
% 0.65/0.53  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.65/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.65/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.65/0.53  # Preprocessing time       : 0.003 s
% 0.65/0.53  # Presaturation interreduction done
% 0.65/0.53  
% 0.65/0.53  # Proof found!
% 0.65/0.53  # SZS status Unsatisfiable
% 0.65/0.53  # SZS output start CNFRefutation
% See solution above
% 0.65/0.53  # Parsed axioms                        : 115
% 0.65/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.65/0.53  # Initial clauses                      : 115
% 0.65/0.53  # Removed in clause preprocessing      : 17
% 0.65/0.53  # Initial clauses in saturation        : 98
% 0.65/0.53  # Processed clauses                    : 638
% 0.65/0.53  # ...of these trivial                  : 5
% 0.65/0.53  # ...subsumed                          : 193
% 0.65/0.53  # ...remaining for further processing  : 440
% 0.65/0.53  # Other redundant clauses eliminated   : 6
% 0.65/0.53  # Clauses deleted for lack of memory   : 0
% 0.65/0.53  # Backward-subsumed                    : 6
% 0.65/0.53  # Backward-rewritten                   : 30
% 0.65/0.53  # Generated clauses                    : 1430
% 0.65/0.53  # ...of the previous two non-redundant : 1218
% 0.65/0.53  # ...aggressively subsumed             : 0
% 0.65/0.53  # Contextual simplify-reflections      : 5
% 0.65/0.53  # Paramodulations                      : 1422
% 0.65/0.53  # Factorizations                       : 2
% 0.65/0.53  # NegExts                              : 0
% 0.65/0.53  # Equation resolutions                 : 6
% 0.65/0.53  # Disequality decompositions           : 0
% 0.65/0.53  # Total rewrite steps                  : 342
% 0.65/0.53  # ...of those cached                   : 255
% 0.65/0.53  # Propositional unsat checks           : 0
% 0.65/0.53  #    Propositional check models        : 0
% 0.65/0.53  #    Propositional check unsatisfiable : 0
% 0.65/0.53  #    Propositional clauses             : 0
% 0.65/0.53  #    Propositional clauses after purity: 0
% 0.65/0.53  #    Propositional unsat core size     : 0
% 0.65/0.53  #    Propositional preprocessing time  : 0.000
% 0.65/0.53  #    Propositional encoding time       : 0.000
% 0.65/0.53  #    Propositional solver time         : 0.000
% 0.65/0.53  #    Success case prop preproc time    : 0.000
% 0.65/0.53  #    Success case prop encoding time   : 0.000
% 0.65/0.53  #    Success case prop solver time     : 0.000
% 0.65/0.53  # Current number of processed clauses  : 303
% 0.65/0.53  #    Positive orientable unit clauses  : 53
% 0.65/0.53  #    Positive unorientable unit clauses: 1
% 0.65/0.53  #    Negative unit clauses             : 4
% 0.65/0.53  #    Non-unit-clauses                  : 245
% 0.65/0.53  # Current number of unprocessed clauses: 733
% 0.65/0.53  # ...number of literals in the above   : 2030
% 0.65/0.53  # Current number of archived formulas  : 0
% 0.65/0.53  # Current number of archived clauses   : 150
% 0.65/0.53  # Clause-clause subsumption calls (NU) : 11881
% 0.65/0.53  # Rec. Clause-clause subsumption calls : 6754
% 0.65/0.53  # Non-unit clause-clause subsumptions  : 170
% 0.65/0.53  # Unit Clause-clause subsumption calls : 625
% 0.65/0.53  # Rewrite failures with RHS unbound    : 0
% 0.65/0.53  # BW rewrite match attempts            : 77
% 0.65/0.53  # BW rewrite match successes           : 14
% 0.65/0.53  # Condensation attempts                : 0
% 0.65/0.53  # Condensation successes               : 0
% 0.65/0.53  # Termbank termtop insertions          : 35581
% 0.65/0.53  # Search garbage collected termcells   : 185
% 0.65/0.53  
% 0.65/0.53  # -------------------------------------------------
% 0.65/0.53  # User time                : 0.053 s
% 0.65/0.53  # System time              : 0.004 s
% 0.65/0.53  # Total time               : 0.057 s
% 0.65/0.53  # Maximum resident set size: 2000 pages
% 0.65/0.53  
% 0.65/0.53  # -------------------------------------------------
% 0.65/0.53  # User time                : 0.240 s
% 0.65/0.53  # System time              : 0.015 s
% 0.65/0.53  # Total time               : 0.254 s
% 0.65/0.53  # Maximum resident set size: 1804 pages
% 0.65/0.53  % E---3.1 exiting
% 0.65/0.53  % E exiting
%------------------------------------------------------------------------------