↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:44:49 AM UTC 2026

% Result   : Theorem 7.46s 3.40s
% Output   : CNFRefutation 7.46s
% 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_27,plain,
    ( implies_3
    | ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qcgx40/input.p',i_0_27) ).

cnf(i_0_19,negated_conjecture,
    ~ implies_3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qcgx40/input.p',i_0_19) ).

cnf(i_0_8,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ cn1 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qcgx40/input.p',i_0_8) ).

cnf(i_0_35,plain,
    cn1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qcgx40/input.p',i_0_35) ).

cnf(c_0_40,plain,
    ( implies_3
    | ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
    i_0_27 ).

cnf(c_0_41,negated_conjecture,
    ~ implies_3,
    i_0_19 ).

cnf(c_0_42,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
    | ~ cn1 ),
    i_0_8 ).

cnf(c_0_43,plain,
    cn1,
    i_0_35 ).

cnf(c_0_44,plain,
    ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))),
    inference(sr,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,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_42,c_0_43])]) ).

cnf(c_0_46,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.36  % Computer : n019.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep  4 21:20:55 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.46  # ENIGMATIC: Selected SinE mode:
% 0.22/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.22/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.22/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.46/3.40  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.46/3.40  # Version: 2.1pre011
% 7.46/3.40  # Preprocessing time       : 0.009 s
% 7.46/3.40  
% 7.46/3.40  # Proof found!
% 7.46/3.40  # SZS status Theorem
% 7.46/3.40  # SZS output start CNFRefutation
% See solution above
% 7.46/3.40  # Proof object total steps             : 11
% 7.46/3.40  # Proof object clause steps            : 7
% 7.46/3.40  # Proof object formula steps           : 4
% 7.46/3.40  # Proof object conjectures             : 2
% 7.46/3.40  # Proof object clause conjectures      : 1
% 7.46/3.40  # Proof object formula conjectures     : 1
% 7.46/3.40  # Proof object initial clauses used    : 4
% 7.46/3.40  # Proof object initial formulas used   : 4
% 7.46/3.40  # Proof object generating inferences   : 0
% 7.46/3.40  # Proof object simplifying inferences  : 5
% 7.46/3.40  # Training examples: 0 positive, 0 negative
% 7.46/3.40  # Parsed axioms                        : 71
% 7.46/3.40  # Removed by relevancy pruning/SinE    : 0
% 7.46/3.40  # Initial clauses                      : 71
% 7.46/3.40  # Removed in clause preprocessing      : 0
% 7.46/3.40  # Initial clauses in saturation        : 71
% 7.46/3.40  # Processed clauses                    : 65
% 7.46/3.40  # ...of these trivial                  : 9
% 7.46/3.40  # ...subsumed                          : 0
% 7.46/3.40  # ...remaining for further processing  : 56
% 7.46/3.40  # Other redundant clauses eliminated   : 0
% 7.46/3.40  # Clauses deleted for lack of memory   : 0
% 7.46/3.40  # Backward-subsumed                    : 2
% 7.46/3.40  # Backward-rewritten                   : 5
% 7.46/3.40  # Generated clauses                    : 85
% 7.46/3.40  # ...of the previous two non-trivial   : 69
% 7.46/3.40  # Contextual simplify-reflections      : 0
% 7.46/3.40  # Paramodulations                      : 85
% 7.46/3.40  # Factorizations                       : 0
% 7.46/3.40  # Equation resolutions                 : 0
% 7.46/3.40  # Propositional unsat checks           : 0
% 7.46/3.40  # Propositional unsat check successes  : 0
% 7.46/3.40  # Current number of processed clauses  : 49
% 7.46/3.40  #    Positive orientable unit clauses  : 14
% 7.46/3.40  #    Positive unorientable unit clauses: 0
% 7.46/3.40  #    Negative unit clauses             : 1
% 7.46/3.40  #    Non-unit-clauses                  : 34
% 7.46/3.40  # Current number of unprocessed clauses: 70
% 7.46/3.40  # ...number of literals in the above   : 155
% 7.46/3.40  # Current number of archived formulas  : 0
% 7.46/3.40  # Current number of archived clauses   : 7
% 7.46/3.40  # Clause-clause subsumption calls (NU) : 57
% 7.46/3.40  # Rec. Clause-clause subsumption calls : 57
% 7.46/3.40  # Non-unit clause-clause subsumptions  : 0
% 7.46/3.40  # Unit Clause-clause subsumption calls : 12
% 7.46/3.40  # Rewrite failures with RHS unbound    : 0
% 7.46/3.40  # BW rewrite match attempts            : 18
% 7.46/3.40  # BW rewrite match successes           : 6
% 7.46/3.40  # Condensation attempts                : 0
% 7.46/3.40  # Condensation successes               : 0
% 7.46/3.40  # Termbank termtop insertions          : 2102
% 7.46/3.40  
% 7.46/3.40  # -------------------------------------------------
% 7.46/3.40  # User time                : 0.010 s
% 7.46/3.40  # System time              : 0.001 s
% 7.46/3.40  # Total time               : 0.011 s
% 7.46/3.40  # ...preprocessing         : 0.009 s
% 7.46/3.40  # ...main loop             : 0.002 s
% 7.46/3.40  # Maximum resident set size: 6656 pages
% 7.46/3.40  
%------------------------------------------------------------------------------