↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n002.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 03:53:52 PM UTC 2026

% Result   : Theorem 99.39s 13.70s
% Output   : CNFRefutation 99.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   92 (   9 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  104 (  36   ~;  25   |;  19   &)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t7_tsp_2,conjecture,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
           => ! [X3] :
                ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
               => k6_pre_topc(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k6_pre_topc(X1,X3))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_tsp_2) ).

fof(t5_tsp_2,axiom,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
           => ! [X3] :
                ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
               => ( v4_pre_topc(X3,X1)
                 => X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_tsp_2) ).

fof(fc2_tops_1,axiom,
    ! [X1,X2] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & l1_pre_topc(X1)
        & v2_pre_topc(X1) )
     => v4_pre_topc(k6_pre_topc(X1,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+207.ax',fc2_tops_1) ).

fof(dt_k6_pre_topc,axiom,
    ! [X1,X2] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & l1_pre_topc(X1) )
     => m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',dt_k6_pre_topc) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
           => ( v1_tsp_2(X2,X1)
             => ! [X3] :
                  ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
                 => k6_pre_topc(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k6_pre_topc(X1,X3))) ) ) ) ),
    inference(assume_negation,[status(cth)],[t7_tsp_2]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
           => ( v1_tsp_2(X2,X1)
             => ! [X3] :
                  ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
                 => k6_pre_topc(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k6_pre_topc(X1,X3))) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
           => ! [X3] :
                ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
               => ( v4_pre_topc(X3,X1)
                 => X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t5_tsp_2]) ).

