TSTP Solution File: SET705+4 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET705+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n003.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  : 600s
% DateTime : Tue Jul 19 00:13:34 EDT 2022

% Result   : Theorem 7.45s 2.46s
% Output   : CNFRefutation 7.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   5 unt;   2 nHn;   8 RR)
%            Number of literals    :   17 (   0 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_24,negated_conjecture,
    ~ member(esk4_0,power_set(esk4_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dr0y7p03/input.p',i_0_24) ).

cnf(i_0_11,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dr0y7p03/input.p',i_0_11) ).

cnf(i_0_18,plain,
    ( subset(X1,X2)
    | ~ member(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dr0y7p03/input.p',i_0_18) ).

cnf(i_0_19,plain,
    ( subset(X1,X2)
    | member(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dr0y7p03/input.p',i_0_19) ).

cnf(c_0_29,negated_conjecture,
    ~ member(esk4_0,power_set(esk4_0)),
    i_0_24 ).

cnf(c_0_30,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    i_0_11 ).

cnf(c_0_31,plain,
    ( subset(X1,X2)
    | ~ member(esk2_2(X1,X2),X2) ),
    i_0_18 ).

cnf(c_0_32,plain,
    ( subset(X1,X2)
    | member(esk2_2(X1,X2),X1) ),
    i_0_19 ).

cnf(c_0_33,negated_conjecture,
    ~ subset(esk4_0,esk4_0),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,plain,
    subset(X1,X1),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SET705+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 23:07:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.45/2.46  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.45/2.46  # Version: 2.1pre011
% 7.45/2.46  # Preprocessing time       : 0.015 s
% 7.45/2.46  
% 7.45/2.46  # Proof found!
% 7.45/2.46  # SZS status Theorem
% 7.45/2.46  # SZS output start CNFRefutation
% See solution above
% 7.45/2.46  # Proof object total steps             : 11
% 7.45/2.46  # Proof object clause steps            : 7
% 7.45/2.46  # Proof object formula steps           : 4
% 7.45/2.46  # Proof object conjectures             : 4
% 7.45/2.46  # Proof object clause conjectures      : 3
% 7.45/2.46  # Proof object formula conjectures     : 1
% 7.45/2.46  # Proof object initial clauses used    : 4
% 7.45/2.46  # Proof object initial formulas used   : 4
% 7.45/2.46  # Proof object generating inferences   : 2
% 7.45/2.46  # Proof object simplifying inferences  : 2
% 7.45/2.46  # Training examples: 0 positive, 0 negative
% 7.45/2.46  # Parsed axioms                        : 30
% 7.45/2.46  # Removed by relevancy pruning/SinE    : 0
% 7.45/2.46  # Initial clauses                      : 30
% 7.45/2.46  # Removed in clause preprocessing      : 0
% 7.45/2.46  # Initial clauses in saturation        : 30
% 7.45/2.46  # Processed clauses                    : 38
% 7.45/2.46  # ...of these trivial                  : 0
% 7.45/2.46  # ...subsumed                          : 1
% 7.45/2.46  # ...remaining for further processing  : 37
% 7.45/2.46  # Other redundant clauses eliminated   : 3
% 7.45/2.46  # Clauses deleted for lack of memory   : 0
% 7.45/2.46  # Backward-subsumed                    : 0
% 7.45/2.46  # Backward-rewritten                   : 1
% 7.45/2.46  # Generated clauses                    : 90
% 7.45/2.46  # ...of the previous two non-trivial   : 80
% 7.45/2.46  # Contextual simplify-reflections      : 0
% 7.45/2.46  # Paramodulations                      : 87
% 7.45/2.46  # Factorizations                       : 0
% 7.45/2.46  # Equation resolutions                 : 3
% 7.45/2.46  # Propositional unsat checks           : 0
% 7.45/2.46  # Propositional unsat check successes  : 0
% 7.45/2.46  # Current number of processed clauses  : 33
% 7.45/2.46  #    Positive orientable unit clauses  : 3
% 7.45/2.46  #    Positive unorientable unit clauses: 0
% 7.45/2.46  #    Negative unit clauses             : 3
% 7.45/2.46  #    Non-unit-clauses                  : 27
% 7.45/2.46  # Current number of unprocessed clauses: 72
% 7.45/2.46  # ...number of literals in the above   : 162
% 7.45/2.46  # Current number of archived formulas  : 0
% 7.45/2.46  # Current number of archived clauses   : 1
% 7.45/2.46  # Clause-clause subsumption calls (NU) : 90
% 7.45/2.46  # Rec. Clause-clause subsumption calls : 85
% 7.45/2.46  # Non-unit clause-clause subsumptions  : 0
% 7.45/2.46  # Unit Clause-clause subsumption calls : 32
% 7.45/2.46  # Rewrite failures with RHS unbound    : 0
% 7.45/2.46  # BW rewrite match attempts            : 8
% 7.45/2.46  # BW rewrite match successes           : 1
% 7.45/2.46  # Condensation attempts                : 0
% 7.45/2.46  # Condensation successes               : 0
% 7.45/2.46  # Termbank termtop insertions          : 1380
% 7.45/2.46  
% 7.45/2.46  # -------------------------------------------------
% 7.45/2.46  # User time                : 0.015 s
% 7.45/2.46  # System time              : 0.002 s
% 7.45/2.46  # Total time               : 0.017 s
% 7.45/2.46  # ...preprocessing         : 0.015 s
% 7.45/2.46  # ...main loop             : 0.002 s
% 7.45/2.46  # Maximum resident set size: 7124 pages
% 7.45/2.46  
%------------------------------------------------------------------------------