↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n018.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 8.72s 2.78s
% Output   : CNFRefutation 8.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (  13 unt;   0 nHn;  28 RR)
%            Number of literals    :   66 (   0 equ;  45 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn)

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

cnf(i_0_494,hypothesis,
    val(c7173,new_york_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_494) ).

cnf(i_0_495,hypothesis,
    sub(c7173,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_495) ).

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

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

cnf(i_0_888,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_888) ).

cnf(i_0_876,plain,
    ( flp(X1,X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_876) ).

cnf(i_0_499,hypothesis,
    loc(c7166,c7202),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_499) ).

cnf(i_0_498,hypothesis,
    sub(c7166,freiheitsstatue_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_498) ).

cnf(i_0_488,hypothesis,
    in(c7202,c7172),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_488) ).

cnf(i_0_497,hypothesis,
    attr(c7172,c7173),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eotoszfv/input.p',i_0_497) ).

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

cnf(c_0_1032,hypothesis,
    val(c7173,new_york_0),
    i_0_494 ).

cnf(c_0_1033,hypothesis,
    sub(c7173,name_1_1),
    i_0_495 ).

cnf(c_0_1034,negated_conjecture,
    ( ~ scar(X1,X2)
    | ~ flp(X3,X4)
    | ~ attr(X4,c7173)
    | ~ sub(X2,freiheitsstatue_1_1)
    | ~ loc(X1,X3)
    | ~ subs(X1,stehen_1_1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1031,c_0_1032]),c_0_1033])]) ).

cnf(c_0_1035,plain,
    ( scar(esk27_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    i_0_887 ).

cnf(c_0_1036,plain,
    ( subs(esk27_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    i_0_886 ).

cnf(c_0_1037,plain,
    ( ~ flp(X1,X2)
    | ~ attr(X2,c7173)
    | ~ sub(X3,freiheitsstatue_1_1)
    | ~ loc(esk27_2(X3,X4),X1)
    | ~ loc(X3,X4) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1034,c_0_1035]),c_0_1036]) ).

cnf(c_0_1038,plain,
    ( loc(esk27_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    i_0_888 ).

cnf(c_0_1039,plain,
    ( ~ flp(X1,X2)
    | ~ attr(X2,c7173)
    | ~ sub(X3,freiheitsstatue_1_1)
    | ~ loc(X3,X1) ),
    inference(spm,[status(thm)],[c_0_1037,c_0_1038]) ).

cnf(c_0_1040,plain,
    ( flp(X1,X2)
    | ~ in(X1,X2) ),
    i_0_876 ).

cnf(c_0_1041,plain,
    ( ~ attr(X1,c7173)
    | ~ sub(X2,freiheitsstatue_1_1)
    | ~ loc(X2,X3)
    | ~ in(X3,X1) ),
    inference(spm,[status(thm)],[c_0_1039,c_0_1040]) ).

cnf(c_0_1042,hypothesis,
    loc(c7166,c7202),
    i_0_499 ).

cnf(c_0_1043,hypothesis,
    sub(c7166,freiheitsstatue_1_1),
    i_0_498 ).

cnf(c_0_1044,hypothesis,
    ( ~ attr(X1,c7173)
    | ~ in(c7202,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1041,c_0_1042]),c_0_1043])]) ).

cnf(c_0_1045,hypothesis,
    in(c7202,c7172),
    i_0_488 ).

cnf(c_0_1046,hypothesis,
    attr(c7172,c7173),
    i_0_497 ).

