TSTP Solution File: TOP026+4 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : TOP026+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 09:16:23 EDT 2024

% Result   : Theorem 14.59s 3.30s
% Output   : CNFRefutation 14.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   85 (   8 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   96 (  34   ~;  25   |;  17   &)
%                                         (   0 <=>;  20  =>;   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   :   30 (   0 sgn  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t7_tsp_2,conjecture,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(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] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(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] :
      ( ( v2_pre_topc(X1)
        & l1_pre_topc(X1)
        & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(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] :
      ( ( l1_pre_topc(X1)
        & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(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] :
        ( ( ~ v3_struct_0(X1)
          & v2_pre_topc(X1)
          & l1_pre_topc(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)],[inference(assume_negation,[status(cth)],[t7_tsp_2])]) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(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_6,negated_conjecture,
    ( ~ v3_struct_0(esk1_0)
    & v2_pre_topc(esk1_0)
    & l1_pre_topc(esk1_0)
    & m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & v1_tsp_2(esk2_0,esk1_0)
    & m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & 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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_7,plain,
    ! [X232,X233,X234] :
      ( v3_struct_0(X232)
      | ~ v2_pre_topc(X232)
      | ~ l1_pre_topc(X232)
      | ~ m1_subset_1(X233,k1_zfmisc_1(u1_struct_0(X232)))
      | ~ v1_tsp_2(X233,X232)
      | ~ m1_subset_1(X234,k1_zfmisc_1(u1_struct_0(X232)))
      | ~ v4_pre_topc(X234,X232)
      | X234 = k3_tex_4(X232,k5_subset_1(u1_struct_0(X232),X233,X234)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

cnf(c_0_8,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_6]) ).

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

cnf(c_0_10,negated_conjecture,
    v1_tsp_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    v2_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    l1_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_14,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_16,negated_conjecture,
    ( ~ v4_pre_topc(k6_pre_topc(esk1_0,esk3_0),esk1_0)
    | ~ m1_subset_1(k6_pre_topc(esk1_0,esk3_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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).

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

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

fof(c_0_19,plain,
    ! [X156,X157] :
      ( ~ l1_pre_topc(X156)
      | ~ m1_subset_1(X157,k1_zfmisc_1(u1_struct_0(X156)))
      | m1_subset_1(k6_pre_topc(X156,X157),k1_zfmisc_1(u1_struct_0(X156))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).

cnf(c_0_20,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_16,c_0_17]),c_0_11]),c_0_12]),c_0_18])]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : TOP026+4 : TPTP v8.2.0. Released v3.4.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Sat May 18 11:05:29 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.16/0.40  Running first-order theorem proving
% 0.16/0.40  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
% 14.59/3.30  # Version: 3.1.0
% 14.59/3.30  # Preprocessing class: FMLLMLLLSSSNFFN.
% 14.59/3.30  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.59/3.30  # Starting new_bool_3 with 900s (3) cores
% 14.59/3.30  # Starting new_bool_1 with 900s (3) cores
% 14.59/3.30  # Starting sh5l with 300s (1) cores
% 14.59/3.30  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 14.59/3.30  # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 17245 completed with status 0
% 14.59/3.30  # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 14.59/3.30  # Preprocessing class: FMLLMLLLSSSNFFN.
% 14.59/3.30  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.59/3.30  # Starting new_bool_3 with 900s (3) cores
% 14.59/3.30  # Starting new_bool_1 with 900s (3) cores
% 14.59/3.30  # Starting sh5l with 300s (1) cores
% 14.59/3.30  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 14.59/3.30  # SinE strategy is gf120_h_gu_R02_F100_L20000
% 14.59/3.30  # Search class: FGHSM-SMLM31-DFFFFFNN
% 14.59/3.30  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 14.59/3.30  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 174s (1) cores
% 14.59/3.30  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 17246 completed with status 0
% 14.59/3.30  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 14.59/3.30  # Preprocessing class: FMLLMLLLSSSNFFN.
% 14.59/3.30  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.59/3.30  # Starting new_bool_3 with 900s (3) cores
% 14.59/3.30  # Starting new_bool_1 with 900s (3) cores
% 14.59/3.30  # Starting sh5l with 300s (1) cores
% 14.59/3.30  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 14.59/3.30  # SinE strategy is gf120_h_gu_R02_F100_L20000
% 14.59/3.30  # Search class: FGHSM-SMLM31-DFFFFFNN
% 14.59/3.30  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 14.59/3.30  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 174s (1) cores
% 14.59/3.30  # Preprocessing time       : 0.051 s
% 14.59/3.30  # Presaturation interreduction done
% 14.59/3.30  
% 14.59/3.30  # Proof found!
% 14.59/3.30  # SZS status Theorem
% 14.59/3.30  # SZS output start CNFRefutation
% See solution above
% 14.59/3.30  # Parsed axioms                        : 34387
% 14.59/3.30  # Removed by relevancy pruning/SinE    : 33721
% 14.59/3.30  # Initial clauses                      : 1630
% 14.59/3.30  # Removed in clause preprocessing      : 48
% 14.59/3.30  # Initial clauses in saturation        : 1582
% 14.59/3.30  # Processed clauses                    : 11410
% 14.59/3.30  # ...of these trivial                  : 92
% 14.59/3.30  # ...subsumed                          : 5489
% 14.59/3.30  # ...remaining for further processing  : 5829
% 14.59/3.30  # Other redundant clauses eliminated   : 142
% 14.59/3.30  # Clauses deleted for lack of memory   : 0
% 14.59/3.30  # Backward-subsumed                    : 323
% 14.59/3.30  # Backward-rewritten                   : 119
% 14.59/3.30  # Generated clauses                    : 44950
% 14.59/3.30  # ...of the previous two non-redundant : 40164
% 14.59/3.30  # ...aggressively subsumed             : 0
% 14.59/3.30  # Contextual simplify-reflections      : 223
% 14.59/3.30  # Paramodulations                      : 44762
% 14.59/3.30  # Factorizations                       : 2
% 14.59/3.30  # NegExts                              : 0
% 14.59/3.30  # Equation resolutions                 : 153
% 14.59/3.30  # Disequality decompositions           : 0
% 14.59/3.30  # Total rewrite steps                  : 12723
% 14.59/3.30  # ...of those cached                   : 11468
% 14.59/3.30  # Propositional unsat checks           : 1
% 14.59/3.30  #    Propositional check models        : 0
% 14.59/3.30  #    Propositional check unsatisfiable : 0
% 14.59/3.30  #    Propositional clauses             : 0
% 14.59/3.30  #    Propositional clauses after purity: 0
% 14.59/3.30  #    Propositional unsat core size     : 0
% 14.59/3.30  #    Propositional preprocessing time  : 0.000
% 14.59/3.30  #    Propositional encoding time       : 0.028
% 14.59/3.30  #    Propositional solver time         : 0.019
% 14.59/3.30  #    Success case prop preproc time    : 0.000
% 14.59/3.30  #    Success case prop encoding time   : 0.000
% 14.59/3.30  #    Success case prop solver time     : 0.000
% 14.59/3.30  # Current number of processed clauses  : 3806
% 14.59/3.30  #    Positive orientable unit clauses  : 429
% 14.59/3.30  #    Positive unorientable unit clauses: 2
% 14.59/3.30  #    Negative unit clauses             : 613
% 14.59/3.30  #    Non-unit-clauses                  : 2762
% 14.59/3.30  # Current number of unprocessed clauses: 31020
% 14.59/3.30  # ...number of literals in the above   : 110474
% 14.59/3.30  # Current number of archived formulas  : 0
% 14.59/3.30  # Current number of archived clauses   : 1925
% 14.59/3.30  # Clause-clause subsumption calls (NU) : 2762370
% 14.59/3.30  # Rec. Clause-clause subsumption calls : 813355
% 14.59/3.30  # Non-unit clause-clause subsumptions  : 1980
% 14.59/3.30  # Unit Clause-clause subsumption calls : 156871
% 14.59/3.30  # Rewrite failures with RHS unbound    : 0
% 14.59/3.30  # BW rewrite match attempts            : 247
% 14.59/3.30  # BW rewrite match successes           : 127
% 14.59/3.30  # Condensation attempts                : 0
% 14.59/3.30  # Condensation successes               : 0
% 14.59/3.30  # Termbank termtop insertions          : 1768259
% 14.59/3.30  # Search garbage collected termcells   : 362801
% 14.59/3.30  
% 14.59/3.30  # -------------------------------------------------
% 14.59/3.30  # User time                : 1.846 s
% 14.59/3.30  # System time              : 0.124 s
% 14.59/3.30  # Total time               : 1.970 s
% 14.59/3.30  # Maximum resident set size: 67376 pages
% 14.59/3.30  
% 14.59/3.30  # -------------------------------------------------
% 14.59/3.30  # User time                : 2.665 s
% 14.59/3.30  # System time              : 0.173 s
% 14.59/3.30  # Total time               : 2.838 s
% 14.59/3.30  # Maximum resident set size: 53348 pages
% 14.59/3.30  % E---3.1 exiting
% 14.59/3.31  % E exiting
%------------------------------------------------------------------------------