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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR113+14 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n029.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:01 EDT 2022

% Result   : Theorem 6.91s 2.62s
% Output   : CNFRefutation 6.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  11 unt;   0 nHn;  26 RR)
%            Number of literals    :   58 (   0 equ;  39 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   41 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_722,negated_conjecture,
    ( ~ loc(X1,X2)
    | ~ scar(X1,X3)
    | ~ attr(X4,X5)
    | ~ flp(X2,X4)
    | ~ subs(X1,stehen_1_1)
    | ~ sub(X5,name_1_1)
    | ~ val(X5,new_york_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_722) ).

cnf(i_0_221,hypothesis,
    val(c38,new_york_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_221) ).

cnf(i_0_222,hypothesis,
    sub(c38,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_222) ).

cnf(i_0_590,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_590) ).

cnf(i_0_589,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_589) ).

cnf(i_0_591,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_591) ).

cnf(i_0_579,plain,
    ( flp(X1,X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_579) ).

cnf(i_0_229,hypothesis,
    loc(c29,c41),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_229) ).

cnf(i_0_220,hypothesis,
    in(c41,c37),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_220) ).

cnf(i_0_224,hypothesis,
    attr(c37,c38),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xomnq7h6/input.p',i_0_224) ).

cnf(c_0_733,negated_conjecture,
    ( ~ loc(X1,X2)
    | ~ scar(X1,X3)
    | ~ attr(X4,X5)
    | ~ flp(X2,X4)
    | ~ subs(X1,stehen_1_1)
    | ~ sub(X5,name_1_1)
    | ~ val(X5,new_york_0) ),
    i_0_722 ).

cnf(c_0_734,hypothesis,
    val(c38,new_york_0),
    i_0_221 ).

cnf(c_0_735,hypothesis,
    sub(c38,name_1_1),
    i_0_222 ).

cnf(c_0_736,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ flp(X3,X4)
    | ~ attr(X4,c38)
    | ~ loc(X1,X3)
    | ~ subs(X1,stehen_1_1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_733,c_0_734]),c_0_735])]) ).

cnf(c_0_737,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_590 ).

cnf(c_0_738,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_589 ).

cnf(c_0_739,plain,
    ( ~ flp(X1,X2)
    | ~ attr(X2,c38)
    | ~ loc(esk27_2(X3,X4),X1)
    | ~ loc(X3,X4) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_736,c_0_737]),c_0_738]) ).

cnf(c_0_740,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_591 ).

cnf(c_0_741,plain,
    ( ~ flp(X1,X2)
    | ~ attr(X2,c38)
    | ~ loc(X3,X1) ),
    inference(spm,[status(thm)],[c_0_739,c_0_740]) ).

cnf(c_0_742,plain,
    ( flp(X1,X2)
    | ~ in(X1,X2) ),
    i_0_579 ).

cnf(c_0_743,plain,
    ( ~ attr(X1,c38)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_741,c_0_742]) ).

cnf(c_0_744,hypothesis,
    loc(c29,c41),
    i_0_229 ).

cnf(c_0_745,hypothesis,
    ( ~ attr(X1,c38)
    | ~ in(c41,X1) ),
    inference(spm,[status(thm)],[c_0_743,c_0_744]) ).

cnf(c_0_746,hypothesis,
    in(c41,c37),
    i_0_220 ).

cnf(c_0_747,hypothesis,
    attr(c37,c38),
    i_0_224 ).

