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

View Problem - Process Solution

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

% Computer : n024.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:11 EDT 2022

% Result   : Theorem 8.71s 2.83s
% Output   : CNFRefutation 8.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;  14 RR)
%            Number of literals    :   22 (   0 equ;  11 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   :    8 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_962,plain,
    ( borderson(X1,X2)
    | ~ borderson(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ymu3pckv/input.p',i_0_962) ).

cnf(i_0_51,plain,
    ( borderson(c_georegion_l4_x56_y47,c_georegion_l4_x57_y47)
    | ~ mtvisible(c_tptpgeo_member5_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ymu3pckv/input.p',i_0_51) ).

cnf(i_0_1065,negated_conjecture,
    ~ borderson(c_georegion_l4_x57_y47,c_georegion_l4_x56_y47),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ymu3pckv/input.p',i_0_1065) ).

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

cnf(i_0_453,plain,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member5_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ymu3pckv/input.p',i_0_453) ).

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

cnf(c_0_1073,plain,
    ( borderson(X1,X2)
    | ~ borderson(X2,X1) ),
    i_0_962 ).

cnf(c_0_1074,plain,
    ( borderson(c_georegion_l4_x56_y47,c_georegion_l4_x57_y47)
    | ~ mtvisible(c_tptpgeo_member5_mt) ),
    i_0_51 ).

cnf(c_0_1075,negated_conjecture,
    ~ borderson(c_georegion_l4_x57_y47,c_georegion_l4_x56_y47),
    i_0_1065 ).

cnf(c_0_1076,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_129 ).

cnf(c_0_1077,plain,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member5_mt),
    i_0_453 ).

cnf(c_0_1078,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt),
    i_0_1066 ).

cnf(c_0_1079,plain,
    ~ mtvisible(c_tptpgeo_member5_mt),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1073,c_0_1074]),c_0_1075]) ).

cnf(c_0_1080,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1076,c_0_1077]),c_0_1078])]),c_0_1079]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR059+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n024.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun 11 18:45:35 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.50  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.50  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.50  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.71/2.83  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.71/2.83  # Version: 2.1pre011
% 8.71/2.83  # Preprocessing time       : 0.041 s
% 8.71/2.83  
% 8.71/2.83  # Proof found!
% 8.71/2.83  # SZS status Theorem
% 8.71/2.83  # SZS output start CNFRefutation
% See solution above
% 8.71/2.83  # Proof object total steps             : 14
% 8.71/2.83  # Proof object clause steps            : 8
% 8.71/2.83  # Proof object formula steps           : 6
% 8.71/2.83  # Proof object conjectures             : 4
% 8.71/2.83  # Proof object clause conjectures      : 2
% 8.71/2.83  # Proof object formula conjectures     : 2
% 8.71/2.83  # Proof object initial clauses used    : 6
% 8.71/2.83  # Proof object initial formulas used   : 6
% 8.71/2.83  # Proof object generating inferences   : 2
% 8.71/2.83  # Proof object simplifying inferences  : 4
% 8.71/2.83  # Training examples: 0 positive, 0 negative
% 8.71/2.83  # Parsed axioms                        : 1066
% 8.71/2.83  # Removed by relevancy pruning/SinE    : 0
% 8.71/2.83  # Initial clauses                      : 1066
% 8.71/2.83  # Removed in clause preprocessing      : 0
% 8.71/2.83  # Initial clauses in saturation        : 1066
% 8.71/2.83  # Processed clauses                    : 1070
% 8.71/2.83  # ...of these trivial                  : 1
% 8.71/2.83  # ...subsumed                          : 31
% 8.71/2.83  # ...remaining for further processing  : 1037
% 8.71/2.83  # Other redundant clauses eliminated   : 0
% 8.71/2.83  # Clauses deleted for lack of memory   : 0
% 8.71/2.83  # Backward-subsumed                    : 0
% 8.71/2.83  # Backward-rewritten                   : 1
% 8.71/2.83  # Generated clauses                    : 2289
% 8.71/2.83  # ...of the previous two non-trivial   : 2085
% 8.71/2.83  # Contextual simplify-reflections      : 0
% 8.71/2.83  # Paramodulations                      : 2289
% 8.71/2.83  # Factorizations                       : 0
% 8.71/2.83  # Equation resolutions                 : 0
% 8.71/2.83  # Propositional unsat checks           : 0
% 8.71/2.83  # Propositional unsat check successes  : 0
% 8.71/2.83  # Current number of processed clauses  : 1036
% 8.71/2.83  #    Positive orientable unit clauses  : 330
% 8.71/2.83  #    Positive unorientable unit clauses: 0
% 8.71/2.83  #    Negative unit clauses             : 4
% 8.71/2.83  #    Non-unit-clauses                  : 702
% 8.71/2.83  # Current number of unprocessed clauses: 2079
% 8.71/2.83  # ...number of literals in the above   : 3657
% 8.71/2.83  # Current number of archived formulas  : 0
% 8.71/2.83  # Current number of archived clauses   : 1
% 8.71/2.83  # Clause-clause subsumption calls (NU) : 65152
% 8.71/2.83  # Rec. Clause-clause subsumption calls : 59946
% 8.71/2.83  # Non-unit clause-clause subsumptions  : 31
% 8.71/2.83  # Unit Clause-clause subsumption calls : 1681
% 8.71/2.83  # Rewrite failures with RHS unbound    : 0
% 8.71/2.83  # BW rewrite match attempts            : 4
% 8.71/2.83  # BW rewrite match successes           : 1
% 8.71/2.83  # Condensation attempts                : 0
% 8.71/2.83  # Condensation successes               : 0
% 8.71/2.83  # Termbank termtop insertions          : 32206
% 8.71/2.83  
% 8.71/2.83  # -------------------------------------------------
% 8.71/2.83  # User time                : 0.073 s
% 8.71/2.83  # System time              : 0.011 s
% 8.71/2.83  # Total time               : 0.084 s
% 8.71/2.83  # ...preprocessing         : 0.041 s
% 8.71/2.83  # ...main loop             : 0.043 s
% 8.71/2.83  # Maximum resident set size: 10228 pages
% 8.71/2.83  
%------------------------------------------------------------------------------