TSTP Solution File: CSR114+27 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n022.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:09 EDT 2022

% Result   : Theorem 4.96s 2.71s
% Output   : CNFRefutation 4.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   27 (  15 unt;   0 nHn;  27 RR)
%            Number of literals    :   66 (   0 equ;  45 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_639,negated_conjecture,
    ( ~ in(X1,X2)
    | ~ loc(X3,X1)
    | ~ scar(X3,X4)
    | ~ attr(X2,X5)
    | ~ subs(X3,stehen_1_1)
    | ~ sub(X4,kolosseum_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ val(X5,rom_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_639) ).

cnf(i_0_149,hypothesis,
    val(c32,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_149) ).

cnf(i_0_150,hypothesis,
    sub(c32,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_150) ).

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

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

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

cnf(i_0_154,hypothesis,
    loc(c25,c34),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_154) ).

cnf(i_0_153,hypothesis,
    sub(c25,kolosseum_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_153) ).

cnf(i_0_148,hypothesis,
    in(c34,c31),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_148) ).

cnf(i_0_152,hypothesis,
    attr(c31,c32),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_152) ).

cnf(i_0_151,hypothesis,
    sub(c31,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2zme57yf/input.p',i_0_151) ).

cnf(c_0_651,negated_conjecture,
    ( ~ in(X1,X2)
    | ~ loc(X3,X1)
    | ~ scar(X3,X4)
    | ~ attr(X2,X5)
    | ~ subs(X3,stehen_1_1)
    | ~ sub(X4,kolosseum_1_1)
    | ~ sub(X5,name_1_1)
    | ~ sub(X2,stadt__1_1)
    | ~ val(X5,rom_0) ),
    i_0_639 ).

cnf(c_0_652,hypothesis,
    val(c32,rom_0),
    i_0_149 ).

cnf(c_0_653,hypothesis,
    sub(c32,name_1_1),
    i_0_150 ).

cnf(c_0_654,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ attr(X3,c32)
    | ~ sub(X2,kolosseum_1_1)
    | ~ sub(X3,stadt__1_1)
    | ~ loc(X1,X4)
    | ~ subs(X1,stehen_1_1)
    | ~ in(X4,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_651,c_0_652]),c_0_653])]) ).

cnf(c_0_655,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_507 ).

cnf(c_0_656,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_506 ).

cnf(c_0_657,plain,
    ( ~ attr(X1,c32)
    | ~ sub(X2,kolosseum_1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ loc(esk27_2(X2,X3),X4)
    | ~ loc(X2,X3)
    | ~ in(X4,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_654,c_0_655]),c_0_656]) ).

cnf(c_0_658,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_508 ).

cnf(c_0_659,plain,
    ( ~ attr(X1,c32)
    | ~ sub(X2,kolosseum_1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_657,c_0_658]) ).

cnf(c_0_660,hypothesis,
    loc(c25,c34),
    i_0_154 ).

cnf(c_0_661,hypothesis,
    sub(c25,kolosseum_1_1),
    i_0_153 ).

cnf(c_0_662,hypothesis,
    ( ~ attr(X1,c32)
    | ~ sub(X1,stadt__1_1)
    | ~ in(c34,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_659,c_0_660]),c_0_661])]) ).

cnf(c_0_663,hypothesis,
    in(c34,c31),
    i_0_148 ).

cnf(c_0_664,hypothesis,
    attr(c31,c32),
    i_0_152 ).

cnf(c_0_665,hypothesis,
    sub(c31,stadt__1_1),
    i_0_151 ).

