TSTP Solution File: CSR113+6 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR113+6 : TPTP v8.1.0. Released v4.0.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:49:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1042,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ flp(X3,X4)
    | ~ sub(X5,name_1_1)
    | ~ val(X5,new_york_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-43c4uflq/input.p',i_0_1042) ).

cnf(i_0_523,hypothesis,
    val(c24785,new_york_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-43c4uflq/input.p',i_0_523) ).

cnf(i_0_524,hypothesis,
    sub(c24785,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-43c4uflq/input.p',i_0_524) ).

cnf(i_0_505,hypothesis,
    flp(c25868,c25819),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-43c4uflq/input.p',i_0_505) ).

cnf(i_0_517,hypothesis,
    scar(c24791,c24784),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-43c4uflq/input.p',i_0_517) ).

cnf(c_0_1048,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ flp(X3,X4)
    | ~ sub(X5,name_1_1)
    | ~ val(X5,new_york_0) ),
    i_0_1042 ).

cnf(c_0_1049,hypothesis,
    val(c24785,new_york_0),
    i_0_523 ).

cnf(c_0_1050,hypothesis,
    sub(c24785,name_1_1),
    i_0_524 ).

cnf(c_0_1051,negated_conjecture,
    ( ~ flp(X1,X2)
    | ~ scar(X3,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1048,c_0_1049]),c_0_1050])]) ).

cnf(c_0_1052,hypothesis,
    flp(c25868,c25819),
    i_0_505 ).

cnf(c_0_1053,hypothesis,
    scar(c24791,c24784),
    i_0_517 ).

cnf(c_0_1054,hypothesis,
    ~ scar(X1,X2),
    inference(spm,[status(thm)],[c_0_1051,c_0_1052]) ).

cnf(c_0_1055,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_1053,c_0_1054]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CSR113+6 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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 : Fri Jun 10 19:37:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.37/0.60  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.60  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.37/0.60  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.37/0.60  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.03/2.69  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.03/2.69  # Version: 2.1pre011
% 5.03/2.69  # Preprocessing time       : 0.032 s
% 5.03/2.69  
% 5.03/2.69  # Proof found!
% 5.03/2.69  # SZS status Theorem
% 5.03/2.69  # SZS output start CNFRefutation
% See solution above
% 5.03/2.69  # Proof object total steps             : 13
% 5.03/2.69  # Proof object clause steps            : 8
% 5.03/2.69  # Proof object formula steps           : 5
% 5.03/2.69  # Proof object conjectures             : 3
% 5.03/2.69  # Proof object clause conjectures      : 2
% 5.03/2.69  # Proof object formula conjectures     : 1
% 5.03/2.69  # Proof object initial clauses used    : 5
% 5.03/2.69  # Proof object initial formulas used   : 5
% 5.03/2.69  # Proof object generating inferences   : 2
% 5.03/2.69  # Proof object simplifying inferences  : 3
% 5.03/2.69  # Training examples: 0 positive, 0 negative
% 5.03/2.69  # Parsed axioms                        : 1062
% 5.03/2.69  # Removed by relevancy pruning/SinE    : 0
% 5.03/2.69  # Initial clauses                      : 1062
% 5.03/2.69  # Removed in clause preprocessing      : 0
% 5.03/2.69  # Initial clauses in saturation        : 1062
% 5.03/2.69  # Processed clauses                    : 1066
% 5.03/2.69  # ...of these trivial                  : 2
% 5.03/2.69  # ...subsumed                          : 0
% 5.03/2.69  # ...remaining for further processing  : 1064
% 5.03/2.69  # Other redundant clauses eliminated   : 0
% 5.03/2.69  # Clauses deleted for lack of memory   : 0
% 5.03/2.69  # Backward-subsumed                    : 1
% 5.03/2.69  # Backward-rewritten                   : 0
% 5.03/2.69  # Generated clauses                    : 1893
% 5.03/2.69  # ...of the previous two non-trivial   : 1878
% 5.03/2.69  # Contextual simplify-reflections      : 0
% 5.03/2.69  # Paramodulations                      : 1892
% 5.03/2.69  # Factorizations                       : 0
% 5.03/2.69  # Equation resolutions                 : 0
% 5.03/2.69  # Propositional unsat checks           : 0
% 5.03/2.69  # Propositional unsat check successes  : 0
% 5.03/2.69  # Current number of processed clauses  : 1062
% 5.03/2.69  #    Positive orientable unit clauses  : 752
% 5.03/2.69  #    Positive unorientable unit clauses: 0
% 5.03/2.69  #    Negative unit clauses             : 1
% 5.03/2.69  #    Non-unit-clauses                  : 309
% 5.03/2.69  # Current number of unprocessed clauses: 1868
% 5.03/2.69  # ...number of literals in the above   : 5596
% 5.03/2.69  # Current number of archived formulas  : 0
% 5.03/2.69  # Current number of archived clauses   : 2
% 5.03/2.69  # Clause-clause subsumption calls (NU) : 28865
% 5.03/2.69  # Rec. Clause-clause subsumption calls : 9042
% 5.03/2.69  # Non-unit clause-clause subsumptions  : 1
% 5.03/2.69  # Unit Clause-clause subsumption calls : 3707
% 5.03/2.69  # Rewrite failures with RHS unbound    : 0
% 5.03/2.69  # BW rewrite match attempts            : 0
% 5.03/2.69  # BW rewrite match successes           : 0
% 5.03/2.69  # Condensation attempts                : 0
% 5.03/2.69  # Condensation successes               : 0
% 5.03/2.69  # Termbank termtop insertions          : 36477
% 5.03/2.69  
% 5.03/2.69  # -------------------------------------------------
% 5.03/2.69  # User time                : 0.069 s
% 5.03/2.69  # System time              : 0.006 s
% 5.03/2.69  # Total time               : 0.075 s
% 5.03/2.69  # ...preprocessing         : 0.032 s
% 5.03/2.69  # ...main loop             : 0.043 s
% 5.03/2.69  # Maximum resident set size: 11292 pages
% 5.03/2.69  
%------------------------------------------------------------------------------