TSTP Solution File: TOP026+1 by E---3.1

View Problem - Process Solution

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

% Computer : n021.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:51:10 EDT 2023

% Result   : Theorem 1.17s 0.61s
% Output   : CNFRefutation 1.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   88 (   9 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  100 (  36   ~;  27   |;  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   :   31 (   0 sgn;  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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/tmp/tmp.6iy7teDh3z/E---3.1_21613.p',t5_tsp_2) ).

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/tmp/tmp.6iy7teDh3z/E---3.1_21613.p',t7_tsp_2) ).

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/tmp/tmp.6iy7teDh3z/E---3.1_21613.p',dt_k6_pre_topc) ).

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/tmp/tmp.6iy7teDh3z/E---3.1_21613.p',fc2_tops_1) ).

fof(c_0_4,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_5,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_6,plain,
    ! [X135,X136,X137] :
      ( v3_struct_0(X135)
      | ~ v2_pre_topc(X135)
      | ~ l1_pre_topc(X135)
      | ~ m1_subset_1(X136,k1_zfmisc_1(u1_struct_0(X135)))
      | ~ v1_tsp_2(X136,X135)
      | ~ m1_subset_1(X137,k1_zfmisc_1(u1_struct_0(X135)))
      | ~ v4_pre_topc(X137,X135)
      | X137 = k3_tex_4(X135,k5_subset_1(u1_struct_0(X135),X136,X137)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

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

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

cnf(c_0_10,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_11,negated_conjecture,
    l1_pre_topc(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,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,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_15,negated_conjecture,
    ( k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,X1)) = X1
    | ~ v4_pre_topc(X1,esk1_0)
    | ~ m1_subset_1(X1,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(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]),c_0_13]) ).

fof(c_0_16,plain,
    ! [X125,X126] :
      ( ~ l1_pre_topc(X125)
      | ~ m1_subset_1(X126,k1_zfmisc_1(u1_struct_0(X125)))
      | m1_subset_1(k6_pre_topc(X125,X126),k1_zfmisc_1(u1_struct_0(X125))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])]) ).

cnf(c_0_17,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(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,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_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,
    ! [X129,X130] :
      ( ~ v2_pre_topc(X129)
      | ~ l1_pre_topc(X129)
      | ~ m1_subset_1(X130,k1_zfmisc_1(u1_struct_0(X129)))
      | v4_pre_topc(k6_pre_topc(X129,X130),X129) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_tops_1])]) ).

cnf(c_0_21,negated_conjecture,
    ~ v4_pre_topc(k6_pre_topc(esk1_0,esk3_0),esk1_0),
    inference(cn,[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_11])]) ).

