TSTP Solution File: CSR115+17 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR115+17 : 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:13 EDT 2022

% Result   : Theorem 7.82s 2.85s
% Output   : CNFRefutation 7.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (   8 unt;   0 nHn;  21 RR)
%            Number of literals    :   61 (   0 equ;  50 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :   72 (  42 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_773,negated_conjecture,
    ( ~ attr(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ sub(X4,name_1_1)
    | ~ sub(X6,name_1_1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_773) ).

cnf(i_0_729,plain,
    ( sub(esk49_3(X1,X2,X3),name_1_1)
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_729) ).

cnf(i_0_732,plain,
    ( attr(esk48_3(X1,X2,X3),esk49_3(X1,X2,X3))
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_732) ).

cnf(i_0_535,plain,
    state_adjective_state_binding(britisch__1_1,grossbritannien_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_535) ).

cnf(i_0_284,hypothesis,
    prop(c175,britisch__1_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_284) ).

cnf(i_0_285,hypothesis,
    attr(c175,c176),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q2i7wp1/input.p',i_0_285) ).

cnf(c_0_780,negated_conjecture,
    ( ~ attr(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ sub(X4,name_1_1)
    | ~ sub(X6,name_1_1) ),
    i_0_773 ).

cnf(c_0_781,plain,
    ( sub(esk49_3(X1,X2,X3),name_1_1)
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    i_0_729 ).

cnf(c_0_782,negated_conjecture,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ attr(X3,esk49_3(X4,X1,X2))
    | ~ attr(X5,X6)
    | ~ attr(X7,X8)
    | ~ prop(X4,X1)
    | ~ sub(X6,name_1_1) ),
    inference(spm,[status(thm)],[c_0_780,c_0_781]) ).

cnf(c_0_783,plain,
    ( attr(esk48_3(X1,X2,X3),esk49_3(X1,X2,X3))
    | ~ prop(X1,X2)
    | ~ state_adjective_state_binding(X2,X3) ),
    i_0_732 ).

cnf(c_0_784,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ prop(X7,X1)
    | ~ sub(X4,name_1_1) ),
    inference(spm,[status(thm)],[c_0_782,c_0_783]) ).

cnf(c_0_785,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ state_adjective_state_binding(X3,X4)
    | ~ attr(X5,esk49_3(X6,X3,X4))
    | ~ attr(X7,X8)
    | ~ prop(X9,X1)
    | ~ prop(X6,X3) ),
    inference(spm,[status(thm)],[c_0_784,c_0_781]) ).

cnf(c_0_786,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ state_adjective_state_binding(X3,X4)
    | ~ attr(X5,X6)
    | ~ prop(X7,X1)
    | ~ prop(X8,X3) ),
    inference(spm,[status(thm)],[c_0_785,c_0_783]) ).

cnf(c_0_787,plain,
    state_adjective_state_binding(britisch__1_1,grossbritannien_0),
    i_0_535 ).

cnf(c_0_788,plain,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ attr(X3,X4)
    | ~ prop(X5,britisch__1_1)
    | ~ prop(X6,X1) ),
    inference(spm,[status(thm)],[c_0_786,c_0_787]) ).

cnf(c_0_789,hypothesis,
    prop(c175,britisch__1_1),
    i_0_284 ).

cnf(c_0_790,hypothesis,
    ( ~ state_adjective_state_binding(X1,X2)
    | ~ attr(X3,X4)
    | ~ prop(X5,X1) ),
    inference(spm,[status(thm)],[c_0_788,c_0_789]) ).

cnf(c_0_791,plain,
    ( ~ attr(X1,X2)
    | ~ prop(X3,britisch__1_1) ),
    inference(spm,[status(thm)],[c_0_790,c_0_787]) ).

cnf(c_0_792,hypothesis,
    attr(c175,c176),
    i_0_285 ).

cnf(c_0_793,hypothesis,
    ~ attr(X1,X2),
    inference(spm,[status(thm)],[c_0_791,c_0_789]) ).

cnf(c_0_794,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_792,c_0_793]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : CSR115+17 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n022.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 : Sat Jun 11 00:23:21 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.44/0.62  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.62  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.44/0.62  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.44/0.62  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.82/2.85  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.82/2.85  # Version: 2.1pre011
% 7.82/2.85  # Preprocessing time       : 0.039 s
% 7.82/2.85  
% 7.82/2.85  # Proof found!
% 7.82/2.85  # SZS status Theorem
% 7.82/2.85  # SZS output start CNFRefutation
% See solution above
% 7.82/2.85  # Proof object total steps             : 21
% 7.82/2.85  # Proof object clause steps            : 15
% 7.82/2.85  # Proof object formula steps           : 6
% 7.82/2.85  # Proof object conjectures             : 3
% 7.82/2.85  # Proof object clause conjectures      : 2
% 7.82/2.85  # Proof object formula conjectures     : 1
% 7.82/2.85  # Proof object initial clauses used    : 6
% 7.82/2.85  # Proof object initial formulas used   : 6
% 7.82/2.85  # Proof object generating inferences   : 8
% 7.82/2.85  # Proof object simplifying inferences  : 1
% 7.82/2.85  # Training examples: 0 positive, 0 negative
% 7.82/2.85  # Parsed axioms                        : 793
% 7.82/2.85  # Removed by relevancy pruning/SinE    : 0
% 7.82/2.85  # Initial clauses                      : 793
% 7.82/2.85  # Removed in clause preprocessing      : 0
% 7.82/2.85  # Initial clauses in saturation        : 793
% 7.82/2.85  # Processed clauses                    : 940
% 7.82/2.85  # ...of these trivial                  : 0
% 7.82/2.85  # ...subsumed                          : 6
% 7.82/2.85  # ...remaining for further processing  : 934
% 7.82/2.85  # Other redundant clauses eliminated   : 0
% 7.82/2.85  # Clauses deleted for lack of memory   : 0
% 7.82/2.85  # Backward-subsumed                    : 40
% 7.82/2.85  # Backward-rewritten                   : 0
% 7.82/2.85  # Generated clauses                    : 882
% 7.82/2.85  # ...of the previous two non-trivial   : 875
% 7.82/2.85  # Contextual simplify-reflections      : 10
% 7.82/2.85  # Paramodulations                      : 879
% 7.82/2.85  # Factorizations                       : 0
% 7.82/2.85  # Equation resolutions                 : 0
% 7.82/2.85  # Propositional unsat checks           : 0
% 7.82/2.85  # Propositional unsat check successes  : 0
% 7.82/2.85  # Current number of processed clauses  : 891
% 7.82/2.85  #    Positive orientable unit clauses  : 518
% 7.82/2.85  #    Positive unorientable unit clauses: 0
% 7.82/2.85  #    Negative unit clauses             : 1
% 7.82/2.85  #    Non-unit-clauses                  : 372
% 7.82/2.85  # Current number of unprocessed clauses: 724
% 7.82/2.85  # ...number of literals in the above   : 2835
% 7.82/2.85  # Current number of archived formulas  : 0
% 7.82/2.85  # Current number of archived clauses   : 43
% 7.82/2.85  # Clause-clause subsumption calls (NU) : 35181
% 7.82/2.85  # Rec. Clause-clause subsumption calls : 10695
% 7.82/2.85  # Non-unit clause-clause subsumptions  : 56
% 7.82/2.85  # Unit Clause-clause subsumption calls : 1595
% 7.82/2.85  # Rewrite failures with RHS unbound    : 0
% 7.82/2.85  # BW rewrite match attempts            : 0
% 7.82/2.85  # BW rewrite match successes           : 0
% 7.82/2.85  # Condensation attempts                : 0
% 7.82/2.85  # Condensation successes               : 0
% 7.82/2.85  # Termbank termtop insertions          : 26740
% 7.82/2.85  
% 7.82/2.85  # -------------------------------------------------
% 7.82/2.85  # User time                : 0.078 s
% 7.82/2.85  # System time              : 0.009 s
% 7.82/2.85  # Total time               : 0.087 s
% 7.82/2.85  # ...preprocessing         : 0.039 s
% 7.82/2.85  # ...main loop             : 0.048 s
% 7.82/2.85  # Maximum resident set size: 9180 pages
% 7.82/2.85  
%------------------------------------------------------------------------------