↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : TOP027+1 : 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 : n001.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 0.27s 0.64s
% Output   : CNFRefutation 0.27s
% 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(t8_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)))
               => k1_tops_1(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k1_tops_1(X1,X3))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_tsp_2) ).

fof(t6_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)))
               => ( v3_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',t6_tsp_2) ).

fof(fc6_tops_1,axiom,
    ! [X1,X2] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & l1_pre_topc(X1)
        & v2_pre_topc(X1) )
     => v3_pre_topc(k1_tops_1(X1,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc6_tops_1) ).

fof(dt_k1_tops_1,axiom,
    ! [X1,X2] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & l1_pre_topc(X1) )
     => m1_subset_1(k1_tops_1(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_tops_1) ).

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)))
                 => k1_tops_1(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k1_tops_1(X1,X3))) ) ) ) ),
    inference(assume_negation,[status(cth)],[t8_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)))
                 => k1_tops_1(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k1_tops_1(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)))
               => ( v3_pre_topc(X3,X1)
                 => X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t6_tsp_2]) ).

fof(c_0_7,negated_conjecture,
    ( k1_tops_1(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k1_tops_1(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,
    ! [X9,X10,X11] :
      ( X11 = k3_tex_4(X9,k5_subset_1(u1_struct_0(X9),X10,X11))
      | ~ v3_pre_topc(X11,X9)
      | ~ m1_subset_1(X11,k1_zfmisc_1(u1_struct_0(X9)))
      | ~ v1_tsp_2(X10,X9)
      | ~ m1_subset_1(X10,k1_zfmisc_1(u1_struct_0(X9)))
      | ~ l1_pre_topc(X9)
      | ~ v2_pre_topc(X9)
      | v3_struct_0(X9) ),
    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,
    k1_tops_1(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k1_tops_1(esk1_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( ~ v3_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,
    m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(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,
    v2_pre_topc(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,
    ! [X28,X29] :
      ( v3_pre_topc(k1_tops_1(X28,X29),X28)
      | ~ m1_subset_1(X29,k1_zfmisc_1(u1_struct_0(X28)))
      | ~ l1_pre_topc(X28)
      | ~ v2_pre_topc(X28) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_tops_1])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ m1_subset_1(k1_tops_1(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0)))
    | ~ v3_pre_topc(k1_tops_1(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)
    | v3_pre_topc(k1_tops_1(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,
    ! [X26,X27] :
      ( m1_subset_1(k1_tops_1(X26,X27),k1_zfmisc_1(u1_struct_0(X26)))
      | ~ m1_subset_1(X27,k1_zfmisc_1(u1_struct_0(X26)))
      | ~ l1_pre_topc(X26) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_tops_1])])]) ).

cnf(c_0_21,negated_conjecture,
    ~ m1_subset_1(k1_tops_1(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_19]),c_0_13]),c_0_14])]) ).

