↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : LAT292+2 : 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 : n007.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:06:01 PM UTC 2026

% Result   : Theorem 21.36s 4.62s
% Output   : CNFRefutation 21.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (   6 unt;   0 def)
%            Number of atoms       :  189 (   4 equ)
%            Maximal formula atoms :   18 (   6 avg)
%            Number of connectives :  246 (  86   ~;  79   |;  70   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   26 (   0 sgn  16   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t44_lopclset,conjecture,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ? [X2] :
          ( r1_filter_1(X1,k6_lopclset(X2))
          & l1_pre_topc(X2)
          & v2_pre_topc(X2)
          & ~ v3_struct_0(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_lopclset) ).

fof(d9_lopclset,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_lopclset) ).

fof(t43_lopclset,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => r1_filter_1(X1,k12_lopclset(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_lopclset) ).

fof(dt_k11_lopclset,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ( l1_pre_topc(k11_lopclset(X1))
        & v2_pre_topc(k11_lopclset(X1))
        & v1_pre_topc(k11_lopclset(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k11_lopclset) ).

fof(fc4_lopclset,axiom,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ( v2_pre_topc(k11_lopclset(X1))
        & v1_pre_topc(k11_lopclset(X1))
        & ~ v3_struct_0(k11_lopclset(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_lopclset) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( l3_lattices(X1)
          & ~ v3_realset2(X1)
          & v17_lattices(X1)
          & v10_lattices(X1)
          & ~ v3_struct_0(X1) )
       => ? [X2] :
            ( r1_filter_1(X1,k6_lopclset(X2))
            & l1_pre_topc(X2)
            & v2_pre_topc(X2)
            & ~ v3_struct_0(X2) ) ),
    inference(assume_negation,[status(cth)],[t44_lopclset]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ( l3_lattices(X1)
          & ~ v3_realset2(X1)
          & v17_lattices(X1)
          & v10_lattices(X1)
          & ~ v3_struct_0(X1) )
       => ? [X2] :
            ( r1_filter_1(X1,k6_lopclset(X2))
            & l1_pre_topc(X2)
            & v2_pre_topc(X2)
            & ~ v3_struct_0(X2) ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
    inference(fof_simplification,[status(thm)],[d9_lopclset]) ).

fof(c_0_8,negated_conjecture,
    ! [X14] :
      ( ( ~ r1_filter_1(esk1_0,k6_lopclset(X14))
        | ~ l1_pre_topc(X14)
        | ~ v2_pre_topc(X14)
        | v3_struct_0(X14) )
      & l3_lattices(esk1_0)
      & ~ v3_realset2(esk1_0)
      & v17_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_6])])])])]) ).

fof(c_0_9,plain,
    ! [X144] :
      ( k12_lopclset(X144) = k6_lopclset(k11_lopclset(X144))
      | ~ l3_lattices(X144)
      | v3_realset2(X144)
      | ~ v17_lattices(X144)
      | ~ v10_lattices(X144)
      | v3_struct_0(X144) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_10,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => r1_filter_1(X1,k12_lopclset(X1)) ),
    inference(fof_simplification,[status(thm)],[t43_lopclset]) ).

