TSTP Solution File: CSR031+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n026.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 : Fri Jul 15 02:46:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_126,plain,
    ( disjointwith(X1,X2)
    | ~ disjointwith(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7qyj162e/input.p',i_0_126) ).

cnf(i_0_1065,negated_conjecture,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7qyj162e/input.p',i_0_1065) ).

cnf(i_0_327,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7qyj162e/input.p',i_0_327) ).

cnf(i_0_493,plain,
    individual(c_tptptptpcol_16_8398),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7qyj162e/input.p',i_0_493) ).

cnf(i_0_123,plain,
    ( collection(X1)
    | ~ disjointwith(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7qyj162e/input.p',i_0_123) ).

cnf(c_0_1071,plain,
    ( disjointwith(X1,X2)
    | ~ disjointwith(X2,X1) ),
    i_0_126 ).

cnf(c_0_1072,negated_conjecture,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    i_0_1065 ).

cnf(c_0_1073,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    i_0_327 ).

cnf(c_0_1074,plain,
    individual(c_tptptptpcol_16_8398),
    i_0_493 ).

cnf(c_0_1075,plain,
    ( collection(X1)
    | ~ disjointwith(X2,X1) ),
    i_0_123 ).

cnf(c_0_1076,negated_conjecture,
    disjointwith(c_tptpcol_16_18488,c_tptptptpcol_16_8398),
    inference(spm,[status(thm)],[c_0_1071,c_0_1072]) ).

cnf(c_0_1077,plain,
    ~ collection(c_tptptptpcol_16_8398),
    inference(spm,[status(thm)],[c_0_1073,c_0_1074]) ).

cnf(c_0_1078,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1075,c_0_1076]),c_0_1077]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR031+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun 10 00:46:04 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected SinE mode:
% 0.21/0.48  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.94/2.66  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 5.94/2.66  # Version: 2.1pre011
% 5.94/2.66  # Preprocessing time       : 0.022 s
% 5.94/2.66  
% 5.94/2.66  # Proof found!
% 5.94/2.66  # SZS status Theorem
% 5.94/2.66  # SZS output start CNFRefutation
% See solution above
% 5.94/2.66  # Proof object total steps             : 13
% 5.94/2.66  # Proof object clause steps            : 8
% 5.94/2.66  # Proof object formula steps           : 5
% 5.94/2.66  # Proof object conjectures             : 3
% 5.94/2.66  # Proof object clause conjectures      : 2
% 5.94/2.66  # Proof object formula conjectures     : 1
% 5.94/2.66  # Proof object initial clauses used    : 5
% 5.94/2.66  # Proof object initial formulas used   : 5
% 5.94/2.66  # Proof object generating inferences   : 3
% 5.94/2.66  # Proof object simplifying inferences  : 1
% 5.94/2.66  # Training examples: 0 positive, 0 negative
% 5.94/2.66  # Parsed axioms                        : 1065
% 5.94/2.66  # Removed by relevancy pruning/SinE    : 0
% 5.94/2.66  # Initial clauses                      : 1065
% 5.94/2.66  # Removed in clause preprocessing      : 0
% 5.94/2.66  # Initial clauses in saturation        : 1065
% 5.94/2.66  # Processed clauses                    : 1067
% 5.94/2.66  # ...of these trivial                  : 1
% 5.94/2.66  # ...subsumed                          : 31
% 5.94/2.66  # ...remaining for further processing  : 1035
% 5.94/2.66  # Other redundant clauses eliminated   : 0
% 5.94/2.66  # Clauses deleted for lack of memory   : 0
% 5.94/2.66  # Backward-subsumed                    : 0
% 5.94/2.66  # Backward-rewritten                   : 1
% 5.94/2.66  # Generated clauses                    : 1379
% 5.94/2.66  # ...of the previous two non-trivial   : 1169
% 5.94/2.66  # Contextual simplify-reflections      : 0
% 5.94/2.66  # Paramodulations                      : 1379
% 5.94/2.66  # Factorizations                       : 0
% 5.94/2.66  # Equation resolutions                 : 0
% 5.94/2.66  # Propositional unsat checks           : 0
% 5.94/2.66  # Propositional unsat check successes  : 0
% 5.94/2.66  # Current number of processed clauses  : 1034
% 5.94/2.66  #    Positive orientable unit clauses  : 331
% 5.94/2.66  #    Positive unorientable unit clauses: 0
% 5.94/2.66  #    Negative unit clauses             : 3
% 5.94/2.66  #    Non-unit-clauses                  : 700
% 5.94/2.66  # Current number of unprocessed clauses: 1165
% 5.94/2.66  # ...number of literals in the above   : 1827
% 5.94/2.66  # Current number of archived formulas  : 0
% 5.94/2.66  # Current number of archived clauses   : 1
% 5.94/2.66  # Clause-clause subsumption calls (NU) : 80450
% 5.94/2.66  # Rec. Clause-clause subsumption calls : 73738
% 5.94/2.66  # Non-unit clause-clause subsumptions  : 31
% 5.94/2.66  # Unit Clause-clause subsumption calls : 1067
% 5.94/2.66  # Rewrite failures with RHS unbound    : 0
% 5.94/2.66  # BW rewrite match attempts            : 4
% 5.94/2.66  # BW rewrite match successes           : 1
% 5.94/2.66  # Condensation attempts                : 0
% 5.94/2.66  # Condensation successes               : 0
% 5.94/2.66  # Termbank termtop insertions          : 24912
% 5.94/2.66  
% 5.94/2.66  # -------------------------------------------------
% 5.94/2.66  # User time                : 0.052 s
% 5.94/2.66  # System time              : 0.008 s
% 5.94/2.66  # Total time               : 0.060 s
% 5.94/2.66  # ...preprocessing         : 0.022 s
% 5.94/2.66  # ...main loop             : 0.038 s
% 5.94/2.66  # Maximum resident set size: 9436 pages
% 5.94/2.66  
%------------------------------------------------------------------------------