↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n028.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  : 300s
% DateTime : Tue May  5 06:51:36 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5518,plain,
    ( cCoq_2eInit_2eDatatypes_2enat___24t(happ(X1,X2))
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X2)
    | ~ c_24__type__6___24t(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_5518) ).

cnf(i_0_6435,plain,
    c_24__type__6___24t(cCoq_2eInit_2eDatatypes_2eS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_6435) ).

cnf(i_0_3864,plain,
    ( cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eNat_2epred,happ(cCoq_2eInit_2eNat_2epred,X1)))
    | ~ cIndProp_2eeven___24a1(X1)
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_3864) ).

cnf(i_0_1414,plain,
    ( happ(cCoq_2eInit_2eNat_2epred,happ(cCoq_2eInit_2eDatatypes_2eS,X1)) = X1
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_1414) ).

cnf(i_0_3851,negated_conjecture,
    cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eDatatypes_2eS,happ(cCoq_2eInit_2eDatatypes_2eS,esk437_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_3851) ).

cnf(i_0_3852,negated_conjecture,
    cCoq_2eInit_2eDatatypes_2enat___24t(esk437_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_3852) ).

cnf(i_0_3850,negated_conjecture,
    ~ cIndProp_2eeven___24a1(esk437_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dsyjfxz1/input.p',i_0_3850) ).

cnf(c_0_6443,plain,
    ( cCoq_2eInit_2eDatatypes_2enat___24t(happ(X1,X2))
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X2)
    | ~ c_24__type__6___24t(X1) ),
    i_0_5518 ).

cnf(c_0_6444,plain,
    c_24__type__6___24t(cCoq_2eInit_2eDatatypes_2eS),
    i_0_6435 ).

cnf(c_0_6445,plain,
    ( cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eNat_2epred,happ(cCoq_2eInit_2eNat_2epred,X1)))
    | ~ cIndProp_2eeven___24a1(X1)
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1) ),
    i_0_3864 ).

cnf(c_0_6446,plain,
    ( happ(cCoq_2eInit_2eNat_2epred,happ(cCoq_2eInit_2eDatatypes_2eS,X1)) = X1
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1) ),
    i_0_1414 ).

cnf(c_0_6447,plain,
    ( cCoq_2eInit_2eDatatypes_2enat___24t(happ(cCoq_2eInit_2eDatatypes_2eS,X1))
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1) ),
    inference(spm,[status(thm)],[c_0_6443,c_0_6444]) ).

cnf(c_0_6448,plain,
    ( cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eNat_2epred,X1))
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1)
    | ~ cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eDatatypes_2eS,X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6445,c_0_6446]),c_0_6447]) ).

cnf(c_0_6449,plain,
    ( cIndProp_2eeven___24a1(X1)
    | ~ cCoq_2eInit_2eDatatypes_2enat___24t(X1)
    | ~ cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eDatatypes_2eS,happ(cCoq_2eInit_2eDatatypes_2eS,X1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6448,c_0_6446]),c_0_6447]) ).

cnf(c_0_6450,negated_conjecture,
    cIndProp_2eeven___24a1(happ(cCoq_2eInit_2eDatatypes_2eS,happ(cCoq_2eInit_2eDatatypes_2eS,esk437_0))),
    i_0_3851 ).

cnf(c_0_6451,negated_conjecture,
    cCoq_2eInit_2eDatatypes_2enat___24t(esk437_0),
    i_0_3852 ).

cnf(c_0_6452,negated_conjecture,
    ~ cIndProp_2eeven___24a1(esk437_0),
    i_0_3850 ).

