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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR035+2 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 02:46:46 EDT 2022

% Result   : Theorem 4.93s 2.68s
% Output   : CNFRefutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :    9 (   0 equ;   4 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    :    6 (   6 usr;   5 con; 0-3 aty)
%            Number of variables   :    2 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_499,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
    | ~ mtvisible(c_englishmt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i4c7gnam/input.p',i_0_499) ).

cnf(i_0_1066,negated_conjecture,
    mtvisible(c_englishmt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i4c7gnam/input.p',i_0_1066) ).

cnf(i_0_1065,negated_conjecture,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i4c7gnam/input.p',i_0_1065) ).

cnf(c_0_1070,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
    | ~ mtvisible(c_englishmt) ),
    i_0_499 ).

cnf(c_0_1071,negated_conjecture,
    mtvisible(c_englishmt),
    i_0_1066 ).

cnf(c_0_1072,negated_conjecture,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1),
    i_0_1065 ).

cnf(c_0_1073,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1070,c_0_1071])]),c_0_1072]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : CSR035+2 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 19:28:09 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.93/2.68  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.93/2.68  # Version: 2.1pre011
% 4.93/2.68  # Preprocessing time       : 0.024 s
% 4.93/2.68  
% 4.93/2.68  # Proof found!
% 4.93/2.68  # SZS status Theorem
% 4.93/2.68  # SZS output start CNFRefutation
% See solution above
% 4.93/2.68  # Proof object total steps             : 7
% 4.93/2.68  # Proof object clause steps            : 4
% 4.93/2.68  # Proof object formula steps           : 3
% 4.93/2.68  # Proof object conjectures             : 4
% 4.93/2.68  # Proof object clause conjectures      : 2
% 4.93/2.68  # Proof object formula conjectures     : 2
% 4.93/2.68  # Proof object initial clauses used    : 3
% 4.93/2.68  # Proof object initial formulas used   : 3
% 4.93/2.68  # Proof object generating inferences   : 0
% 4.93/2.68  # Proof object simplifying inferences  : 3
% 4.93/2.68  # Training examples: 0 positive, 0 negative
% 4.93/2.68  # Parsed axioms                        : 1066
% 4.93/2.68  # Removed by relevancy pruning/SinE    : 0
% 4.93/2.68  # Initial clauses                      : 1066
% 4.93/2.68  # Removed in clause preprocessing      : 0
% 4.93/2.68  # Initial clauses in saturation        : 1066
% 4.93/2.68  # Processed clauses                    : 38
% 4.93/2.68  # ...of these trivial                  : 0
% 4.93/2.68  # ...subsumed                          : 0
% 4.93/2.68  # ...remaining for further processing  : 37
% 4.93/2.68  # Other redundant clauses eliminated   : 0
% 4.93/2.68  # Clauses deleted for lack of memory   : 0
% 4.93/2.68  # Backward-subsumed                    : 0
% 4.93/2.68  # Backward-rewritten                   : 0
% 4.93/2.68  # Generated clauses                    : 6
% 4.93/2.68  # ...of the previous two non-trivial   : 6
% 4.93/2.68  # Contextual simplify-reflections      : 0
% 4.93/2.68  # Paramodulations                      : 6
% 4.93/2.68  # Factorizations                       : 0
% 4.93/2.68  # Equation resolutions                 : 0
% 4.93/2.68  # Propositional unsat checks           : 0
% 4.93/2.68  # Propositional unsat check successes  : 0
% 4.93/2.68  # Current number of processed clauses  : 37
% 4.93/2.68  #    Positive orientable unit clauses  : 22
% 4.93/2.68  #    Positive unorientable unit clauses: 0
% 4.93/2.68  #    Negative unit clauses             : 3
% 4.93/2.68  #    Non-unit-clauses                  : 12
% 4.93/2.68  # Current number of unprocessed clauses: 1034
% 4.93/2.68  # ...number of literals in the above   : 1799
% 4.93/2.68  # Current number of archived formulas  : 0
% 4.93/2.68  # Current number of archived clauses   : 0
% 4.93/2.68  # Clause-clause subsumption calls (NU) : 29
% 4.93/2.68  # Rec. Clause-clause subsumption calls : 28
% 4.93/2.68  # Non-unit clause-clause subsumptions  : 0
% 4.93/2.68  # Unit Clause-clause subsumption calls : 15
% 4.93/2.68  # Rewrite failures with RHS unbound    : 0
% 4.93/2.68  # BW rewrite match attempts            : 0
% 4.93/2.68  # BW rewrite match successes           : 0
% 4.93/2.68  # Condensation attempts                : 0
% 4.93/2.68  # Condensation successes               : 0
% 4.93/2.68  # Termbank termtop insertions          : 11622
% 4.93/2.68  
% 4.93/2.68  # -------------------------------------------------
% 4.93/2.68  # User time                : 0.021 s
% 4.93/2.68  # System time              : 0.004 s
% 4.93/2.68  # Total time               : 0.025 s
% 4.93/2.68  # ...preprocessing         : 0.024 s
% 4.93/2.68  # ...main loop             : 0.001 s
% 4.93/2.68  # Maximum resident set size: 7136 pages
% 4.93/2.68  
%------------------------------------------------------------------------------