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

View Problem - Process Solution

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

% Computer : n007.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:14 EDT 2023

% Result   : Unsatisfiable 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  18 unt;   3 nHn;  16 RR)
%            Number of literals    :   42 (   7 equ;  16 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;   4 con; 0-2 aty)
%            Number of variables   :   36 (   4 sgn)

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

cnf(prove_set_builder_alternate_defn3_1,negated_conjecture,
    member(x,z),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',prove_set_builder_alternate_defn3_1) ).

cnf(definition_of_set_builder,axiom,
    union(singleton(X1),X2) = set_builder(X1,X2),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',definition_of_set_builder) ).

cnf(singleton_set,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',singleton_set) ).

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

cnf(prove_set_builder_alternate_defn3_2,negated_conjecture,
    ~ member(x,set_builder(y,z)),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',prove_set_builder_alternate_defn3_2) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',union) ).

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

cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p',intersection2) ).

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

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

cnf(c_0_11,negated_conjecture,
    member(x,z),
    prove_set_builder_alternate_defn3_1 ).

cnf(c_0_12,axiom,
    union(singleton(X1),X2) = set_builder(X1,X2),
    definition_of_set_builder ).

cnf(c_0_13,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    singleton_set ).

cnf(c_0_14,negated_conjecture,
    ( member(x,X1)
    | ~ subclass(z,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

cnf(c_0_16,negated_conjecture,
    ~ member(x,set_builder(y,z)),
    prove_set_builder_alternate_defn3_2 ).

cnf(c_0_17,plain,
    union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

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

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

cnf(c_0_20,negated_conjecture,
    member(x,universal_class),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ~ member(x,complement(intersection(complement(unordered_pair(y,y)),complement(z)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( member(x,complement(X1))
    | member(x,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_24,negated_conjecture,
    member(x,intersection(complement(unordered_pair(y,y)),complement(z))),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_26,negated_conjecture,
    member(x,complement(z)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SET125-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n007.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   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 17:20:54 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.43  Running first-order model finding
% 0.15/0.43  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.hjiTshRL5P/E---3.1_3788.p
% 0.15/0.45  # Version: 3.1pre001
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  # Starting sh5l with 300s (1) cores
% 0.15/0.45  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3865 completed with status 0
% 0.15/0.45  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # No SInE strategy applied
% 0.15/0.45  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.45  # Starting new_bool_1 with 308s (1) cores
% 0.15/0.45  # Starting sh5l with 304s (1) cores
% 0.15/0.45  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.45  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3872 completed with status 0
% 0.15/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # No SInE strategy applied
% 0.15/0.45  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.45  # Preprocessing time       : 0.003 s
% 0.15/0.45  # Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  # Proof found!
% 0.15/0.45  # SZS status Unsatisfiable
% 0.15/0.45  # SZS output start CNFRefutation
% See solution above
% 0.15/0.45  # Parsed axioms                        : 94
% 0.15/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.45  # Initial clauses                      : 94
% 0.15/0.45  # Removed in clause preprocessing      : 16
% 0.15/0.45  # Initial clauses in saturation        : 78
% 0.15/0.45  # Processed clauses                    : 128
% 0.15/0.45  # ...of these trivial                  : 0
% 0.15/0.45  # ...subsumed                          : 0
% 0.15/0.45  # ...remaining for further processing  : 128
% 0.15/0.45  # Other redundant clauses eliminated   : 3
% 0.15/0.45  # Clauses deleted for lack of memory   : 0
% 0.15/0.45  # Backward-subsumed                    : 0
% 0.15/0.45  # Backward-rewritten                   : 0
% 0.15/0.45  # Generated clauses                    : 47
% 0.15/0.45  # ...of the previous two non-redundant : 41
% 0.15/0.45  # ...aggressively subsumed             : 0
% 0.15/0.45  # Contextual simplify-reflections      : 0
% 0.15/0.45  # Paramodulations                      : 44
% 0.15/0.45  # Factorizations                       : 0
% 0.15/0.45  # NegExts                              : 0
% 0.15/0.45  # Equation resolutions                 : 3
% 0.15/0.45  # Total rewrite steps                  : 4
% 0.15/0.45  # Propositional unsat checks           : 0
% 0.15/0.45  #    Propositional check models        : 0
% 0.15/0.45  #    Propositional check unsatisfiable : 0
% 0.15/0.45  #    Propositional clauses             : 0
% 0.15/0.45  #    Propositional clauses after purity: 0
% 0.15/0.45  #    Propositional unsat core size     : 0
% 0.15/0.45  #    Propositional preprocessing time  : 0.000
% 0.15/0.45  #    Propositional encoding time       : 0.000
% 0.15/0.45  #    Propositional solver time         : 0.000
% 0.15/0.45  #    Success case prop preproc time    : 0.000
% 0.15/0.45  #    Success case prop encoding time   : 0.000
% 0.15/0.45  #    Success case prop solver time     : 0.000
% 0.15/0.45  # Current number of processed clauses  : 48
% 0.15/0.45  #    Positive orientable unit clauses  : 15
% 0.15/0.45  #    Positive unorientable unit clauses: 0
% 0.15/0.45  #    Negative unit clauses             : 1
% 0.15/0.45  #    Non-unit-clauses                  : 32
% 0.15/0.45  # Current number of unprocessed clauses: 67
% 0.15/0.45  # ...number of literals in the above   : 160
% 0.15/0.45  # Current number of archived formulas  : 0
% 0.15/0.45  # Current number of archived clauses   : 93
% 0.15/0.45  # Clause-clause subsumption calls (NU) : 1304
% 0.15/0.45  # Rec. Clause-clause subsumption calls : 593
% 0.15/0.45  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.45  # Unit Clause-clause subsumption calls : 41
% 0.15/0.45  # Rewrite failures with RHS unbound    : 0
% 0.15/0.45  # BW rewrite match attempts            : 3
% 0.15/0.45  # BW rewrite match successes           : 1
% 0.15/0.45  # Condensation attempts                : 0
% 0.15/0.45  # Condensation successes               : 0
% 0.15/0.45  # Termbank termtop insertions          : 5996
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.013 s
% 0.15/0.45  # System time              : 0.003 s
% 0.15/0.45  # Total time               : 0.016 s
% 0.15/0.45  # Maximum resident set size: 1972 pages
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.058 s
% 0.15/0.45  # System time              : 0.011 s
% 0.15/0.45  # Total time               : 0.069 s
% 0.15/0.45  # Maximum resident set size: 1756 pages
% 0.15/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------