↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n004.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 01:04:46 PM UTC 2026

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   33 (  12 unt;   0 def)
%            Number of atoms       :  110 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  122 (  45   ~;  36   |;  25   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   50 (   1 sgn  31   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t24_filter_2,conjecture,
    ! [X1] :
      ( ( l3_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m2_filter_2(X2,X1)
         => ? [X3] :
              ( r2_hidden(X3,X2)
              & m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_filter_2) ).

fof(dt_m2_filter_2,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m2_filter_2(X2,X1)
         => ( m2_lattice4(X2,X1)
            & ~ v1_xboole_0(X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_filter_2) ).

fof(dt_m2_lattice4,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m2_lattice4(X2,X1)
         => m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_lattice4) ).

fof(t4_subset,axiom,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(X3))
        & r2_hidden(X1,X2) )
     => m1_subset_1(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).

fof(t2_subset,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X1,X2)
     => ( r2_hidden(X1,X2)
        | v1_xboole_0(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).

fof(existence_m1_subset_1,axiom,
    ! [X1] :
    ? [X2] : m1_subset_1(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ( l3_lattices(X1)
          & v10_lattices(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m2_filter_2(X2,X1)
           => ? [X3] :
                ( r2_hidden(X3,X2)
                & m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
    inference(assume_negation,[status(cth)],[t24_filter_2]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m2_filter_2(X2,X1)
         => ( m2_lattice4(X2,X1)
            & ~ v1_xboole_0(X2) ) ) ),
    inference(fof_simplification,[status(thm)],[dt_m2_filter_2]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1] :
        ( ( l3_lattices(X1)
          & v10_lattices(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m2_filter_2(X2,X1)
           => ? [X3] :
                ( r2_hidden(X3,X2)
                & m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m2_lattice4(X2,X1)
         => m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
    inference(fof_simplification,[status(thm)],[dt_m2_lattice4]) ).

fof(c_0_10,plain,
    ! [X18,X19] :
      ( ( ~ l3_lattices(X18)
        | ~ v10_lattices(X18)
        | v3_struct_0(X18)
        | ~ m2_filter_2(X19,X18)
        | m2_lattice4(X19,X18) )
      & ( ~ l3_lattices(X18)
        | ~ v10_lattices(X18)
        | v3_struct_0(X18)
        | ~ m2_filter_2(X19,X18)
        | ~ v1_xboole_0(X19) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).

fof(c_0_11,negated_conjecture,
    ! [X6] :
      ( ( ~ r2_hidden(X6,esk2_0)
        | ~ m1_subset_1(X6,u1_struct_0(esk1_0)) )
      & m2_filter_2(esk2_0,esk1_0)
      & l3_lattices(esk1_0)
      & v10_lattices(esk1_0)
      & ~ v3_struct_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).

fof(c_0_12,plain,
    ! [X20,X21] :
      ( m1_subset_1(X21,k1_zfmisc_1(u1_struct_0(X20)))
      | ~ m2_lattice4(X21,X20)
      | ~ l3_lattices(X20)
      | ~ v10_lattices(X20)
      | v3_struct_0(X20) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

cnf(c_0_13,plain,
    ( ~ l3_lattices(X2)
    | ~ v10_lattices(X2)
    | ~ m2_filter_2(X1,X2)
    | v3_struct_0(X2)
    | m2_lattice4(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    m2_filter_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    l3_lattices(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    v10_lattices(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_18,plain,
    ! [X58,X59,X60] :
      ( m1_subset_1(X58,X60)
      | ~ m1_subset_1(X59,k1_zfmisc_1(X60))
      | ~ r2_hidden(X58,X59) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).

cnf(c_0_19,plain,
    ( ~ m2_lattice4(X2,X1)
    | ~ l3_lattices(X1)
    | ~ v10_lattices(X1)
    | m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    m2_lattice4(esk2_0,esk1_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

fof(c_0_21,plain,
    ! [X54,X55] :
      ( r2_hidden(X54,X55)
      | v1_xboole_0(X55)
      | ~ m1_subset_1(X54,X55) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).

fof(c_0_22,plain,
    ! [X29] : m1_subset_1(esk8_1(X29),X29),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).

cnf(c_0_23,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(X3))
    | ~ r2_hidden(X1,X2)
    | m1_subset_1(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]),c_0_16])]),c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ r2_hidden(X1,esk2_0)
    | ~ m1_subset_1(X1,u1_struct_0(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_26,plain,
    ( ~ m1_subset_1(X1,X2)
    | r2_hidden(X1,X2)
    | v1_xboole_0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    m1_subset_1(esk8_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,plain,
    ( ~ l3_lattices(X2)
    | ~ v10_lattices(X2)
    | ~ m2_filter_2(X1,X2)
    | ~ v1_xboole_0(X1)
    | v3_struct_0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_29,negated_conjecture,
    ~ r2_hidden(X1,esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_30,plain,
    ( r2_hidden(esk8_1(X1),X1)
    | v1_xboole_0(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ~ v1_xboole_0(esk2_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT300+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n004.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 20 23:30:05 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48  % Version: 3.5.1
% 0.18/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  % Starting sh5l with 300s (1) cores
% 0.18/0.48  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1726427 completed with status 0
% 0.18/0.48  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.48  % No SInE strategy applied
% 0.18/0.48  % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.48  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.48  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.18/0.48  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1726434 completed with status 0
% 0.18/0.48  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.48  % No SInE strategy applied
% 0.18/0.48  % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48  % Preprocessing time       : 0.002 s
% 0.18/0.48  % Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  % Proof found!
% 0.18/0.48  % SZS status Theorem
% 0.18/0.48  % SZS output start CNFRefutation
% See solution above
% 0.18/0.48  % Parsed axioms                        : 44
% 0.18/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.18/0.48  % Initial clauses                      : 64
% 0.18/0.48  % Removed in clause preprocessing      : 7
% 0.18/0.48  % Initial clauses in saturation        : 57
% 0.18/0.48  % Processed clauses                    : 182
% 0.18/0.48  % ...of these trivial                  : 0
% 0.18/0.48  % ...subsumed                          : 10
% 0.18/0.48  % ...remaining for further processing  : 172
% 0.18/0.48  % Other redundant clauses eliminated   : 0
% 0.18/0.48  % Clauses deleted for lack of memory   : 0
% 0.18/0.48  % Backward-subsumed                    : 4
% 0.18/0.48  % Backward-rewritten                   : 2
% 0.18/0.48  % Generated clauses                    : 132
% 0.18/0.48  % ...of the previous two non-redundant : 113
% 0.18/0.48  % ...aggressively subsumed             : 0
% 0.18/0.48  % Contextual simplify-reflections      : 1
% 0.18/0.48  % Paramodulations                      : 132
% 0.18/0.48  % Factorizations                       : 0
% 0.18/0.48  % NegExts                              : 0
% 0.18/0.48  % Equation resolutions                 : 0
% 0.18/0.48  % Disequality decompositions           : 0
% 0.18/0.48  % Total rewrite steps                  : 47
% 0.18/0.48  % ...of those cached                   : 31
% 0.18/0.48  % Propositional unsat checks           : 0
% 0.18/0.48  %    Propositional check models        : 0
% 0.18/0.48  %    Propositional check unsatisfiable : 0
% 0.18/0.48  %    Propositional clauses             : 0
% 0.18/0.48  %    Propositional clauses after purity: 0
% 0.18/0.48  %    Propositional unsat core size     : 0
% 0.18/0.48  %    Propositional preprocessing time  : 0.000
% 0.18/0.48  %    Propositional encoding time       : 0.000
% 0.18/0.48  %    Propositional solver time         : 0.000
% 0.18/0.48  %    Success case prop preproc time    : 0.000
% 0.18/0.48  %    Success case prop encoding time   : 0.000
% 0.18/0.48  %    Success case prop solver time     : 0.000
% 0.18/0.48  % Current number of processed clauses  : 109
% 0.18/0.48  %    Positive orientable unit clauses  : 38
% 0.18/0.48  %    Positive unorientable unit clauses: 0
% 0.18/0.48  %    Negative unit clauses             : 12
% 0.18/0.48  %    Non-unit-clauses                  : 59
% 0.18/0.48  % Current number of unprocessed clauses: 37
% 0.18/0.48  % ...number of literals in the above   : 133
% 0.18/0.48  % Current number of archived formulas  : 0
% 0.18/0.48  % Current number of archived clauses   : 63
% 0.18/0.48  % Clause-clause subsumption calls (NU) : 1803
% 0.18/0.48  % Rec. Clause-clause subsumption calls : 636
% 0.18/0.48  % Non-unit clause-clause subsumptions  : 5
% 0.18/0.48  % Unit Clause-clause subsumption calls : 277
% 0.18/0.48  % Rewrite failures with RHS unbound    : 0
% 0.18/0.48  % BW rewrite match attempts            : 7
% 0.18/0.48  % BW rewrite match successes           : 2
% 0.18/0.48  % Condensation attempts                : 0
% 0.18/0.48  % Condensation successes               : 0
% 0.18/0.48  % Termbank termtop insertions          : 6576
% 0.18/0.48  % Search garbage collected termcells   : 748
% 0.18/0.48  
% 0.18/0.48  % -------------------------------------------------
% 0.18/0.48  % User time                : 0.014 s
% 0.18/0.48  % System time              : 0.006 s
% 0.18/0.48  % Total time               : 0.020 s
% 0.18/0.48  % Maximum resident set size: 3668 pages
% 0.18/0.48  
% 0.18/0.48  % -------------------------------------------------
% 0.18/0.48  % User time                : 0.059 s
% 0.18/0.48  % System time              : 0.019 s
% 0.18/0.48  % Total time               : 0.079 s
% 0.18/0.48  % Maximum resident set size: 4608 pages
% 0.18/0.48  % E exiting
%------------------------------------------------------------------------------