↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV646+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 : n011.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 0.15s 10.62s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (  14 unt;   0 def)
%            Number of atoms       :   49 (   3 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   41 (  15   ~;  11   |;   4   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   27 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('_HAMMER_GOAL',conjecture,
    ! [X49] :
      ( cIntMap_2eFset_2eFSet___24t(X49)
     => ! [X50] :
          ( cIntMap_2eFset_2eFSet___24t(X50)
         => ! [X2820] :
              ( cIntMap_2eFset_2eFSet___24t(X2820)
             => cMapaxioms_2eeqmap___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eFset_2eFSetUnion___24a2(cIntMap_2eFset_2eFSetUnion___24a2(X49,X50),X2820),cIntMap_2eFset_2eFSetUnion___24a2(X49,cIntMap_2eFset_2eFSetUnion___24a2(X50,X2820))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).

fof('$_def_IntMap.Fset.FSetUnion',axiom,
    ! [X49,X50] : cIntMap_2eFset_2eFSetUnion___24a2(X49,X50) = cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,X49,X50),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_IntMap.Fset.FSetUnion') ).

fof('$_def_IntMap.Fset.FSet',axiom,
    ! [X465] :
      ( cIntMap_2eFset_2eFSet___24t(X465)
    <=> cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,X465) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_IntMap.Fset.FSet') ).

fof('Mapaxioms.MapMerge_assoc',axiom,
    ! [X39] :
      ( cType___24t(X39)
     => ! [X64] :
          ( cIntMap_2eMap_2eMap___24t(X39,X64)
         => ! [X65] :
              ( cIntMap_2eMap_2eMap___24t(X39,X65)
             => ! [X2835] :
                  ( cIntMap_2eMap_2eMap___24t(X39,X2835)
                 => cMapaxioms_2eeqmap___24a3(X39,cIntMap_2eMap_2eMapMerge___24a3(X39,cIntMap_2eMap_2eMapMerge___24a3(X39,X64,X65),X2835),cIntMap_2eMap_2eMapMerge___24a3(X39,X64,cIntMap_2eMap_2eMapMerge___24a3(X39,X65,X2835))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','Mapaxioms.MapMerge_assoc') ).

fof('$_typeof_Coq.Init.Datatypes.unit',axiom,
    cType___24t(cCoq_2eInit_2eDatatypes_2eunit),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_Coq.Init.Datatypes.unit') ).

fof(c_0_5,negated_conjecture,
    ~ ! [X49] :
        ( cIntMap_2eFset_2eFSet___24t(X49)
       => ! [X50] :
            ( cIntMap_2eFset_2eFSet___24t(X50)
           => ! [X2820] :
                ( cIntMap_2eFset_2eFSet___24t(X2820)
               => cMapaxioms_2eeqmap___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eFset_2eFSetUnion___24a2(cIntMap_2eFset_2eFSetUnion___24a2(X49,X50),X2820),cIntMap_2eFset_2eFSetUnion___24a2(X49,cIntMap_2eFset_2eFSetUnion___24a2(X50,X2820))) ) ) ),
    inference(assume_negation,[status(cth)],['_HAMMER_GOAL']) ).

fof(c_0_6,negated_conjecture,
    ( ~ cMapaxioms_2eeqmap___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eFset_2eFSetUnion___24a2(cIntMap_2eFset_2eFSetUnion___24a2(esk1_0,esk2_0),esk3_0),cIntMap_2eFset_2eFSetUnion___24a2(esk1_0,cIntMap_2eFset_2eFSetUnion___24a2(esk2_0,esk3_0)))
    & cIntMap_2eFset_2eFSet___24t(esk3_0)
    & cIntMap_2eFset_2eFSet___24t(esk2_0)
    & cIntMap_2eFset_2eFSet___24t(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_7,plain,
    ! [X2874,X2875] : cIntMap_2eFset_2eFSetUnion___24a2(X2874,X2875) = cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,X2874,X2875),
    inference(variable_rename,[status(thm)],['$_def_IntMap.Fset.FSetUnion']) ).

fof(c_0_8,plain,
    ! [X2881] :
      ( ( cIntMap_2eFset_2eFSet___24t(X2881)
        | ~ cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,X2881) )
      & ( cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,X2881)
        | ~ cIntMap_2eFset_2eFSet___24t(X2881) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['$_def_IntMap.Fset.FSet'])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ cMapaxioms_2eeqmap___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eFset_2eFSetUnion___24a2(cIntMap_2eFset_2eFSetUnion___24a2(esk1_0,esk2_0),esk3_0),cIntMap_2eFset_2eFSetUnion___24a2(esk1_0,cIntMap_2eFset_2eFSetUnion___24a2(esk2_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    cIntMap_2eFset_2eFSetUnion___24a2(X1,X2) = cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X2913,X2914,X2915,X2916] :
      ( cMapaxioms_2eeqmap___24a3(X2913,cIntMap_2eMap_2eMapMerge___24a3(X2913,cIntMap_2eMap_2eMapMerge___24a3(X2913,X2914,X2915),X2916),cIntMap_2eMap_2eMapMerge___24a3(X2913,X2914,cIntMap_2eMap_2eMapMerge___24a3(X2913,X2915,X2916)))
      | ~ cIntMap_2eMap_2eMap___24t(X2913,X2916)
      | ~ cIntMap_2eMap_2eMap___24t(X2913,X2915)
      | ~ cIntMap_2eMap_2eMap___24t(X2913,X2914)
      | ~ cType___24t(X2913) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Mapaxioms.MapMerge_assoc'])])])]) ).

cnf(c_0_12,plain,
    ( ~ cIntMap_2eFset_2eFSet___24t(X1)
    | cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    cIntMap_2eFset_2eFSet___24t(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    cIntMap_2eFset_2eFSet___24t(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    cIntMap_2eFset_2eFSet___24t(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ~ cMapaxioms_2eeqmap___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,esk1_0,esk2_0),esk3_0),cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,esk1_0,cIntMap_2eMap_2eMapMerge___24a3(cCoq_2eInit_2eDatatypes_2eunit,esk2_0,esk3_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).

cnf(c_0_17,plain,
    ( ~ cIntMap_2eMap_2eMap___24t(X1,X4)
    | ~ cIntMap_2eMap_2eMap___24t(X1,X3)
    | ~ cIntMap_2eMap_2eMap___24t(X1,X2)
    | ~ cType___24t(X1)
    | cMapaxioms_2eeqmap___24a3(X1,cIntMap_2eMap_2eMapMerge___24a3(X1,cIntMap_2eMap_2eMapMerge___24a3(X1,X2,X3),X4),cIntMap_2eMap_2eMapMerge___24a3(X1,X2,cIntMap_2eMap_2eMapMerge___24a3(X1,X3,X4))) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,esk3_0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,esk2_0),
    inference(spm,[status(thm)],[c_0_12,c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    cIntMap_2eMap_2eMap___24t(cCoq_2eInit_2eDatatypes_2eunit,esk1_0),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_21,plain,
    cType___24t(cCoq_2eInit_2eDatatypes_2eunit),
    inference(split_conjunct,[status(thm)],['$_typeof_Coq.Init.Datatypes.unit']) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV646+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.38  % Computer : n011.cluster.edu
% 0.11/10.38  % Model    : x86_64 x86_64
% 0.11/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38  % Memory   : 8046.5625MB
% 0.11/10.38  % OS       : Linux 6.8.0-71-generic
% 0.11/10.38  % CPULimit : 300
% 0.11/10.38  % WCLimit  : 300
% 0.11/10.38  % DateTime : Mon Sep 21 07:34:20 UTC 2026
% 0.11/10.38  % CPUTime  : 
% 0.11/10.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.43  Running first-order theorem proving
% 0.15/10.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
% 0.15/10.62  % Version: 3.5.1
% 0.15/10.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.15/10.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62  % Starting new_bool_3 with 900s (3) cores
% 0.15/10.62  % Starting new_bool_1 with 900s (3) cores
% 0.15/10.62  % Starting sh5l with 300s (1) cores
% 0.15/10.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.15/10.62  % new_bool_1 with pid 1355768 completed with status 0
% 0.15/10.62  % Result found by new_bool_1
% 0.15/10.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.15/10.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62  % Starting new_bool_3 with 900s (3) cores
% 0.15/10.62  % Starting new_bool_1 with 900s (3) cores
% 0.15/10.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.62  % Search class: FGUSF-FSLM32-MFFFFFNN
% 0.15/10.62  % partial match(1): FGHSF-FSLM32-MFFFFFNN
% 0.15/10.62  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.15/10.62  % Starting SubtermCWHack with 82s (1) cores
% 0.15/10.62  % Starting new_bool_1 with 91s (1) cores
% 0.15/10.62  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 82s (1) cores
% 0.15/10.62  % SubtermCWHack with pid 1355771 completed with status 0
% 0.15/10.62  % Result found by SubtermCWHack
% 0.15/10.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.15/10.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62  % Starting new_bool_3 with 900s (3) cores
% 0.15/10.62  % Starting new_bool_1 with 900s (3) cores
% 0.15/10.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.62  % Search class: FGUSF-FSLM32-MFFFFFNN
% 0.15/10.62  % partial match(1): FGHSF-FSLM32-MFFFFFNN
% 0.15/10.62  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.15/10.62  % Starting SubtermCWHack with 82s (1) cores
% 0.15/10.62  % Preprocessing time       : 0.005 s
% 0.15/10.62  
% 0.15/10.62  % Proof found!
% 0.15/10.62  % SZS status Theorem
% 0.15/10.62  % SZS output start CNFRefutation
% See solution above
% 0.15/10.62  % Parsed axioms                        : 3068
% 0.15/10.62  % Removed by relevancy pruning/SinE    : 2987
% 0.15/10.62  % Initial clauses                      : 127
% 0.15/10.62  % Removed in clause preprocessing      : 4
% 0.15/10.62  % Initial clauses in saturation        : 123
% 0.15/10.62  % Processed clauses                    : 462
% 0.15/10.62  % ...of these trivial                  : 2
% 0.15/10.62  % ...subsumed                          : 228
% 0.15/10.62  % ...remaining for further processing  : 232
% 0.15/10.62  % Other redundant clauses eliminated   : 4
% 0.15/10.62  % Clauses deleted for lack of memory   : 0
% 0.15/10.62  % Backward-subsumed                    : 0
% 0.15/10.62  % Backward-rewritten                   : 0
% 0.15/10.62  % Generated clauses                    : 662
% 0.15/10.62  % ...of the previous two non-redundant : 591
% 0.15/10.62  % ...aggressively subsumed             : 0
% 0.15/10.62  % Contextual simplify-reflections      : 18
% 0.15/10.62  % Paramodulations                      : 648
% 0.15/10.62  % Factorizations                       : 7
% 0.15/10.62  % NegExts                              : 0
% 0.15/10.62  % Equation resolutions                 : 7
% 0.15/10.62  % Disequality decompositions           : 0
% 0.15/10.62  % Total rewrite steps                  : 588
% 0.15/10.62  % ...of those cached                   : 563
% 0.15/10.62  % Propositional unsat checks           : 0
% 0.15/10.62  %    Propositional check models        : 0
% 0.15/10.62  %    Propositional check unsatisfiable : 0
% 0.15/10.62  %    Propositional clauses             : 0
% 0.15/10.62  %    Propositional clauses after purity: 0
% 0.15/10.62  %    Propositional unsat core size     : 0
% 0.15/10.62  %    Propositional preprocessing time  : 0.000
% 0.15/10.62  %    Propositional encoding time       : 0.000
% 0.15/10.62  %    Propositional solver time         : 0.000
% 0.15/10.62  %    Success case prop preproc time    : 0.000
% 0.15/10.62  %    Success case prop encoding time   : 0.000
% 0.15/10.62  %    Success case prop solver time     : 0.000
% 0.15/10.62  % Current number of processed clauses  : 232
% 0.15/10.62  %    Positive orientable unit clauses  : 24
% 0.15/10.62  %    Positive unorientable unit clauses: 0
% 0.15/10.62  %    Negative unit clauses             : 3
% 0.15/10.62  %    Non-unit-clauses                  : 205
% 0.15/10.62  % Current number of unprocessed clauses: 251
% 0.15/10.62  % ...number of literals in the above   : 1536
% 0.15/10.62  % Current number of archived formulas  : 0
% 0.15/10.62  % Current number of archived clauses   : 0
% 0.15/10.62  % Clause-clause subsumption calls (NU) : 6437
% 0.15/10.62  % Rec. Clause-clause subsumption calls : 2144
% 0.15/10.62  % Non-unit clause-clause subsumptions  : 157
% 0.15/10.62  % Unit Clause-clause subsumption calls : 31
% 0.15/10.62  % Rewrite failures with RHS unbound    : 0
% 0.15/10.62  % BW rewrite match attempts            : 3
% 0.15/10.62  % BW rewrite match successes           : 0
% 0.15/10.62  % Condensation attempts                : 0
% 0.15/10.62  % Condensation successes               : 0
% 0.15/10.62  % Termbank termtop insertions          : 74346
% 0.15/10.62  % Search garbage collected termcells   : 38376
% 0.15/10.62  
% 0.15/10.62  % -------------------------------------------------
% 0.15/10.62  % User time                : 0.046 s
% 0.15/10.62  % System time              : 0.032 s
% 0.15/10.62  % Total time               : 0.079 s
% 0.15/10.62  % Maximum resident set size: 16180 pages
% 0.15/10.62  
% 0.15/10.62  % -------------------------------------------------
% 0.15/10.62  % User time                : 0.140 s
% 0.15/10.62  % System time              : 0.069 s
% 0.15/10.62  % Total time               : 0.209 s
% 0.15/10.62  % Maximum resident set size: 11776 pages
% 0.15/10.62  % E exiting
%------------------------------------------------------------------------------