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

View Problem - Process Solution

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

% Computer : n006.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:47:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_655,plain,
    ( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vypbfbd/input.p',i_0_655) ).

cnf(i_0_2658,negated_conjecture,
    ~ borderson(c_georegion_l4_x45_y9,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vypbfbd/input.p',i_0_2658) ).

cnf(i_0_2301,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vypbfbd/input.p',i_0_2301) ).

cnf(i_0_1174,plain,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vypbfbd/input.p',i_0_1174) ).

cnf(i_0_2659,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vypbfbd/input.p',i_0_2659) ).

cnf(c_0_2665,plain,
    ( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    i_0_655 ).

cnf(c_0_2666,negated_conjecture,
    ~ borderson(c_georegion_l4_x45_y9,X1),
    i_0_2658 ).

cnf(c_0_2667,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2301 ).

cnf(c_0_2668,plain,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
    i_0_1174 ).

cnf(c_0_2669,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt),
    i_0_2659 ).

cnf(c_0_2670,plain,
    ~ mtvisible(c_tptpgeo_member1_mt),
    inference(sr,[status(thm)],[c_0_2665,c_0_2666]) ).

cnf(c_0_2671,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2667,c_0_2668]),c_0_2669])]),c_0_2670]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR048+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 06:09:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.90/1.09  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.90/1.09  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.90/1.09  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.90/1.09  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.44/3.91  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.44/3.91  # Version: 2.1pre011
% 6.44/3.91  # Preprocessing time       : 0.048 s
% 6.44/3.91  
% 6.44/3.91  # Proof found!
% 6.44/3.91  # SZS status Theorem
% 6.44/3.91  # SZS output start CNFRefutation
% See solution above
% 6.44/3.91  # Proof object total steps             : 12
% 6.44/3.91  # Proof object clause steps            : 7
% 6.44/3.91  # Proof object formula steps           : 5
% 6.44/3.91  # Proof object conjectures             : 4
% 6.44/3.91  # Proof object clause conjectures      : 2
% 6.44/3.91  # Proof object formula conjectures     : 2
% 6.44/3.91  # Proof object initial clauses used    : 5
% 6.44/3.91  # Proof object initial formulas used   : 5
% 6.44/3.91  # Proof object generating inferences   : 1
% 6.44/3.91  # Proof object simplifying inferences  : 4
% 6.44/3.91  # Training examples: 0 positive, 0 negative
% 6.44/3.91  # Parsed axioms                        : 2658
% 6.44/3.91  # Removed by relevancy pruning/SinE    : 0
% 6.44/3.91  # Initial clauses                      : 2658
% 6.44/3.91  # Removed in clause preprocessing      : 0
% 6.44/3.91  # Initial clauses in saturation        : 2658
% 6.44/3.91  # Processed clauses                    : 212
% 6.44/3.91  # ...of these trivial                  : 11
% 6.44/3.91  # ...subsumed                          : 17
% 6.44/3.91  # ...remaining for further processing  : 184
% 6.44/3.91  # Other redundant clauses eliminated   : 2
% 6.44/3.91  # Clauses deleted for lack of memory   : 0
% 6.44/3.91  # Backward-subsumed                    : 0
% 6.44/3.91  # Backward-rewritten                   : 3
% 6.44/3.91  # Generated clauses                    : 44
% 6.44/3.91  # ...of the previous two non-trivial   : 41
% 6.44/3.91  # Contextual simplify-reflections      : 0
% 6.44/3.91  # Paramodulations                      : 42
% 6.44/3.91  # Factorizations                       : 0
% 6.44/3.91  # Equation resolutions                 : 2
% 6.44/3.91  # Propositional unsat checks           : 0
% 6.44/3.91  # Propositional unsat check successes  : 0
% 6.44/3.91  # Current number of processed clauses  : 179
% 6.44/3.91  #    Positive orientable unit clauses  : 74
% 6.44/3.91  #    Positive unorientable unit clauses: 0
% 6.44/3.91  #    Negative unit clauses             : 5
% 6.44/3.91  #    Non-unit-clauses                  : 100
% 6.44/3.91  # Current number of unprocessed clauses: 2486
% 6.44/3.91  # ...number of literals in the above   : 3768
% 6.44/3.91  # Current number of archived formulas  : 0
% 6.44/3.91  # Current number of archived clauses   : 3
% 6.44/3.91  # Clause-clause subsumption calls (NU) : 1983
% 6.44/3.91  # Rec. Clause-clause subsumption calls : 1817
% 6.44/3.91  # Non-unit clause-clause subsumptions  : 15
% 6.44/3.91  # Unit Clause-clause subsumption calls : 460
% 6.44/3.91  # Rewrite failures with RHS unbound    : 0
% 6.44/3.91  # BW rewrite match attempts            : 3
% 6.44/3.91  # BW rewrite match successes           : 3
% 6.44/3.91  # Condensation attempts                : 0
% 6.44/3.91  # Condensation successes               : 0
% 6.44/3.91  # Termbank termtop insertions          : 36613
% 6.44/3.91  
% 6.44/3.91  # -------------------------------------------------
% 6.44/3.91  # User time                : 0.045 s
% 6.44/3.91  # System time              : 0.007 s
% 6.44/3.91  # Total time               : 0.052 s
% 6.44/3.91  # ...preprocessing         : 0.048 s
% 6.44/3.91  # ...main loop             : 0.004 s
% 6.44/3.91  # Maximum resident set size: 10576 pages
% 6.44/3.91  
%------------------------------------------------------------------------------