cnf(c_0_666,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_662,c_0_663]),c_0_664]),c_0_665])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR114+27 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun 11 18:24:05 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected SinE mode:
% 0.39/0.59  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.39/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.39/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.96/2.71  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.96/2.71  # Version: 2.1pre011
% 4.96/2.71  # Preprocessing time       : 0.021 s
% 4.96/2.71  
% 4.96/2.71  # Proof found!
% 4.96/2.71  # SZS status Theorem
% 4.96/2.71  # SZS output start CNFRefutation
% See solution above
% 4.96/2.71  # Proof object total steps             : 27
% 4.96/2.71  # Proof object clause steps            : 16
% 4.96/2.71  # Proof object formula steps           : 11
% 4.96/2.71  # Proof object conjectures             : 3
% 4.96/2.71  # Proof object clause conjectures      : 2
% 4.96/2.71  # Proof object formula conjectures     : 1
% 4.96/2.71  # Proof object initial clauses used    : 11
% 4.96/2.71  # Proof object initial formulas used   : 11
% 4.96/2.71  # Proof object generating inferences   : 5
% 4.96/2.71  # Proof object simplifying inferences  : 8
% 4.96/2.71  # Training examples: 0 positive, 0 negative
% 4.96/2.71  # Parsed axioms                        : 659
% 4.96/2.71  # Removed by relevancy pruning/SinE    : 0
% 4.96/2.71  # Initial clauses                      : 659
% 4.96/2.71  # Removed in clause preprocessing      : 0
% 4.96/2.71  # Initial clauses in saturation        : 659
% 4.96/2.71  # Processed clauses                    : 669
% 4.96/2.71  # ...of these trivial                  : 0
% 4.96/2.71  # ...subsumed                          : 0
% 4.96/2.71  # ...remaining for further processing  : 669
% 4.96/2.71  # Other redundant clauses eliminated   : 0
% 4.96/2.71  # Clauses deleted for lack of memory   : 0
% 4.96/2.71  # Backward-subsumed                    : 0
% 4.96/2.71  # Backward-rewritten                   : 0
% 4.96/2.71  # Generated clauses                    : 1605
% 4.96/2.71  # ...of the previous two non-trivial   : 1604
% 4.96/2.71  # Contextual simplify-reflections      : 1
% 4.96/2.71  # Paramodulations                      : 1605
% 4.96/2.71  # Factorizations                       : 0
% 4.96/2.71  # Equation resolutions                 : 0
% 4.96/2.71  # Propositional unsat checks           : 0
% 4.96/2.71  # Propositional unsat check successes  : 0
% 4.96/2.71  # Current number of processed clauses  : 669
% 4.96/2.71  #    Positive orientable unit clauses  : 353
% 4.96/2.71  #    Positive unorientable unit clauses: 0
% 4.96/2.71  #    Negative unit clauses             : 0
% 4.96/2.71  #    Non-unit-clauses                  : 316
% 4.96/2.71  # Current number of unprocessed clauses: 1594
% 4.96/2.71  # ...number of literals in the above   : 5188
% 4.96/2.71  # Current number of archived formulas  : 0
% 4.96/2.71  # Current number of archived clauses   : 0
% 4.96/2.71  # Clause-clause subsumption calls (NU) : 20270
% 4.96/2.71  # Rec. Clause-clause subsumption calls : 8231
% 4.96/2.71  # Non-unit clause-clause subsumptions  : 1
% 4.96/2.71  # Unit Clause-clause subsumption calls : 1110
% 4.96/2.71  # Rewrite failures with RHS unbound    : 0
% 4.96/2.71  # BW rewrite match attempts            : 0
% 4.96/2.71  # BW rewrite match successes           : 0
% 4.96/2.71  # Condensation attempts                : 0
% 4.96/2.71  # Condensation successes               : 0
% 4.96/2.71  # Termbank termtop insertions          : 31482
% 4.96/2.71  
% 4.96/2.71  # -------------------------------------------------
% 4.96/2.71  # User time                : 0.045 s
% 4.96/2.71  # System time              : 0.008 s
% 4.96/2.71  # Total time               : 0.053 s
% 4.96/2.71  # ...preprocessing         : 0.021 s
% 4.96/2.71  # ...main loop             : 0.032 s
% 4.96/2.71  # Maximum resident set size: 9188 pages
% 4.96/2.71  
%------------------------------------------------------------------------------