↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR114+29 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n020.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 8.29s 2.69s
% Output   : CNFRefutation 8.29s
% 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_792,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-e_90yxq0/input.p',i_0_792) ).

cnf(i_0_283,hypothesis,
    val(c148,rom_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_283) ).

cnf(i_0_284,hypothesis,
    sub(c148,name_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_284) ).

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

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

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

cnf(i_0_288,hypothesis,
    loc(c140,c169),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_288) ).

cnf(i_0_287,hypothesis,
    sub(c140,kolosseum_1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_287) ).

cnf(i_0_280,hypothesis,
    in(c169,c147),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_280) ).

cnf(i_0_286,hypothesis,
    attr(c147,c148),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_286) ).

cnf(i_0_285,hypothesis,
    sub(c147,stadt__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e_90yxq0/input.p',i_0_285) ).

cnf(c_0_804,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_792 ).

cnf(c_0_805,hypothesis,
    val(c148,rom_0),
    i_0_283 ).

cnf(c_0_806,hypothesis,
    sub(c148,name_1_1),
    i_0_284 ).

cnf(c_0_807,negated_conjecture,
    ( ~ attr(X1,c148)
    | ~ 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_804,c_0_805]),c_0_806])]) ).

cnf(c_0_808,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_660 ).

cnf(c_0_809,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_659 ).

cnf(c_0_810,plain,
    ( ~ attr(X1,c148)
    | ~ 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_807,c_0_808]),c_0_809]) ).

cnf(c_0_811,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_661 ).

cnf(c_0_812,plain,
    ( ~ attr(X1,c148)
    | ~ sub(X2,kolosseum_1_1)
    | ~ sub(X1,stadt__1_1)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_810,c_0_811]) ).

cnf(c_0_813,hypothesis,
    loc(c140,c169),
    i_0_288 ).

cnf(c_0_814,hypothesis,
    sub(c140,kolosseum_1_1),
    i_0_287 ).

cnf(c_0_815,hypothesis,
    ( ~ attr(X1,c148)
    | ~ sub(X1,stadt__1_1)
    | ~ in(c169,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_812,c_0_813]),c_0_814])]) ).

cnf(c_0_816,hypothesis,
    in(c169,c147),
    i_0_280 ).

cnf(c_0_817,hypothesis,
    attr(c147,c148),
    i_0_286 ).

cnf(c_0_818,hypothesis,
    sub(c147,stadt__1_1),
    i_0_285 ).

cnf(c_0_819,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_815,c_0_816]),c_0_817]),c_0_818])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR114+29 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 03:15:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.59  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.29/2.69  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.29/2.69  # Version: 2.1pre011
% 8.29/2.69  # Preprocessing time       : 0.022 s
% 8.29/2.69  
% 8.29/2.69  # Proof found!
% 8.29/2.69  # SZS status Theorem
% 8.29/2.69  # SZS output start CNFRefutation
% See solution above
% 8.29/2.69  # Proof object total steps             : 27
% 8.29/2.69  # Proof object clause steps            : 16
% 8.29/2.69  # Proof object formula steps           : 11
% 8.29/2.69  # Proof object conjectures             : 3
% 8.29/2.69  # Proof object clause conjectures      : 2
% 8.29/2.69  # Proof object formula conjectures     : 1
% 8.29/2.69  # Proof object initial clauses used    : 11
% 8.29/2.69  # Proof object initial formulas used   : 11
% 8.29/2.69  # Proof object generating inferences   : 5
% 8.29/2.69  # Proof object simplifying inferences  : 8
% 8.29/2.69  # Training examples: 0 positive, 0 negative
% 8.29/2.69  # Parsed axioms                        : 812
% 8.29/2.69  # Removed by relevancy pruning/SinE    : 0
% 8.29/2.69  # Initial clauses                      : 812
% 8.29/2.69  # Removed in clause preprocessing      : 0
% 8.29/2.69  # Initial clauses in saturation        : 812
% 8.29/2.69  # Processed clauses                    : 825
% 8.29/2.69  # ...of these trivial                  : 0
% 8.29/2.69  # ...subsumed                          : 0
% 8.29/2.69  # ...remaining for further processing  : 825
% 8.29/2.69  # Other redundant clauses eliminated   : 0
% 8.29/2.69  # Clauses deleted for lack of memory   : 0
% 8.29/2.69  # Backward-subsumed                    : 0
% 8.29/2.69  # Backward-rewritten                   : 0
% 8.29/2.69  # Generated clauses                    : 1742
% 8.29/2.69  # ...of the previous two non-trivial   : 1741
% 8.29/2.69  # Contextual simplify-reflections      : 1
% 8.29/2.69  # Paramodulations                      : 1742
% 8.29/2.69  # Factorizations                       : 0
% 8.29/2.69  # Equation resolutions                 : 0
% 8.29/2.69  # Propositional unsat checks           : 0
% 8.29/2.69  # Propositional unsat check successes  : 0
% 8.29/2.69  # Current number of processed clauses  : 825
% 8.29/2.69  #    Positive orientable unit clauses  : 506
% 8.29/2.69  #    Positive unorientable unit clauses: 0
% 8.29/2.69  #    Negative unit clauses             : 0
% 8.29/2.69  #    Non-unit-clauses                  : 319
% 8.29/2.69  # Current number of unprocessed clauses: 1728
% 8.29/2.69  # ...number of literals in the above   : 5427
% 8.29/2.69  # Current number of archived formulas  : 0
% 8.29/2.69  # Current number of archived clauses   : 0
% 8.29/2.69  # Clause-clause subsumption calls (NU) : 24835
% 8.29/2.69  # Rec. Clause-clause subsumption calls : 8911
% 8.29/2.69  # Non-unit clause-clause subsumptions  : 1
% 8.29/2.69  # Unit Clause-clause subsumption calls : 1601
% 8.29/2.69  # Rewrite failures with RHS unbound    : 0
% 8.29/2.69  # BW rewrite match attempts            : 0
% 8.29/2.69  # BW rewrite match successes           : 0
% 8.29/2.69  # Condensation attempts                : 0
% 8.29/2.69  # Condensation successes               : 0
% 8.29/2.69  # Termbank termtop insertions          : 33833
% 8.29/2.69  
% 8.29/2.69  # -------------------------------------------------
% 8.29/2.69  # User time                : 0.053 s
% 8.29/2.69  # System time              : 0.004 s
% 8.29/2.69  # Total time               : 0.057 s
% 8.29/2.69  # ...preprocessing         : 0.022 s
% 8.29/2.69  # ...main loop             : 0.036 s
% 8.29/2.69  # Maximum resident set size: 10036 pages
% 8.29/2.69  
%------------------------------------------------------------------------------