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

View Problem - Process Solution

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

% Result   : Theorem 5.86s 2.81s
% Output   : CNFRefutation 5.86s
% 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_766,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-3uev1b_6/input.p',i_0_766) ).

cnf(i_0_260,hypothesis,
    val(c89,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_260) ).

cnf(i_0_261,hypothesis,
    sub(c89,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_261) ).

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

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

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

cnf(i_0_265,hypothesis,
    loc(c82,c91),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_265) ).

cnf(i_0_264,hypothesis,
    sub(c82,kolosseum_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_264) ).

cnf(i_0_259,hypothesis,
    in(c91,c88),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_259) ).

cnf(i_0_263,hypothesis,
    attr(c88,c89),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_263) ).

cnf(i_0_262,hypothesis,
    sub(c88,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uev1b_6/input.p',i_0_262) ).

cnf(c_0_778,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_766 ).

cnf(c_0_779,hypothesis,
    val(c89,rom_0),
    i_0_260 ).

cnf(c_0_780,hypothesis,
    sub(c89,name_1_1),
    i_0_261 ).

cnf(c_0_781,negated_conjecture,
    ( ~ attr(X1,c89)
    | ~ scar(X2,X3)
    | ~ sub(X3,kolosseum_1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ loc(X2,X4)
    | ~ subs(X2,stehen_1_1)
    | ~ in(X4,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_778,c_0_779]),c_0_780])]) ).

cnf(c_0_782,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_634 ).

cnf(c_0_783,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_633 ).

cnf(c_0_784,plain,
    ( ~ attr(X1,c89)
    | ~ 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_781,c_0_782]),c_0_783]) ).

cnf(c_0_785,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_635 ).

cnf(c_0_786,plain,
    ( ~ attr(X1,c89)
    | ~ sub(X2,kolosseum_1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_784,c_0_785]) ).

cnf(c_0_787,hypothesis,
    loc(c82,c91),
    i_0_265 ).

cnf(c_0_788,hypothesis,
    sub(c82,kolosseum_1_1),
    i_0_264 ).

cnf(c_0_789,hypothesis,
    ( ~ attr(X1,c89)
    | ~ sub(X1,stadt__1_1)
    | ~ in(c91,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_786,c_0_787]),c_0_788])]) ).

cnf(c_0_790,hypothesis,
    in(c91,c88),
    i_0_259 ).

cnf(c_0_791,hypothesis,
    attr(c88,c89),
    i_0_263 ).

cnf(c_0_792,hypothesis,
    sub(c88,stadt__1_1),
    i_0_262 ).

cnf(c_0_793,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_789,c_0_790]),c_0_791]),c_0_792])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR114+26 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jun 10 09:54:06 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.44/0.63  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.63  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.44/0.63  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.44/0.63  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.86/2.81  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 5.86/2.81  # Version: 2.1pre011
% 5.86/2.81  # Preprocessing time       : 0.022 s
% 5.86/2.81  
% 5.86/2.81  # Proof found!
% 5.86/2.81  # SZS status Theorem
% 5.86/2.81  # SZS output start CNFRefutation
% See solution above
% 5.86/2.81  # Proof object total steps             : 27
% 5.86/2.81  # Proof object clause steps            : 16
% 5.86/2.81  # Proof object formula steps           : 11
% 5.86/2.81  # Proof object conjectures             : 3
% 5.86/2.81  # Proof object clause conjectures      : 2
% 5.86/2.81  # Proof object formula conjectures     : 1
% 5.86/2.81  # Proof object initial clauses used    : 11
% 5.86/2.81  # Proof object initial formulas used   : 11
% 5.86/2.81  # Proof object generating inferences   : 5
% 5.86/2.81  # Proof object simplifying inferences  : 8
% 5.86/2.81  # Training examples: 0 positive, 0 negative
% 5.86/2.81  # Parsed axioms                        : 786
% 5.86/2.81  # Removed by relevancy pruning/SinE    : 0
% 5.86/2.81  # Initial clauses                      : 786
% 5.86/2.81  # Removed in clause preprocessing      : 0
% 5.86/2.81  # Initial clauses in saturation        : 786
% 5.86/2.81  # Processed clauses                    : 802
% 5.86/2.81  # ...of these trivial                  : 1
% 5.86/2.81  # ...subsumed                          : 0
% 5.86/2.81  # ...remaining for further processing  : 801
% 5.86/2.81  # Other redundant clauses eliminated   : 0
% 5.86/2.81  # Clauses deleted for lack of memory   : 0
% 5.86/2.81  # Backward-subsumed                    : 0
% 5.86/2.81  # Backward-rewritten                   : 0
% 5.86/2.81  # Generated clauses                    : 1681
% 5.86/2.81  # ...of the previous two non-trivial   : 1680
% 5.86/2.81  # Contextual simplify-reflections      : 1
% 5.86/2.81  # Paramodulations                      : 1681
% 5.86/2.81  # Factorizations                       : 0
% 5.86/2.81  # Equation resolutions                 : 0
% 5.86/2.81  # Propositional unsat checks           : 0
% 5.86/2.81  # Propositional unsat check successes  : 0
% 5.86/2.81  # Current number of processed clauses  : 801
% 5.86/2.81  #    Positive orientable unit clauses  : 481
% 5.86/2.81  #    Positive unorientable unit clauses: 0
% 5.86/2.81  #    Negative unit clauses             : 0
% 5.86/2.81  #    Non-unit-clauses                  : 320
% 5.86/2.81  # Current number of unprocessed clauses: 1664
% 5.86/2.81  # ...number of literals in the above   : 5264
% 5.86/2.81  # Current number of archived formulas  : 0
% 5.86/2.81  # Current number of archived clauses   : 0
% 5.86/2.81  # Clause-clause subsumption calls (NU) : 26123
% 5.86/2.81  # Rec. Clause-clause subsumption calls : 8935
% 5.86/2.81  # Non-unit clause-clause subsumptions  : 1
% 5.86/2.81  # Unit Clause-clause subsumption calls : 2150
% 5.86/2.81  # Rewrite failures with RHS unbound    : 0
% 5.86/2.81  # BW rewrite match attempts            : 0
% 5.86/2.81  # BW rewrite match successes           : 0
% 5.86/2.81  # Condensation attempts                : 0
% 5.86/2.81  # Condensation successes               : 0
% 5.86/2.81  # Termbank termtop insertions          : 33131
% 5.86/2.81  
% 5.86/2.81  # -------------------------------------------------
% 5.86/2.81  # User time                : 0.050 s
% 5.86/2.81  # System time              : 0.007 s
% 5.86/2.81  # Total time               : 0.057 s
% 5.86/2.81  # ...preprocessing         : 0.022 s
% 5.86/2.81  # ...main loop             : 0.035 s
% 5.86/2.81  # Maximum resident set size: 9708 pages
% 5.86/2.81  
%------------------------------------------------------------------------------