cnf(c_0_6453,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6449,c_0_6450]),c_0_6451])]),c_0_6452]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEV636+1 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.15/0.33  % Computer : n028.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % WCLimit  : 300
% 0.15/0.33  % DateTime : Tue May  5 06:44:32 EDT 2026
% 0.15/0.33  % CPUTime  : 
% 0.28/0.47  # ENIGMATIC: Selected SinE mode:
% 0.45/0.66  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.66  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.45/0.66  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.45/0.66  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 237.95/35.23  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 237.95/35.23  # Version: 2.1pre011
% 237.95/35.23  # Preprocessing time       : 0.337 s
% 237.95/35.23  
% 237.95/35.23  # Proof found!
% 237.95/35.23  # SZS status Theorem
% 237.95/35.23  # SZS output start CNFRefutation
% See solution above
% 237.95/35.23  # Proof object total steps             : 18
% 237.95/35.23  # Proof object clause steps            : 11
% 237.95/35.23  # Proof object formula steps           : 7
% 237.95/35.23  # Proof object conjectures             : 7
% 237.95/35.23  # Proof object clause conjectures      : 4
% 237.95/35.23  # Proof object formula conjectures     : 3
% 237.95/35.23  # Proof object initial clauses used    : 7
% 237.95/35.23  # Proof object initial formulas used   : 7
% 237.95/35.23  # Proof object generating inferences   : 4
% 237.95/35.23  # Proof object simplifying inferences  : 5
% 237.95/35.23  # Training examples: 0 positive, 0 negative
% 237.95/35.23  # Parsed axioms                        : 7029
% 237.95/35.23  # Removed by relevancy pruning/SinE    : 0
% 237.95/35.23  # Initial clauses                      : 7029
% 237.95/35.23  # Removed in clause preprocessing      : 0
% 237.95/35.23  # Initial clauses in saturation        : 7029
% 237.95/35.23  # Processed clauses                    : 10958
% 237.95/35.23  # ...of these trivial                  : 67
% 237.95/35.23  # ...subsumed                          : 1646
% 237.95/35.23  # ...remaining for further processing  : 9245
% 237.95/35.23  # Other redundant clauses eliminated   : 1460
% 237.95/35.23  # Clauses deleted for lack of memory   : 0
% 237.95/35.23  # Backward-subsumed                    : 100
% 237.95/35.23  # Backward-rewritten                   : 44
% 237.95/35.23  # Generated clauses                    : 444627
% 237.95/35.23  # ...of the previous two non-trivial   : 438456
% 237.95/35.23  # Contextual simplify-reflections      : 3462
% 237.95/35.23  # Paramodulations                      : 442901
% 237.95/35.23  # Factorizations                       : 58
% 237.95/35.23  # Equation resolutions                 : 1668
% 237.95/35.23  # Propositional unsat checks           : 1
% 237.95/35.23  # Propositional unsat check successes  : 0
% 237.95/35.23  # Current number of processed clauses  : 9093
% 237.95/35.23  #    Positive orientable unit clauses  : 681
% 237.95/35.23  #    Positive unorientable unit clauses: 15
% 237.95/35.23  #    Negative unit clauses             : 156
% 237.95/35.23  #    Non-unit-clauses                  : 8241
% 237.95/35.23  # Current number of unprocessed clauses: 425083
% 237.95/35.23  # ...number of literals in the above   : 3042412
% 237.95/35.23  # Current number of archived formulas  : 0
% 237.95/35.23  # Current number of archived clauses   : 144
% 237.95/35.23  # Clause-clause subsumption calls (NU) : 20320820
% 237.95/35.23  # Rec. Clause-clause subsumption calls : 3119369
% 237.95/35.23  # Non-unit clause-clause subsumptions  : 5007
% 237.95/35.23  # Unit Clause-clause subsumption calls : 291307
% 237.95/35.23  # Rewrite failures with RHS unbound    : 6220
% 237.95/35.23  # BW rewrite match attempts            : 24016
% 237.95/35.23  # BW rewrite match successes           : 273
% 237.95/35.23  # Condensation attempts                : 0
% 237.95/35.23  # Condensation successes               : 0
% 237.95/35.23  # Termbank termtop insertions          : 36887607
% 237.95/35.23  
% 237.95/35.23  # -------------------------------------------------
% 237.95/35.23  # User time                : 27.493 s
% 237.95/35.23  # System time              : 0.482 s
% 237.95/35.23  # Total time               : 27.976 s
% 237.95/35.23  # ...preprocessing         : 0.337 s
% 237.95/35.23  # ...main loop             : 27.638 s
% 237.95/35.23  # Maximum resident set size: 669988 pages
% 237.95/35.23  
%------------------------------------------------------------------------------