↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV643+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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 : Thu Sep 24 02:35:22 PM UTC 2026

% Result   : Theorem 1.06s 0.81s
% Output   : CNFRefutation 1.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  14 unt;   0 def)
%            Number of atoms       :   81 (   3 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   82 (  34   ~;  32   |;   5   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   45 (   0 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('$_type_193',axiom,
    ! [X1,X2415] :
      ( c_24__type__193___24t(X1,X2415)
    <=> ! [X2] :
          ( t(X2,X1)
         => cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X2415,X2)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_type_193') ).

fof('$_type_64607',axiom,
    ! [X2727] :
      ( c_24__type__64607___24t(X2727)
    <=> ! [X1] :
          ( cT___24t(X1)
         => cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X2727,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_type_64607') ).

fof('$tdef_T',axiom,
    ! [X2957] :
      ( cT___24t(X2957)
    <=> t(X2957,cT) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$tdef_T') ).

fof('_HAMMER_GOAL',conjecture,
    p(cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cCoq_2eLists_2eList_2efilter___24a3(cT,cp,cl)),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).

fof('list_utils.length_filter',axiom,
    ! [X1150] :
      ( cType___24t(X1150)
     => ! [X351] :
          ( c_24__type__193___24t(X1150,X351)
         => ! [X162] :
              ( cCoq_2eInit_2eDatatypes_2elist___24t(X1150,X162)
             => cCoq_2eInit_2eDatatypes_2elength___24a2(X1150,cCoq_2eLists_2eList_2efilter___24a3(X1150,X351,X162)) = clist__utils_2ecount___24a3(X1150,X351,X162) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','list_utils.length_filter') ).

fof('$_typeof_p',axiom,
    c_24__type__64607___24t(cp),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_p') ).

fof('$_typeof_l',axiom,
    cCoq_2eInit_2eDatatypes_2elist___24t(cT,cl),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_l') ).

fof('$_typeof_T',axiom,
    cType___24t(cT),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_T') ).

fof('list_utils.count_le',axiom,
    ! [X1150] :
      ( cType___24t(X1150)
     => ! [X351] :
          ( c_24__type__193___24t(X1150,X351)
         => ! [X162] :
              ( cCoq_2eInit_2eDatatypes_2elist___24t(X1150,X162)
             => p(cCoq_2eInit_2ePeano_2ele___24a2(clist__utils_2ecount___24a3(X1150,X351,X162),cCoq_2eInit_2eDatatypes_2elength___24a2(X1150,X162))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','list_utils.count_le') ).

fof(c_0_9,plain,
    ! [X3066,X3067,X3068,X3069,X3070] :
      ( ( c_24__type__193___24t(X3069,X3070)
        | ~ cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X3070,esk9_2(X3069,X3070))) )
      & ( c_24__type__193___24t(X3069,X3070)
        | t(esk9_2(X3069,X3070),X3069) )
      & ( cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X3067,X3068))
        | ~ t(X3068,X3066)
        | ~ c_24__type__193___24t(X3066,X3067) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['$_type_193'])])])])])])]) ).

fof(c_0_10,plain,
    ! [X3124,X3125,X3126] :
      ( ( c_24__type__64607___24t(X3126)
        | ~ cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X3126,esk15_1(X3126))) )
      & ( c_24__type__64607___24t(X3126)
        | cT___24t(esk15_1(X3126)) )
      & ( cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X3124,X3125))
        | ~ cT___24t(X3125)
        | ~ c_24__type__64607___24t(X3124) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['$_type_64607'])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X1,esk9_2(X2,X1)))
    | c_24__type__193___24t(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    ( ~ cT___24t(X2)
    | ~ c_24__type__64607___24t(X1)
    | cCoq_2eInit_2eDatatypes_2ebool___24t(happ(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X3270] :
      ( ( cT___24t(X3270)
        | ~ t(X3270,cT) )
      & ( t(X3270,cT)
        | ~ cT___24t(X3270) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['$tdef_T'])])]) ).

fof(c_0_14,negated_conjecture,
    ~ p(cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cCoq_2eLists_2eList_2efilter___24a3(cT,cp,cl)),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    inference(assume_negation,[status(cth)],['_HAMMER_GOAL']) ).

cnf(c_0_15,plain,
    ( ~ c_24__type__64607___24t(X2)
    | ~ cT___24t(esk9_2(X1,X2))
    | c_24__type__193___24t(X1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ t(X1,cT)
    | cT___24t(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,negated_conjecture,
    ~ p(cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cCoq_2eLists_2eList_2efilter___24a3(cT,cp,cl)),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( ~ t(esk9_2(X1,X2),cT)
    | ~ c_24__type__64607___24t(X2)
    | c_24__type__193___24t(X1,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( c_24__type__193___24t(X1,X2)
    | t(esk9_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_20,negated_conjecture,
    ~ p(cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cCoq_2eLists_2eList_2efilter___24a3(cT,cp,cl)),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    inference(fof_nnf,[status(thm)],[c_0_17]) ).

fof(c_0_21,plain,
    ! [X3023,X3024,X3025] :
      ( cCoq_2eInit_2eDatatypes_2elength___24a2(X3023,cCoq_2eLists_2eList_2efilter___24a3(X3023,X3024,X3025)) = clist__utils_2ecount___24a3(X3023,X3024,X3025)
      | ~ cCoq_2eInit_2eDatatypes_2elist___24t(X3023,X3025)
      | ~ c_24__type__193___24t(X3023,X3024)
      | ~ cType___24t(X3023) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['list_utils.length_filter'])])])]) ).

cnf(c_0_22,plain,
    ( ~ c_24__type__64607___24t(X1)
    | c_24__type__193___24t(cT,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    c_24__type__64607___24t(cp),
    inference(split_conjunct,[status(thm)],['$_typeof_p']) ).

cnf(c_0_24,negated_conjecture,
    ~ p(cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cCoq_2eLists_2eList_2efilter___24a3(cT,cp,cl)),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_25,plain,
    ( ~ cCoq_2eInit_2eDatatypes_2elist___24t(X1,X3)
    | ~ c_24__type__193___24t(X1,X2)
    | ~ cType___24t(X1)
    | cCoq_2eInit_2eDatatypes_2elength___24a2(X1,cCoq_2eLists_2eList_2efilter___24a3(X1,X2,X3)) = clist__utils_2ecount___24a3(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_26,plain,
    c_24__type__193___24t(cT,cp),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    cCoq_2eInit_2eDatatypes_2elist___24t(cT,cl),
    inference(split_conjunct,[status(thm)],['$_typeof_l']) ).

cnf(c_0_28,plain,
    cType___24t(cT),
    inference(split_conjunct,[status(thm)],['$_typeof_T']) ).

fof(c_0_29,plain,
    ! [X3117,X3118,X3119] :
      ( p(cCoq_2eInit_2ePeano_2ele___24a2(clist__utils_2ecount___24a3(X3117,X3118,X3119),cCoq_2eInit_2eDatatypes_2elength___24a2(X3117,X3119)))
      | ~ cCoq_2eInit_2eDatatypes_2elist___24t(X3117,X3119)
      | ~ c_24__type__193___24t(X3117,X3118)
      | ~ cType___24t(X3117) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['list_utils.count_le'])])])]) ).

cnf(c_0_30,negated_conjecture,
    ~ p(cCoq_2eInit_2ePeano_2ele___24a2(clist__utils_2ecount___24a3(cT,cp,cl),cCoq_2eInit_2eDatatypes_2elength___24a2(cT,cl))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).

cnf(c_0_31,plain,
    ( ~ cCoq_2eInit_2eDatatypes_2elist___24t(X1,X3)
    | ~ c_24__type__193___24t(X1,X2)
    | ~ cType___24t(X1)
    | p(cCoq_2eInit_2ePeano_2ele___24a2(clist__utils_2ecount___24a3(X1,X2,X3),cCoq_2eInit_2eDatatypes_2elength___24a2(X1,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_27]),c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV643+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 07:32:07 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.06/0.81  % Version: 3.5.1
% 1.06/0.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.06/0.81  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.81  % Starting new_bool_3 with 900s (3) cores
% 1.06/0.81  % Starting new_bool_1 with 900s (3) cores
% 1.06/0.81  % Starting sh5l with 300s (1) cores
% 1.06/0.81  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.06/0.81  % new_bool_3 with pid 2042703 completed with status 0
% 1.06/0.81  % Result found by new_bool_3
% 1.06/0.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.06/0.81  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.81  % Starting new_bool_3 with 900s (3) cores
% 1.06/0.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.06/0.81  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.06/0.81  % Search class: FGHSF-FSLM32-MFFFFFNN
% 1.06/0.81  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 1.06/0.81  % Starting SubtermCWHack with 82s (1) cores
% 1.06/0.81  % Starting new_bool_3 with 91s (1) cores
% 1.06/0.81  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 82s (1) cores
% 1.06/0.81  % SubtermCWHack with pid 2042711 completed with status 0
% 1.06/0.81  % Result found by SubtermCWHack
% 1.06/0.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.06/0.81  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.81  % Starting new_bool_3 with 900s (3) cores
% 1.06/0.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.06/0.81  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.06/0.81  % Search class: FGHSF-FSLM32-MFFFFFNN
% 1.06/0.81  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 1.06/0.81  % Starting SubtermCWHack with 82s (1) cores
% 1.06/0.81  % Preprocessing time       : 0.007 s
% 1.06/0.81  
% 1.06/0.81  % Proof found!
% 1.06/0.81  % SZS status Theorem
% 1.06/0.81  % SZS output start CNFRefutation
% See solution above
% 1.06/0.81  % Parsed axioms                        : 2961
% 1.06/0.81  % Removed by relevancy pruning/SinE    : 2824
% 1.06/0.81  % Initial clauses                      : 220
% 1.06/0.81  % Removed in clause preprocessing      : 11
% 1.06/0.81  % Initial clauses in saturation        : 209
% 1.06/0.81  % Processed clauses                    : 913
% 1.06/0.81  % ...of these trivial                  : 1
% 1.06/0.81  % ...subsumed                          : 659
% 1.06/0.81  % ...remaining for further processing  : 253
% 1.06/0.81  % Other redundant clauses eliminated   : 63
% 1.06/0.81  % Clauses deleted for lack of memory   : 0
% 1.06/0.81  % Backward-subsumed                    : 4
% 1.06/0.81  % Backward-rewritten                   : 1
% 1.06/0.81  % Generated clauses                    : 3207
% 1.06/0.81  % ...of the previous two non-redundant : 3008
% 1.06/0.81  % ...aggressively subsumed             : 0
% 1.06/0.81  % Contextual simplify-reflections      : 11
% 1.06/0.81  % Paramodulations                      : 3136
% 1.06/0.81  % Factorizations                       : 0
% 1.06/0.81  % NegExts                              : 0
% 1.06/0.81  % Equation resolutions                 : 71
% 1.06/0.81  % Disequality decompositions           : 0
% 1.06/0.81  % Total rewrite steps                  : 946
% 1.06/0.81  % ...of those cached                   : 923
% 1.06/0.81  % Propositional unsat checks           : 0
% 1.06/0.81  %    Propositional check models        : 0
% 1.06/0.81  %    Propositional check unsatisfiable : 0
% 1.06/0.81  %    Propositional clauses             : 0
% 1.06/0.81  %    Propositional clauses after purity: 0
% 1.06/0.81  %    Propositional unsat core size     : 0
% 1.06/0.81  %    Propositional preprocessing time  : 0.000
% 1.06/0.81  %    Propositional encoding time       : 0.000
% 1.06/0.81  %    Propositional solver time         : 0.000
% 1.06/0.81  %    Success case prop preproc time    : 0.000
% 1.06/0.81  %    Success case prop encoding time   : 0.000
% 1.06/0.81  %    Success case prop solver time     : 0.000
% 1.06/0.81  % Current number of processed clauses  : 243
% 1.06/0.81  %    Positive orientable unit clauses  : 12
% 1.06/0.81  %    Positive unorientable unit clauses: 0
% 1.06/0.81  %    Negative unit clauses             : 5
% 1.06/0.81  %    Non-unit-clauses                  : 226
% 1.06/0.81  % Current number of unprocessed clauses: 2293
% 1.06/0.81  % ...number of literals in the above   : 10627
% 1.06/0.81  % Current number of archived formulas  : 0
% 1.06/0.81  % Current number of archived clauses   : 5
% 1.06/0.81  % Clause-clause subsumption calls (NU) : 14291
% 1.06/0.81  % Rec. Clause-clause subsumption calls : 9558
% 1.06/0.81  % Non-unit clause-clause subsumptions  : 661
% 1.06/0.81  % Unit Clause-clause subsumption calls : 21
% 1.06/0.81  % Rewrite failures with RHS unbound    : 0
% 1.06/0.81  % BW rewrite match attempts            : 3
% 1.06/0.81  % BW rewrite match successes           : 2
% 1.06/0.81  % Condensation attempts                : 0
% 1.06/0.81  % Condensation successes               : 0
% 1.06/0.81  % Termbank termtop insertions          : 122717
% 1.06/0.81  % Search garbage collected termcells   : 48285
% 1.06/0.81  
% 1.06/0.81  % -------------------------------------------------
% 1.06/0.81  % User time                : 0.073 s
% 1.06/0.81  % System time              : 0.038 s
% 1.06/0.81  % Total time               : 0.111 s
% 1.06/0.81  % Maximum resident set size: 16332 pages
% 1.06/0.81  
% 1.06/0.81  % -------------------------------------------------
% 1.06/0.81  % User time                : 0.372 s
% 1.06/0.81  % System time              : 0.095 s
% 1.06/0.81  % Total time               : 0.466 s
% 1.06/0.81  % Maximum resident set size: 12800 pages
% 1.06/0.81  % E exiting
%------------------------------------------------------------------------------