cnf(c_0_22,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | m1_subset_1(k1_tops_1(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_19]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : TOP027+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42  % Computer : n001.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Mon Sep 21 12:45:59 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.51  Running first-order theorem proving
% 0.16/0.51  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.27/0.63  % Version: 3.5.1
% 0.27/0.63  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.63  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.63  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.63  % Starting sh5l with 300s (1) cores
% 0.27/0.63  % new_bool_3 with pid 3129164 completed with status 0
% 0.27/0.63  % Result found by new_bool_3
% 0.27/0.63  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.63  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.63  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.63  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.63  % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.27/0.63  % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.27/0.63  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.63  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.63  % SubtermCWHack with pid 3129167 completed with status 0
% 0.27/0.64  % Result found by SubtermCWHack
% 0.27/0.64  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.64  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.64  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.64  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.64  % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.27/0.64  % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.27/0.64  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.64  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.64  % Preprocessing time       : 0.004 s
% 0.27/0.64  
% 0.27/0.64  % Proof found!
% 0.27/0.64  % SZS status Theorem
% 0.27/0.64  % SZS output start CNFRefutation
% See solution above
% 0.27/0.64  % Parsed axioms                        : 79
% 0.27/0.64  % Removed by relevancy pruning/SinE    : 27
% 0.27/0.64  % Initial clauses                      : 142
% 0.27/0.64  % Removed in clause preprocessing      : 3
% 0.27/0.64  % Initial clauses in saturation        : 139
% 0.27/0.64  % Processed clauses                    : 810
% 0.27/0.64  % ...of these trivial                  : 0
% 0.27/0.64  % ...subsumed                          : 457
% 0.27/0.64  % ...remaining for further processing  : 353
% 0.27/0.64  % Other redundant clauses eliminated   : 0
% 0.27/0.64  % Clauses deleted for lack of memory   : 0
% 0.27/0.64  % Backward-subsumed                    : 3
% 0.27/0.64  % Backward-rewritten                   : 2
% 0.27/0.64  % Generated clauses                    : 1180
% 0.27/0.64  % ...of the previous two non-redundant : 1064
% 0.27/0.64  % ...aggressively subsumed             : 0
% 0.27/0.64  % Contextual simplify-reflections      : 0
% 0.27/0.64  % Paramodulations                      : 1180
% 0.27/0.64  % Factorizations                       : 0
% 0.27/0.64  % NegExts                              : 0
% 0.27/0.64  % Equation resolutions                 : 0
% 0.27/0.64  % Disequality decompositions           : 0
% 0.27/0.64  % Total rewrite steps                  : 131
% 0.27/0.64  % ...of those cached                   : 92
% 0.27/0.64  % Propositional unsat checks           : 0
% 0.27/0.64  %    Propositional check models        : 0
% 0.27/0.64  %    Propositional check unsatisfiable : 0
% 0.27/0.64  %    Propositional clauses             : 0
% 0.27/0.64  %    Propositional clauses after purity: 0
% 0.27/0.64  %    Propositional unsat core size     : 0
% 0.27/0.64  %    Propositional preprocessing time  : 0.000
% 0.27/0.64  %    Propositional encoding time       : 0.000
% 0.27/0.64  %    Propositional solver time         : 0.000
% 0.27/0.64  %    Success case prop preproc time    : 0.000
% 0.27/0.64  %    Success case prop encoding time   : 0.000
% 0.27/0.64  %    Success case prop solver time     : 0.000
% 0.27/0.64  % Current number of processed clauses  : 348
% 0.27/0.64  %    Positive orientable unit clauses  : 21
% 0.27/0.64  %    Positive unorientable unit clauses: 2
% 0.27/0.64  %    Negative unit clauses             : 5
% 0.27/0.64  %    Non-unit-clauses                  : 320
% 0.27/0.64  % Current number of unprocessed clauses: 344
% 0.27/0.64  % ...number of literals in the above   : 1789
% 0.27/0.64  % Current number of archived formulas  : 0
% 0.27/0.64  % Current number of archived clauses   : 5
% 0.27/0.64  % Clause-clause subsumption calls (NU) : 38759
% 0.27/0.64  % Rec. Clause-clause subsumption calls : 21110
% 0.27/0.64  % Non-unit clause-clause subsumptions  : 453
% 0.27/0.64  % Unit Clause-clause subsumption calls : 4
% 0.27/0.64  % Rewrite failures with RHS unbound    : 16
% 0.27/0.64  % BW rewrite match attempts            : 10
% 0.27/0.64  % BW rewrite match successes           : 10
% 0.27/0.64  % Condensation attempts                : 0
% 0.27/0.64  % Condensation successes               : 0
% 0.27/0.64  % Termbank termtop insertions          : 24085
% 0.27/0.64  % Search garbage collected termcells   : 1488
% 0.27/0.64  
% 0.27/0.64  % -------------------------------------------------
% 0.27/0.64  % User time                : 0.049 s
% 0.27/0.64  % System time              : 0.005 s
% 0.27/0.64  % Total time               : 0.054 s
% 0.27/0.64  % Maximum resident set size: 3968 pages
% 0.27/0.64  
% 0.27/0.64  % -------------------------------------------------
% 0.27/0.64  % User time                : 0.055 s
% 0.27/0.64  % System time              : 0.011 s
% 0.27/0.64  % Total time               : 0.066 s
% 0.27/0.64  % Maximum resident set size: 4864 pages
% 0.27/0.64  % E exiting
%------------------------------------------------------------------------------