↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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:52 AM UTC 2026

% Result   : Theorem 10.79s 2.84s
% Output   : CNFRefutation 10.79s
% 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    :    3 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    6 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
    ( or_2
    | ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx340ikw/input.p',i_0_48) ).

cnf(i_0_22,negated_conjecture,
    ~ or_2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx340ikw/input.p',i_0_22) ).

cnf(i_0_64,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ r2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx340ikw/input.p',i_0_64) ).

cnf(i_0_57,plain,
    r2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx340ikw/input.p',i_0_57) ).

cnf(c_0_69,plain,
    ( or_2
    | ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))) ),
    i_0_48 ).

cnf(c_0_70,negated_conjecture,
    ~ or_2,
    i_0_22 ).

cnf(c_0_71,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ r2 ),
    i_0_64 ).

cnf(c_0_72,plain,
    r2,
    i_0_57 ).

cnf(c_0_73,plain,
    ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))),
    inference(sr,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_74,plain,
    is_a_theorem(implies(X1,or(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).

cnf(c_0_75,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]),
    [proof] ).

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