TSTP Solution File: SET411-6 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n032.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 : Sat May  4 09:22:53 EDT 2024

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   23 (  12 unt;   0 nHn;  21 RR)
%            Number of literals    :   37 (   2 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   29 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.SNMr4qLHFO/E---3.1_2834.p',intersection2) ).

cnf(compose_can_define_singleton,axiom,
    intersection(complement(compose(element_relation,complement(identity_relation))),element_relation) = singleton_relation,
    file('/export/starexec/sandbox/tmp/tmp.SNMr4qLHFO/E---3.1_2834.p',compose_can_define_singleton) ).

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

cnf(element_relation2,axiom,
    ( member(X1,X2)
    | ~ member(ordered_pair(X1,X2),element_relation) ),
    file('/export/starexec/sandbox/tmp/tmp.SNMr4qLHFO/E---3.1_2834.p',element_relation2) ).

cnf(prove_compose_condition_for_singleton_membership1_1,negated_conjecture,
    member(ordered_pair(x,y),singleton_relation),
    file('/export/starexec/sandbox/tmp/tmp.SNMr4qLHFO/E---3.1_2834.p',prove_compose_condition_for_singleton_membership1_1) ).

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

cnf(prove_compose_condition_for_singleton_membership1_2,negated_conjecture,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox/tmp/tmp.SNMr4qLHFO/E---3.1_2834.p',prove_compose_condition_for_singleton_membership1_2) ).

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

cnf(c_0_8,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_7 ).

cnf(c_0_9,axiom,
    intersection(complement(compose(element_relation,complement(identity_relation))),element_relation) = singleton_relation,
    compose_can_define_singleton ).

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

cnf(c_0_11,plain,
    ( member(X1,X2)
    | ~ member(ordered_pair(X1,X2),element_relation) ),
    inference(fof_simplification,[status(thm)],[element_relation2]) ).

cnf(c_0_12,plain,
    ( member(X1,element_relation)
    | ~ member(X1,singleton_relation) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    member(ordered_pair(x,y),singleton_relation),
    prove_compose_condition_for_singleton_membership1_1 ).

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

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

cnf(c_0_16,plain,
    ( member(X1,X2)
    | ~ member(ordered_pair(X1,X2),element_relation) ),
    c_0_11 ).

cnf(c_0_17,negated_conjecture,
    member(ordered_pair(x,y),element_relation),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ member(x,universal_class),
    inference(fof_simplification,[status(thm)],[prove_compose_condition_for_singleton_membership1_2]) ).

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

cnf(c_0_20,negated_conjecture,
    member(x,y),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ~ member(x,universal_class),
    c_0_18 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.08  % Problem    : SET411-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.09  % Command    : run_E %s %d THM
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit   : 300
% 0.09/0.28  % WCLimit    : 300
% 0.09/0.28  % DateTime   : Fri May  3 10:14:54 EDT 2024
% 0.09/0.28  % CPUTime    : 
% 0.13/0.36  Running first-order model finding
% 0.13/0.36  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.SNMr4qLHFO/E---3.1_2834.p
% 0.13/0.38  # Version: 3.1.0
% 0.13/0.38  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.38  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.38  # Starting sh5l with 300s (1) cores
% 0.13/0.38  # new_bool_3 with pid 2912 completed with status 0
% 0.13/0.38  # Result found by new_bool_3
% 0.13/0.38  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.38  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38  # Search class: FGHSS-FFSS21-MFFFFFNN
% 0.13/0.38  # partial match(1): FGHSS-FFSS21-SFFFFFNN
% 0.13/0.38  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.38  # SAT001_MinMin_p005000_rr_RG with pid 2915 completed with status 0
% 0.13/0.38  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.38  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.38  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38  # Search class: FGHSS-FFSS21-MFFFFFNN
% 0.13/0.38  # partial match(1): FGHSS-FFSS21-SFFFFFNN
% 0.13/0.38  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.38  # Preprocessing time       : 0.001 s
% 0.13/0.38  # Presaturation interreduction done
% 0.13/0.38  
% 0.13/0.38  # Proof found!
% 0.13/0.38  # SZS status Unsatisfiable
% 0.13/0.38  # SZS output start CNFRefutation
% See solution above
% 0.13/0.38  # Parsed axioms                        : 114
% 0.13/0.38  # Removed by relevancy pruning/SinE    : 91
% 0.13/0.38  # Initial clauses                      : 23
% 0.13/0.38  # Removed in clause preprocessing      : 0
% 0.13/0.38  # Initial clauses in saturation        : 23
% 0.13/0.38  # Processed clauses                    : 51
% 0.13/0.38  # ...of these trivial                  : 0
% 0.13/0.38  # ...subsumed                          : 0
% 0.13/0.38  # ...remaining for further processing  : 51
% 0.13/0.38  # Other redundant clauses eliminated   : 2
% 0.13/0.38  # Clauses deleted for lack of memory   : 0
% 0.13/0.38  # Backward-subsumed                    : 0
% 0.13/0.38  # Backward-rewritten                   : 0
% 0.13/0.38  # Generated clauses                    : 25
% 0.13/0.38  # ...of the previous two non-redundant : 17
% 0.13/0.38  # ...aggressively subsumed             : 0
% 0.13/0.38  # Contextual simplify-reflections      : 0
% 0.13/0.38  # Paramodulations                      : 23
% 0.13/0.38  # Factorizations                       : 0
% 0.13/0.38  # NegExts                              : 0
% 0.13/0.38  # Equation resolutions                 : 2
% 0.13/0.38  # Disequality decompositions           : 0
% 0.13/0.38  # Total rewrite steps                  : 3
% 0.13/0.38  # ...of those cached                   : 1
% 0.13/0.38  # Propositional unsat checks           : 0
% 0.13/0.38  #    Propositional check models        : 0
% 0.13/0.38  #    Propositional check unsatisfiable : 0
% 0.13/0.38  #    Propositional clauses             : 0
% 0.13/0.38  #    Propositional clauses after purity: 0
% 0.13/0.38  #    Propositional unsat core size     : 0
% 0.13/0.38  #    Propositional preprocessing time  : 0.000
% 0.13/0.38  #    Propositional encoding time       : 0.000
% 0.13/0.38  #    Propositional solver time         : 0.000
% 0.13/0.38  #    Success case prop preproc time    : 0.000
% 0.13/0.38  #    Success case prop encoding time   : 0.000
% 0.13/0.38  #    Success case prop solver time     : 0.000
% 0.13/0.38  # Current number of processed clauses  : 27
% 0.13/0.38  #    Positive orientable unit clauses  : 9
% 0.13/0.38  #    Positive unorientable unit clauses: 0
% 0.13/0.38  #    Negative unit clauses             : 1
% 0.13/0.38  #    Non-unit-clauses                  : 17
% 0.13/0.38  # Current number of unprocessed clauses: 11
% 0.13/0.38  # ...number of literals in the above   : 29
% 0.13/0.38  # Current number of archived formulas  : 0
% 0.13/0.38  # Current number of archived clauses   : 22
% 0.13/0.38  # Clause-clause subsumption calls (NU) : 107
% 0.13/0.38  # Rec. Clause-clause subsumption calls : 97
% 0.13/0.38  # Non-unit clause-clause subsumptions  : 0
% 0.13/0.38  # Unit Clause-clause subsumption calls : 0
% 0.13/0.38  # Rewrite failures with RHS unbound    : 0
% 0.13/0.38  # BW rewrite match attempts            : 4
% 0.13/0.38  # BW rewrite match successes           : 0
% 0.13/0.38  # Condensation attempts                : 0
% 0.13/0.38  # Condensation successes               : 0
% 0.13/0.38  # Termbank termtop insertions          : 1757
% 0.13/0.38  # Search garbage collected termcells   : 469
% 0.13/0.38  
% 0.13/0.38  # -------------------------------------------------
% 0.13/0.38  # User time                : 0.004 s
% 0.13/0.38  # System time              : 0.001 s
% 0.13/0.38  # Total time               : 0.005 s
% 0.13/0.38  # Maximum resident set size: 1884 pages
% 0.13/0.38  
% 0.13/0.38  # -------------------------------------------------
% 0.13/0.38  # User time                : 0.005 s
% 0.13/0.38  # System time              : 0.002 s
% 0.13/0.38  # Total time               : 0.008 s
% 0.13/0.38  # Maximum resident set size: 1788 pages
% 0.13/0.38  % E---3.1 exiting
%------------------------------------------------------------------------------