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

View Problem - Process Solution

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

% Computer : n025.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:14:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_68,plain,
    ( member(X1,suc(X2))
    | ~ member(X1,union(X2,singleton(X2))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h1_oryin/input.p',i_0_68) ).

cnf(i_0_75,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h1_oryin/input.p',i_0_75) ).

cnf(i_0_32,plain,
    ( member(X1,singleton(X2))
    | X1 != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h1_oryin/input.p',i_0_32) ).

cnf(i_0_73,negated_conjecture,
    ~ member(esk14_0,suc(esk14_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h1_oryin/input.p',i_0_73) ).

cnf(c_0_80,plain,
    ( member(X1,suc(X2))
    | ~ member(X1,union(X2,singleton(X2))) ),
    i_0_68 ).

cnf(c_0_81,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    i_0_75 ).

cnf(c_0_82,plain,
    ( member(X1,singleton(X2))
    | X1 != X2 ),
    i_0_32 ).

cnf(c_0_83,negated_conjecture,
    ~ member(esk14_0,suc(esk14_0)),
    i_0_73 ).

cnf(c_0_84,plain,
    ( member(X1,suc(X2))
    | ~ member(X1,singleton(X2)) ),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_85,plain,
    member(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_82]) ).

cnf(c_0_86,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Sun Jul 10 16:42:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.77/2.31  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.77/2.31  # Version: 2.1pre011
% 7.77/2.31  # Preprocessing time       : 0.017 s
% 7.77/2.31  
% 7.77/2.31  # Proof found!
% 7.77/2.31  # SZS status Theorem
% 7.77/2.31  # SZS output start CNFRefutation
% See solution above
% 7.77/2.31  # Proof object total steps             : 11
% 7.77/2.31  # Proof object clause steps            : 7
% 7.77/2.31  # Proof object formula steps           : 4
% 7.77/2.31  # Proof object conjectures             : 3
% 7.77/2.31  # Proof object clause conjectures      : 2
% 7.77/2.31  # Proof object formula conjectures     : 1
% 7.77/2.31  # Proof object initial clauses used    : 4
% 7.77/2.31  # Proof object initial formulas used   : 4
% 7.77/2.31  # Proof object generating inferences   : 2
% 7.77/2.31  # Proof object simplifying inferences  : 3
% 7.77/2.31  # Training examples: 0 positive, 0 negative
% 7.77/2.31  # Parsed axioms                        : 80
% 7.77/2.31  # Removed by relevancy pruning/SinE    : 0
% 7.77/2.31  # Initial clauses                      : 80
% 7.77/2.31  # Removed in clause preprocessing      : 0
% 7.77/2.31  # Initial clauses in saturation        : 80
% 7.77/2.31  # Processed clauses                    : 98
% 7.77/2.31  # ...of these trivial                  : 3
% 7.77/2.31  # ...subsumed                          : 2
% 7.77/2.31  # ...remaining for further processing  : 93
% 7.77/2.31  # Other redundant clauses eliminated   : 5
% 7.77/2.31  # Clauses deleted for lack of memory   : 0
% 7.77/2.31  # Backward-subsumed                    : 0
% 7.77/2.31  # Backward-rewritten                   : 0
% 7.77/2.31  # Generated clauses                    : 338
% 7.77/2.31  # ...of the previous two non-trivial   : 312
% 7.77/2.31  # Contextual simplify-reflections      : 0
% 7.77/2.31  # Paramodulations                      : 323
% 7.77/2.31  # Factorizations                       : 10
% 7.77/2.31  # Equation resolutions                 : 5
% 7.77/2.31  # Propositional unsat checks           : 0
% 7.77/2.31  # Propositional unsat check successes  : 0
% 7.77/2.31  # Current number of processed clauses  : 90
% 7.77/2.31  #    Positive orientable unit clauses  : 5
% 7.77/2.31  #    Positive unorientable unit clauses: 0
% 7.77/2.31  #    Negative unit clauses             : 5
% 7.77/2.31  #    Non-unit-clauses                  : 80
% 7.77/2.31  # Current number of unprocessed clauses: 293
% 7.77/2.31  # ...number of literals in the above   : 959
% 7.77/2.31  # Current number of archived formulas  : 0
% 7.77/2.31  # Current number of archived clauses   : 0
% 7.77/2.31  # Clause-clause subsumption calls (NU) : 1118
% 7.77/2.31  # Rec. Clause-clause subsumption calls : 903
% 7.77/2.31  # Non-unit clause-clause subsumptions  : 1
% 7.77/2.31  # Unit Clause-clause subsumption calls : 101
% 7.77/2.31  # Rewrite failures with RHS unbound    : 0
% 7.77/2.31  # BW rewrite match attempts            : 2
% 7.77/2.31  # BW rewrite match successes           : 0
% 7.77/2.31  # Condensation attempts                : 0
% 7.77/2.31  # Condensation successes               : 0
% 7.77/2.31  # Termbank termtop insertions          : 5867
% 7.77/2.31  
% 7.77/2.31  # -------------------------------------------------
% 7.77/2.31  # User time                : 0.022 s
% 7.77/2.31  # System time              : 0.004 s
% 7.77/2.31  # Total time               : 0.026 s
% 7.77/2.31  # ...preprocessing         : 0.017 s
% 7.77/2.31  # ...main loop             : 0.009 s
% 7.77/2.31  # Maximum resident set size: 7140 pages
% 7.77/2.31  
%------------------------------------------------------------------------------