fof(c_0_7,negated_conjecture,
    ( k6_pre_topc(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k6_pre_topc(esk1_0,esk3_0)))
    & m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & v1_tsp_2(esk2_0,esk1_0)
    & m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & l1_pre_topc(esk1_0)
    & v2_pre_topc(esk1_0)
    & ~ v3_struct_0(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_8,plain,
    ! [X267,X268,X269] :
      ( X269 = k3_tex_4(X267,k5_subset_1(u1_struct_0(X267),X268,X269))
      | ~ v4_pre_topc(X269,X267)
      | ~ m1_subset_1(X269,k1_zfmisc_1(u1_struct_0(X267)))
      | ~ v1_tsp_2(X268,X267)
      | ~ m1_subset_1(X268,k1_zfmisc_1(u1_struct_0(X267)))
      | ~ l1_pre_topc(X267)
      | ~ v2_pre_topc(X267)
      | v3_struct_0(X267) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

cnf(c_0_9,negated_conjecture,
    k6_pre_topc(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k6_pre_topc(esk1_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( ~ v4_pre_topc(X3,X1)
    | ~ m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v1_tsp_2(X2,X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    v1_tsp_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    v2_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    l1_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_16,plain,
    ! [X164,X165] :
      ( v4_pre_topc(k6_pre_topc(X164,X165),X164)
      | ~ m1_subset_1(X165,k1_zfmisc_1(u1_struct_0(X164)))
      | ~ l1_pre_topc(X164)
      | ~ v2_pre_topc(X164) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_tops_1])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ m1_subset_1(k6_pre_topc(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0)))
    | ~ v4_pre_topc(k6_pre_topc(esk1_0,esk3_0),esk1_0) ),
    inference(sr,[status(thm)],[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_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_18,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | v4_pre_topc(k6_pre_topc(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_20,plain,
    ! [X162,X163] :
      ( m1_subset_1(k6_pre_topc(X162,X163),k1_zfmisc_1(u1_struct_0(X162)))
      | ~ m1_subset_1(X163,k1_zfmisc_1(u1_struct_0(X162)))
      | ~ l1_pre_topc(X162) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).

cnf(c_0_21,negated_conjecture,
    ~ m1_subset_1(k6_pre_topc(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_13]),c_0_19])]) ).

cnf(c_0_22,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : TOP026+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n002.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 21 12:42:33 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43  Running first-order theorem proving
% 0.10/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
% 99.39/13.70  % Version: 3.5.1
% 99.39/13.70  % Preprocessing class: FMLLSMLLSSSNFFN.
% 99.39/13.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.39/13.70  % Starting new_bool_3 with 900s (3) cores
% 99.39/13.70  % Starting new_bool_1 with 900s (3) cores
% 99.39/13.70  % Starting sh5l with 300s (1) cores
% 99.39/13.70  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 99.39/13.70  % new_bool_1 with pid 3289026 completed with status 0
% 99.39/13.70  % Result found by new_bool_1
% 99.39/13.70  % Preprocessing class: FMLLSMLLSSSNFFN.
% 99.39/13.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.39/13.70  % Starting new_bool_3 with 900s (3) cores
% 99.39/13.70  % Starting new_bool_1 with 900s (3) cores
% 99.39/13.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 99.39/13.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 99.39/13.70  % Search class: FGHSM-SMLM31-MFFFFFNN
% 99.39/13.70  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 99.39/13.70  % Starting SubtermCWHack with 91s (1) cores
% 99.39/13.70  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 99.39/13.70  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 99.39/13.70  % C07_19_nc_SAT001_MinMin_p005000_rr with pid 3289034 completed with status 0
% 99.39/13.70  % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 99.39/13.70  % Preprocessing class: FMLLSMLLSSSNFFN.
% 99.39/13.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.39/13.70  % Starting new_bool_3 with 900s (3) cores
% 99.39/13.70  % Starting new_bool_1 with 900s (3) cores
% 99.39/13.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 99.39/13.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 99.39/13.70  % Search class: FGHSM-SMLM31-MFFFFFNN
% 99.39/13.70  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 99.39/13.70  % Starting SubtermCWHack with 91s (1) cores
% 99.39/13.70  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 99.39/13.70  % Preprocessing time       : 0.096 s
% 99.39/13.70  % Presaturation interreduction done
% 99.39/13.70  
% 99.39/13.70  % Proof found!
% 99.39/13.70  % SZS status Theorem
% 99.39/13.70  % SZS output start CNFRefutation
% See solution above
% 99.39/13.70  % Parsed axioms                        : 13482
% 99.39/13.70  % Removed by relevancy pruning/SinE    : 11750
% 99.39/13.70  % Initial clauses                      : 4114
% 99.39/13.70  % Removed in clause preprocessing      : 114
% 99.39/13.70  % Initial clauses in saturation        : 4000
% 99.39/13.70  % Processed clauses                    : 29934
% 99.39/13.70  % ...of these trivial                  : 412
% 99.39/13.70  % ...subsumed                          : 15524
% 99.39/13.70  % ...remaining for further processing  : 13998
% 99.39/13.70  % Other redundant clauses eliminated   : 519
% 99.39/13.70  % Clauses deleted for lack of memory   : 0
% 99.39/13.70  % Backward-subsumed                    : 438
% 99.39/13.70  % Backward-rewritten                   : 195
% 99.39/13.70  % Generated clauses                    : 114650
% 99.39/13.70  % ...of the previous two non-redundant : 106359
% 99.39/13.70  % ...aggressively subsumed             : 0
% 99.39/13.70  % Contextual simplify-reflections      : 475
% 99.39/13.70  % Paramodulations                      : 114065
% 99.39/13.70  % Factorizations                       : 9
% 99.39/13.70  % NegExts                              : 0
% 99.39/13.70  % Equation resolutions                 : 544
% 99.39/13.70  % Disequality decompositions           : 0
% 99.39/13.70  % Total rewrite steps                  : 19779
% 99.39/13.70  % ...of those cached                   : 17342
% 99.39/13.70  % Propositional unsat checks           : 2
% 99.39/13.70  %    Propositional check models        : 1
% 99.39/13.70  %    Propositional check unsatisfiable : 0
% 99.39/13.70  %    Propositional clauses             : 0
% 99.39/13.70  %    Propositional clauses after purity: 0
% 99.39/13.70  %    Propositional unsat core size     : 0
% 99.39/13.70  %    Propositional preprocessing time  : 0.000
% 99.39/13.70  %    Propositional encoding time       : 0.084
% 99.39/13.70  %    Propositional solver time         : 0.091
% 99.39/13.70  %    Success case prop preproc time    : 0.000
% 99.39/13.70  %    Success case prop encoding time   : 0.000
% 99.39/13.70  %    Success case prop solver time     : 0.000
% 99.39/13.70  % Current number of processed clauses  : 9474
% 99.39/13.70  %    Positive orientable unit clauses  : 1119
% 99.39/13.70  %    Positive unorientable unit clauses: 9
% 99.39/13.70  %    Negative unit clauses             : 2269
% 99.39/13.70  %    Non-unit-clauses                  : 6077
% 99.39/13.70  % Current number of unprocessed clauses: 83393
% 99.39/13.70  % ...number of literals in the above   : 353766
% 99.39/13.70  % Current number of archived formulas  : 0
% 99.39/13.70  % Current number of archived clauses   : 4269
% 99.39/13.70  % Clause-clause subsumption calls (NU) : 18704478
% 99.39/13.70  % Rec. Clause-clause subsumption calls : 4354844
% 99.39/13.70  % Non-unit clause-clause subsumptions  : 4502
% 99.39/13.70  % Unit Clause-clause subsumption calls : 2046969
% 99.39/13.70  % Rewrite failures with RHS unbound    : 12
% 99.39/13.70  % BW rewrite match attempts            : 776
% 99.39/13.70  % BW rewrite match successes           : 493
% 99.39/13.70  % Condensation attempts                : 0
% 99.39/13.70  % Condensation successes               : 0
% 99.39/13.70  % Termbank termtop insertions          : 2292599
% 99.39/13.70  % Search garbage collected termcells   : 174065
% 99.39/13.70  
% 99.39/13.70  % -------------------------------------------------
% 99.39/13.70  % User time                : 12.263 s
% 99.39/13.70  % System time              : 0.206 s
% 99.39/13.70  % Total time               : 12.469 s
% 99.39/13.70  % Maximum resident set size: 33924 pages
% 99.39/13.70  
% 99.39/13.70  % -------------------------------------------------
% 99.39/13.70  % User time                : 36.192 s
% 99.39/13.70  % System time              : 0.672 s
% 99.39/13.70  % Total time               : 36.865 s
% 99.39/13.70  % Maximum resident set size: 23040 pages
% 99.39/13.70  % E exiting
%------------------------------------------------------------------------------