cnf(c_0_22,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_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[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_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : TOP026+1 : TPTP v8.1.2. Released v3.4.0.
% 0.10/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 2400
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Oct  2 19:10:59 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.18/0.46  Running first-order theorem proving
% 0.18/0.47  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/tmp/tmp.6iy7teDh3z/E---3.1_21613.p
% 1.17/0.61  # Version: 3.1pre001
% 1.17/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.61  # Starting new_bool_3 with 300s (1) cores
% 1.17/0.61  # Starting new_bool_1 with 300s (1) cores
% 1.17/0.61  # Starting sh5l with 300s (1) cores
% 1.17/0.61  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21691 completed with status 0
% 1.17/0.61  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.17/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.61  # No SInE strategy applied
% 1.17/0.61  # Search class: FGHSM-FSMM31-MFFFFFNN
% 1.17/0.61  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 1.17/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.17/0.61  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.17/0.61  # Starting new_bool_3 with 136s (1) cores
% 1.17/0.61  # Starting new_bool_1 with 136s (1) cores
% 1.17/0.61  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 21700 completed with status 0
% 1.17/0.61  # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 1.17/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.61  # No SInE strategy applied
% 1.17/0.61  # Search class: FGHSM-FSMM31-MFFFFFNN
% 1.17/0.61  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 1.17/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.17/0.61  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.17/0.61  # Preprocessing time       : 0.002 s
% 1.17/0.61  # Presaturation interreduction done
% 1.17/0.61  
% 1.17/0.61  # Proof found!
% 1.17/0.61  # SZS status Theorem
% 1.17/0.61  # SZS output start CNFRefutation
% See solution above
% 1.17/0.61  # Parsed axioms                        : 78
% 1.17/0.61  # Removed by relevancy pruning/SinE    : 0
% 1.17/0.61  # Initial clauses                      : 180
% 1.17/0.61  # Removed in clause preprocessing      : 9
% 1.17/0.61  # Initial clauses in saturation        : 171
% 1.17/0.61  # Processed clauses                    : 2532
% 1.17/0.61  # ...of these trivial                  : 15
% 1.17/0.61  # ...subsumed                          : 1340
% 1.17/0.61  # ...remaining for further processing  : 1177
% 1.17/0.61  # Other redundant clauses eliminated   : 0
% 1.17/0.61  # Clauses deleted for lack of memory   : 0
% 1.17/0.61  # Backward-subsumed                    : 5
% 1.17/0.61  # Backward-rewritten                   : 24
% 1.17/0.61  # Generated clauses                    : 3412
% 1.17/0.61  # ...of the previous two non-redundant : 3145
% 1.17/0.61  # ...aggressively subsumed             : 0
% 1.17/0.61  # Contextual simplify-reflections      : 0
% 1.17/0.61  # Paramodulations                      : 3409
% 1.17/0.61  # Factorizations                       : 0
% 1.17/0.61  # NegExts                              : 0
% 1.17/0.61  # Equation resolutions                 : 0
% 1.17/0.61  # Total rewrite steps                  : 571
% 1.17/0.61  # Propositional unsat checks           : 0
% 1.17/0.61  #    Propositional check models        : 0
% 1.17/0.61  #    Propositional check unsatisfiable : 0
% 1.17/0.61  #    Propositional clauses             : 0
% 1.17/0.61  #    Propositional clauses after purity: 0
% 1.17/0.61  #    Propositional unsat core size     : 0
% 1.17/0.61  #    Propositional preprocessing time  : 0.000
% 1.17/0.61  #    Propositional encoding time       : 0.000
% 1.17/0.61  #    Propositional solver time         : 0.000
% 1.17/0.61  #    Success case prop preproc time    : 0.000
% 1.17/0.61  #    Success case prop encoding time   : 0.000
% 1.17/0.61  #    Success case prop solver time     : 0.000
% 1.17/0.61  # Current number of processed clauses  : 977
% 1.17/0.61  #    Positive orientable unit clauses  : 71
% 1.17/0.61  #    Positive unorientable unit clauses: 1
% 1.17/0.61  #    Negative unit clauses             : 28
% 1.17/0.61  #    Non-unit-clauses                  : 877
% 1.17/0.61  # Current number of unprocessed clauses: 857
% 1.17/0.61  # ...number of literals in the above   : 3686
% 1.17/0.61  # Current number of archived formulas  : 0
% 1.17/0.61  # Current number of archived clauses   : 199
% 1.17/0.61  # Clause-clause subsumption calls (NU) : 186578
% 1.17/0.61  # Rec. Clause-clause subsumption calls : 132377
% 1.17/0.61  # Non-unit clause-clause subsumptions  : 1212
% 1.17/0.61  # Unit Clause-clause subsumption calls : 998
% 1.17/0.61  # Rewrite failures with RHS unbound    : 0
% 1.17/0.61  # BW rewrite match attempts            : 25
% 1.17/0.61  # BW rewrite match successes           : 15
% 1.17/0.61  # Condensation attempts                : 0
% 1.17/0.61  # Condensation successes               : 0
% 1.17/0.61  # Termbank termtop insertions          : 50742
% 1.17/0.61  
% 1.17/0.61  # -------------------------------------------------
% 1.17/0.61  # User time                : 0.121 s
% 1.17/0.61  # System time              : 0.010 s
% 1.17/0.61  # Total time               : 0.131 s
% 1.17/0.61  # Maximum resident set size: 2220 pages
% 1.17/0.61  
% 1.17/0.61  # -------------------------------------------------
% 1.17/0.61  # User time                : 0.595 s
% 1.17/0.61  # System time              : 0.026 s
% 1.17/0.61  # Total time               : 0.621 s
% 1.17/0.61  # Maximum resident set size: 1752 pages
% 1.17/0.61  % E---3.1 exiting
% 1.17/0.61  % E---3.1 exiting
%------------------------------------------------------------------------------