cnf(c_0_748,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_745,c_0_746]),c_0_747])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR113+14 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n029.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 : Fri Jun 10 18:35:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.37/0.61  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.61  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.37/0.61  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.37/0.61  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.91/2.62  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.91/2.62  # Version: 2.1pre011
% 6.91/2.62  # Preprocessing time       : 0.020 s
% 6.91/2.62  
% 6.91/2.62  # Proof found!
% 6.91/2.62  # SZS status Theorem
% 6.91/2.62  # SZS output start CNFRefutation
% See solution above
% 6.91/2.62  # Proof object total steps             : 26
% 6.91/2.62  # Proof object clause steps            : 16
% 6.91/2.62  # Proof object formula steps           : 10
% 6.91/2.62  # Proof object conjectures             : 3
% 6.91/2.62  # Proof object clause conjectures      : 2
% 6.91/2.62  # Proof object formula conjectures     : 1
% 6.91/2.62  # Proof object initial clauses used    : 10
% 6.91/2.62  # Proof object initial formulas used   : 10
% 6.91/2.62  # Proof object generating inferences   : 6
% 6.91/2.62  # Proof object simplifying inferences  : 5
% 6.91/2.62  # Training examples: 0 positive, 0 negative
% 6.91/2.62  # Parsed axioms                        : 742
% 6.91/2.62  # Removed by relevancy pruning/SinE    : 0
% 6.91/2.62  # Initial clauses                      : 742
% 6.91/2.62  # Removed in clause preprocessing      : 0
% 6.91/2.62  # Initial clauses in saturation        : 742
% 6.91/2.62  # Processed clauses                    : 769
% 6.91/2.62  # ...of these trivial                  : 2
% 6.91/2.62  # ...subsumed                          : 1
% 6.91/2.62  # ...remaining for further processing  : 766
% 6.91/2.62  # Other redundant clauses eliminated   : 0
% 6.91/2.62  # Clauses deleted for lack of memory   : 0
% 6.91/2.62  # Backward-subsumed                    : 3
% 6.91/2.62  # Backward-rewritten                   : 0
% 6.91/2.62  # Generated clauses                    : 1688
% 6.91/2.62  # ...of the previous two non-trivial   : 1687
% 6.91/2.62  # Contextual simplify-reflections      : 3
% 6.91/2.62  # Paramodulations                      : 1688
% 6.91/2.62  # Factorizations                       : 0
% 6.91/2.62  # Equation resolutions                 : 0
% 6.91/2.62  # Propositional unsat checks           : 0
% 6.91/2.62  # Propositional unsat check successes  : 0
% 6.91/2.62  # Current number of processed clauses  : 763
% 6.91/2.62  #    Positive orientable unit clauses  : 437
% 6.91/2.62  #    Positive unorientable unit clauses: 0
% 6.91/2.62  #    Negative unit clauses             : 0
% 6.91/2.62  #    Non-unit-clauses                  : 326
% 6.91/2.62  # Current number of unprocessed clauses: 1640
% 6.91/2.62  # ...number of literals in the above   : 5129
% 6.91/2.62  # Current number of archived formulas  : 0
% 6.91/2.62  # Current number of archived clauses   : 3
% 6.91/2.62  # Clause-clause subsumption calls (NU) : 24048
% 6.91/2.62  # Rec. Clause-clause subsumption calls : 8048
% 6.91/2.62  # Non-unit clause-clause subsumptions  : 7
% 6.91/2.62  # Unit Clause-clause subsumption calls : 1755
% 6.91/2.62  # Rewrite failures with RHS unbound    : 0
% 6.91/2.62  # BW rewrite match attempts            : 0
% 6.91/2.62  # BW rewrite match successes           : 0
% 6.91/2.62  # Condensation attempts                : 0
% 6.91/2.62  # Condensation successes               : 0
% 6.91/2.62  # Termbank termtop insertions          : 32778
% 6.91/2.62  
% 6.91/2.62  # -------------------------------------------------
% 6.91/2.62  # User time                : 0.050 s
% 6.91/2.62  # System time              : 0.004 s
% 6.91/2.62  # Total time               : 0.054 s
% 6.91/2.62  # ...preprocessing         : 0.020 s
% 6.91/2.62  # ...main loop             : 0.034 s
% 6.91/2.62  # Maximum resident set size: 9572 pages
% 6.91/2.62  
%------------------------------------------------------------------------------