cnf(c_0_1047,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1044,c_0_1045]),c_0_1046])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR113+7 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 : Sat Jun 11 00:21:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.38/0.59  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.38/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.38/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.72/2.78  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.72/2.78  # Version: 2.1pre011
% 8.72/2.78  # Preprocessing time       : 0.026 s
% 8.72/2.78  
% 8.72/2.78  # Proof found!
% 8.72/2.78  # SZS status Theorem
% 8.72/2.78  # SZS output start CNFRefutation
% See solution above
% 8.72/2.78  # Proof object total steps             : 28
% 8.72/2.78  # Proof object clause steps            : 17
% 8.72/2.78  # Proof object formula steps           : 11
% 8.72/2.78  # Proof object conjectures             : 3
% 8.72/2.78  # Proof object clause conjectures      : 2
% 8.72/2.78  # Proof object formula conjectures     : 1
% 8.72/2.78  # Proof object initial clauses used    : 11
% 8.72/2.78  # Proof object initial formulas used   : 11
% 8.72/2.78  # Proof object generating inferences   : 6
% 8.72/2.78  # Proof object simplifying inferences  : 7
% 8.72/2.78  # Training examples: 0 positive, 0 negative
% 8.72/2.78  # Parsed axioms                        : 1039
% 8.72/2.78  # Removed by relevancy pruning/SinE    : 0
% 8.72/2.78  # Initial clauses                      : 1039
% 8.72/2.78  # Removed in clause preprocessing      : 0
% 8.72/2.78  # Initial clauses in saturation        : 1039
% 8.72/2.78  # Processed clauses                    : 1062
% 8.72/2.78  # ...of these trivial                  : 2
% 8.72/2.78  # ...subsumed                          : 0
% 8.72/2.78  # ...remaining for further processing  : 1060
% 8.72/2.78  # Other redundant clauses eliminated   : 0
% 8.72/2.78  # Clauses deleted for lack of memory   : 0
% 8.72/2.78  # Backward-subsumed                    : 0
% 8.72/2.78  # Backward-rewritten                   : 0
% 8.72/2.78  # Generated clauses                    : 1890
% 8.72/2.78  # ...of the previous two non-trivial   : 1889
% 8.72/2.78  # Contextual simplify-reflections      : 2
% 8.72/2.78  # Paramodulations                      : 1890
% 8.72/2.78  # Factorizations                       : 0
% 8.72/2.78  # Equation resolutions                 : 0
% 8.72/2.78  # Propositional unsat checks           : 0
% 8.72/2.78  # Propositional unsat check successes  : 0
% 8.72/2.78  # Current number of processed clauses  : 1060
% 8.72/2.78  #    Positive orientable unit clauses  : 733
% 8.72/2.78  #    Positive unorientable unit clauses: 0
% 8.72/2.78  #    Negative unit clauses             : 0
% 8.72/2.78  #    Non-unit-clauses                  : 327
% 8.72/2.78  # Current number of unprocessed clauses: 1866
% 8.72/2.78  # ...number of literals in the above   : 5739
% 8.72/2.78  # Current number of archived formulas  : 0
% 8.72/2.78  # Current number of archived clauses   : 0
% 8.72/2.78  # Clause-clause subsumption calls (NU) : 26210
% 8.72/2.78  # Rec. Clause-clause subsumption calls : 7941
% 8.72/2.78  # Non-unit clause-clause subsumptions  : 2
% 8.72/2.78  # Unit Clause-clause subsumption calls : 750
% 8.72/2.78  # Rewrite failures with RHS unbound    : 0
% 8.72/2.78  # BW rewrite match attempts            : 0
% 8.72/2.78  # BW rewrite match successes           : 0
% 8.72/2.78  # Condensation attempts                : 0
% 8.72/2.78  # Condensation successes               : 0
% 8.72/2.78  # Termbank termtop insertions          : 37038
% 8.72/2.78  
% 8.72/2.78  # -------------------------------------------------
% 8.72/2.78  # User time                : 0.057 s
% 8.72/2.78  # System time              : 0.010 s
% 8.72/2.78  # Total time               : 0.067 s
% 8.72/2.78  # ...preprocessing         : 0.026 s
% 8.72/2.78  # ...main loop             : 0.041 s
% 8.72/2.78  # Maximum resident set size: 11292 pages
% 8.72/2.78  
%------------------------------------------------------------------------------