fof(c_0_11,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ( l1_pre_topc(k11_lopclset(X1))
        & v2_pre_topc(k11_lopclset(X1))
        & v1_pre_topc(k11_lopclset(X1)) ) ),
    inference(fof_simplification,[status(thm)],[dt_k11_lopclset]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( ( l3_lattices(X1)
        & ~ v3_realset2(X1)
        & v17_lattices(X1)
        & v10_lattices(X1)
        & ~ v3_struct_0(X1) )
     => ( v2_pre_topc(k11_lopclset(X1))
        & v1_pre_topc(k11_lopclset(X1))
        & ~ v3_struct_0(k11_lopclset(X1)) ) ),
    inference(fof_simplification,[status(thm)],[fc4_lopclset]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ r1_filter_1(esk1_0,k6_lopclset(X1))
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( ~ l3_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ v10_lattices(X1)
    | k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1))
    | v3_realset2(X1)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X26] :
      ( r1_filter_1(X26,k12_lopclset(X26))
      | ~ l3_lattices(X26)
      | v3_realset2(X26)
      | ~ v17_lattices(X26)
      | ~ v10_lattices(X26)
      | v3_struct_0(X26) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_16,plain,
    ! [X1143] :
      ( ( ~ l3_lattices(X1143)
        | v3_realset2(X1143)
        | ~ v17_lattices(X1143)
        | ~ v10_lattices(X1143)
        | v3_struct_0(X1143)
        | l1_pre_topc(k11_lopclset(X1143)) )
      & ( ~ l3_lattices(X1143)
        | v3_realset2(X1143)
        | ~ v17_lattices(X1143)
        | ~ v10_lattices(X1143)
        | v3_struct_0(X1143)
        | v2_pre_topc(k11_lopclset(X1143)) )
      & ( ~ l3_lattices(X1143)
        | v3_realset2(X1143)
        | ~ v17_lattices(X1143)
        | ~ v10_lattices(X1143)
        | v3_struct_0(X1143)
        | v1_pre_topc(k11_lopclset(X1143)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

fof(c_0_17,plain,
    ! [X1144] :
      ( ( ~ l3_lattices(X1144)
        | v3_realset2(X1144)
        | ~ v17_lattices(X1144)
        | ~ v10_lattices(X1144)
        | v3_struct_0(X1144)
        | v2_pre_topc(k11_lopclset(X1144)) )
      & ( ~ l3_lattices(X1144)
        | v3_realset2(X1144)
        | ~ v17_lattices(X1144)
        | ~ v10_lattices(X1144)
        | v3_struct_0(X1144)
        | v1_pre_topc(k11_lopclset(X1144)) )
      & ( ~ l3_lattices(X1144)
        | v3_realset2(X1144)
        | ~ v17_lattices(X1144)
        | ~ v10_lattices(X1144)
        | v3_struct_0(X1144)
        | ~ v3_struct_0(k11_lopclset(X1144)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ l3_lattices(X1)
    | ~ v10_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ l1_pre_topc(k11_lopclset(X1))
    | ~ v2_pre_topc(k11_lopclset(X1))
    | ~ r1_filter_1(esk1_0,k12_lopclset(X1))
    | v3_struct_0(X1)
    | v3_realset2(X1)
    | v3_struct_0(k11_lopclset(X1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( ~ l3_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ v10_lattices(X1)
    | r1_filter_1(X1,k12_lopclset(X1))
    | v3_realset2(X1)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ l3_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ v10_lattices(X1)
    | v3_realset2(X1)
    | v3_struct_0(X1)
    | v2_pre_topc(k11_lopclset(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ l3_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ v10_lattices(X1)
    | v3_realset2(X1)
    | v3_struct_0(X1)
    | l1_pre_topc(k11_lopclset(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    ( ~ l3_lattices(X1)
    | ~ v17_lattices(X1)
    | ~ v10_lattices(X1)
    | ~ v3_struct_0(k11_lopclset(X1))
    | v3_realset2(X1)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ~ v3_realset2(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_24,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_25,negated_conjecture,
    v17_lattices(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,negated_conjecture,
    v10_lattices(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_27,negated_conjecture,
    l3_lattices(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_28,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_18,c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25,c_0_26,c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LAT292+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47  % Computer : n007.cluster.edu
% 0.20/0.47  % Model    : x86_64 x86_64
% 0.20/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47  % Memory   : 8046.5625MB
% 0.20/0.47  % OS       : Linux 6.8.0-71-generic
% 0.20/0.47  % CPULimit : 300
% 0.20/0.47  % WCLimit  : 300
% 0.20/0.47  % DateTime : Sun Sep 20 23:26:21 UTC 2026
% 0.20/0.47  % CPUTime  : 
% 0.20/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56  Running first-order theorem proving
% 0.24/0.56  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
% 21.36/4.62  % Version: 3.5.1
% 21.36/4.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.36/4.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.36/4.62  % Starting new_bool_3 with 900s (3) cores
% 21.36/4.62  % Starting new_bool_1 with 900s (3) cores
% 21.36/4.62  % Starting sh5l with 300s (1) cores
% 21.36/4.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 21.36/4.62  % new_bool_1 with pid 3815884 completed with status 0
% 21.36/4.62  % Result found by new_bool_1
% 21.36/4.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.36/4.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.36/4.62  % Starting new_bool_3 with 900s (3) cores
% 21.36/4.62  % Starting new_bool_1 with 900s (3) cores
% 21.36/4.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.36/4.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.36/4.62  % Search class: FGHSM-SMLM32-MFFFFFNN
% 21.36/4.62  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 21.36/4.62  % Starting SubtermCWHack with 82s (1) cores
% 21.36/4.62  % Starting new_bool_1 with 91s (1) cores
% 21.36/4.62  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 21.36/4.62  % C12_02_nc_SAT001_MinMin_p005000_rr with pid 3815890 completed with status 0
% 21.36/4.62  % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 21.36/4.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.36/4.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.36/4.62  % Starting new_bool_3 with 900s (3) cores
% 21.36/4.62  % Starting new_bool_1 with 900s (3) cores
% 21.36/4.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.36/4.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.36/4.62  % Search class: FGHSM-SMLM32-MFFFFFNN
% 21.36/4.62  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 21.36/4.62  % Starting SubtermCWHack with 82s (1) cores
% 21.36/4.62  % Starting new_bool_1 with 91s (1) cores
% 21.36/4.62  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 21.36/4.62  % Preprocessing time       : 0.050 s
% 21.36/4.62  % Presaturation interreduction done
% 21.36/4.62  % SatCheck found unsatisfiable ground set
% 21.36/4.62  
% 21.36/4.62  % Proof found!
% 21.36/4.62  % SZS status Theorem
% 21.36/4.62  % SZS output start CNFRefutation
% See solution above
% 21.36/4.62  % Parsed axioms                        : 6468
% 21.36/4.62  % Removed by relevancy pruning/SinE    : 5660
% 21.36/4.62  % Initial clauses                      : 1738
% 21.36/4.62  % Removed in clause preprocessing      : 51
% 21.36/4.62  % Initial clauses in saturation        : 1687
% 21.36/4.62  % Processed clauses                    : 13532
% 21.36/4.62  % ...of these trivial                  : 137
% 21.36/4.62  % ...subsumed                          : 8395
% 21.36/4.62  % ...remaining for further processing  : 5000
% 21.36/4.62  % Other redundant clauses eliminated   : 261
% 21.36/4.62  % Clauses deleted for lack of memory   : 0
% 21.36/4.62  % Backward-subsumed                    : 72
% 21.36/4.62  % Backward-rewritten                   : 49
% 21.36/4.62  % Generated clauses                    : 41141
% 21.36/4.62  % ...of the previous two non-redundant : 37917
% 21.36/4.62  % ...aggressively subsumed             : 0
% 21.36/4.62  % Contextual simplify-reflections      : 88
% 21.36/4.62  % Paramodulations                      : 40872
% 21.36/4.62  % Factorizations                       : 9
% 21.36/4.62  % NegExts                              : 0
% 21.36/4.62  % Equation resolutions                 : 273
% 21.36/4.62  % Disequality decompositions           : 0
% 21.36/4.62  % Total rewrite steps                  : 6008
% 21.36/4.62  % ...of those cached                   : 5055
% 21.36/4.62  % Propositional unsat checks           : 1
% 21.36/4.62  %    Propositional check models        : 0
% 21.36/4.62  %    Propositional check unsatisfiable : 1
% 21.36/4.62  %    Propositional clauses             : 30760
% 21.36/4.62  %    Propositional clauses after purity: 5930
% 21.36/4.62  %    Propositional unsat core size     : 10
% 21.36/4.62  %    Propositional preprocessing time  : 0.000
% 21.36/4.62  %    Propositional encoding time       : 0.104
% 21.36/4.62  %    Propositional solver time         : 0.018
% 21.36/4.62  %    Success case prop preproc time    : 0.000
% 21.36/4.62  %    Success case prop encoding time   : 0.104
% 21.36/4.62  %    Success case prop solver time     : 0.018
% 21.36/4.62  % Current number of processed clauses  : 3244
% 21.36/4.62  %    Positive orientable unit clauses  : 407
% 21.36/4.62  %    Positive unorientable unit clauses: 2
% 21.36/4.62  %    Negative unit clauses             : 553
% 21.36/4.62  %    Non-unit-clauses                  : 2282
% 21.36/4.62  % Current number of unprocessed clauses: 27516
% 21.36/4.62  % ...number of literals in the above   : 111809
% 21.36/4.62  % Current number of archived formulas  : 0
% 21.36/4.62  % Current number of archived clauses   : 1662
% 21.36/4.62  % Clause-clause subsumption calls (NU) : 3020149
% 21.36/4.62  % Rec. Clause-clause subsumption calls : 833234
% 21.36/4.62  % Non-unit clause-clause subsumptions  : 2912
% 21.36/4.62  % Unit Clause-clause subsumption calls : 129102
% 21.36/4.62  % Rewrite failures with RHS unbound    : 0
% 21.36/4.62  % BW rewrite match attempts            : 244
% 21.36/4.62  % BW rewrite match successes           : 186
% 21.36/4.62  % Condensation attempts                : 0
% 21.36/4.62  % Condensation successes               : 0
% 21.36/4.62  % Termbank termtop insertions          : 960548
% 21.36/4.62  % Search garbage collected termcells   : 73393
% 21.36/4.62  
% 21.36/4.62  % -------------------------------------------------
% 21.36/4.62  % User time                : 3.394 s
% 21.36/4.62  % System time              : 0.130 s
% 21.36/4.62  % Total time               : 3.524 s
% 21.36/4.62  % Maximum resident set size: 17104 pages
% 21.36/4.62  
% 21.36/4.62  % -------------------------------------------------
% 21.36/4.62  % User time                : 9.389 s
% 21.36/4.62  % System time              : 0.346 s
% 21.36/4.62  % Total time               : 9.735 s
% 21.36/4.62  % Maximum resident set size: 12800 pages
% 21.36/4.62  % E exiting
%------------------------------------------------------------------------------