TSTP Solution File: LCL451+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL451+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n014.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 : Sun Jul 17 09:26:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( cn1
    | ~ is_a_theorem(implies(implies(esk7_0,esk8_0),implies(implies(esk8_0,esk9_0),implies(esk7_0,esk9_0)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zjsdxltq/input.p',i_0_7) ).

cnf(i_0_48,negated_conjecture,
    ~ cn1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zjsdxltq/input.p',i_0_48) ).

cnf(i_0_41,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ implies_3 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zjsdxltq/input.p',i_0_41) ).

cnf(i_0_27,plain,
    implies_3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zjsdxltq/input.p',i_0_27) ).

cnf(c_0_53,plain,
    ( cn1
    | ~ is_a_theorem(implies(implies(esk7_0,esk8_0),implies(implies(esk8_0,esk9_0),implies(esk7_0,esk9_0)))) ),
    i_0_7 ).

cnf(c_0_54,negated_conjecture,
    ~ cn1,
    i_0_48 ).

cnf(c_0_55,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ implies_3 ),
    i_0_41 ).

cnf(c_0_56,plain,
    implies_3,
    i_0_27 ).

cnf(c_0_57,plain,
    ~ is_a_theorem(implies(implies(esk7_0,esk8_0),implies(implies(esk8_0,esk9_0),implies(esk7_0,esk9_0)))),
    inference(sr,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).

cnf(c_0_59,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL451+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jul  3 05:30:11 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.66/2.44  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.66/2.44  # Version: 2.1pre011
% 7.66/2.44  # Preprocessing time       : 0.019 s
% 7.66/2.44  
% 7.66/2.44  # Proof found!
% 7.66/2.44  # SZS status Theorem
% 7.66/2.44  # SZS output start CNFRefutation
% See solution above
% 7.66/2.44  # Proof object total steps             : 11
% 7.66/2.44  # Proof object clause steps            : 7
% 7.66/2.44  # Proof object formula steps           : 4
% 7.66/2.44  # Proof object conjectures             : 2
% 7.66/2.44  # Proof object clause conjectures      : 1
% 7.66/2.44  # Proof object formula conjectures     : 1
% 7.66/2.44  # Proof object initial clauses used    : 4
% 7.66/2.44  # Proof object initial formulas used   : 4
% 7.66/2.44  # Proof object generating inferences   : 0
% 7.66/2.44  # Proof object simplifying inferences  : 5
% 7.66/2.44  # Training examples: 0 positive, 0 negative
% 7.66/2.44  # Parsed axioms                        : 81
% 7.66/2.44  # Removed by relevancy pruning/SinE    : 0
% 7.66/2.44  # Initial clauses                      : 81
% 7.66/2.44  # Removed in clause preprocessing      : 0
% 7.66/2.44  # Initial clauses in saturation        : 81
% 7.66/2.44  # Processed clauses                    : 75
% 7.66/2.44  # ...of these trivial                  : 22
% 7.66/2.44  # ...subsumed                          : 0
% 7.66/2.44  # ...remaining for further processing  : 53
% 7.66/2.44  # Other redundant clauses eliminated   : 0
% 7.66/2.44  # Clauses deleted for lack of memory   : 0
% 7.66/2.44  # Backward-subsumed                    : 0
% 7.66/2.44  # Backward-rewritten                   : 5
% 7.66/2.44  # Generated clauses                    : 64
% 7.66/2.44  # ...of the previous two non-trivial   : 57
% 7.66/2.44  # Contextual simplify-reflections      : 0
% 7.66/2.44  # Paramodulations                      : 64
% 7.66/2.44  # Factorizations                       : 0
% 7.66/2.44  # Equation resolutions                 : 0
% 7.66/2.44  # Propositional unsat checks           : 0
% 7.66/2.44  # Propositional unsat check successes  : 0
% 7.66/2.44  # Current number of processed clauses  : 48
% 7.66/2.44  #    Positive orientable unit clauses  : 33
% 7.66/2.44  #    Positive unorientable unit clauses: 0
% 7.66/2.44  #    Negative unit clauses             : 1
% 7.66/2.44  #    Non-unit-clauses                  : 14
% 7.66/2.44  # Current number of unprocessed clauses: 63
% 7.66/2.44  # ...number of literals in the above   : 116
% 7.66/2.44  # Current number of archived formulas  : 0
% 7.66/2.44  # Current number of archived clauses   : 5
% 7.66/2.44  # Clause-clause subsumption calls (NU) : 4
% 7.66/2.44  # Rec. Clause-clause subsumption calls : 4
% 7.66/2.44  # Non-unit clause-clause subsumptions  : 0
% 7.66/2.44  # Unit Clause-clause subsumption calls : 15
% 7.66/2.44  # Rewrite failures with RHS unbound    : 0
% 7.66/2.44  # BW rewrite match attempts            : 19
% 7.66/2.44  # BW rewrite match successes           : 4
% 7.66/2.44  # Condensation attempts                : 0
% 7.66/2.44  # Condensation successes               : 0
% 7.66/2.44  # Termbank termtop insertions          : 1956
% 7.66/2.44  
% 7.66/2.44  # -------------------------------------------------
% 7.66/2.44  # User time                : 0.015 s
% 7.66/2.44  # System time              : 0.007 s
% 7.66/2.44  # Total time               : 0.022 s
% 7.66/2.44  # ...preprocessing         : 0.019 s
% 7.66/2.44  # ...main loop             : 0.003 s
% 7.66/2.44  # Maximum resident set size: 7132 pages
% 7.66/2.44  
%------------------------------------------------------------------------------