TSTP Solution File: TOP028+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : TOP028+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n025.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  : 600s
% DateTime : Thu Jul 21 21:25:29 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (   8 unt;   0 def)
%            Number of atoms       :  124 (   5 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  158 (  66   ~;  59   |;  23   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   49 (   6 sgn  22   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t10_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) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_tsp_2) ).

fof(t9_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_1(X2,X1)
              & ! [X3] :
                  ( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
                 => ~ ( r1_tarski(X2,X3)
                      & v1_tsp_2(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_tsp_2) ).

fof(t8_boole,axiom,
    ! [X1,X2] :
      ~ ( v1_xboole_0(X1)
        & X1 != X2
        & v1_xboole_0(X2) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).

fof(rc2_subset_1,axiom,
    ! [X1] :
    ? [X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(X1))
      & v1_xboole_0(X2) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc2_subset_1) ).

fof(t11_tsp_1,axiom,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v3_tex_2(X2,X1)
           => v1_tsp_1(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_tsp_1) ).

fof(t35_tex_2,axiom,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( ( v1_xboole_0(X2)
            & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
         => v3_tex_2(X2,X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t35_tex_2) ).

fof(c_0_6,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) ) ),
    inference(assume_negation,[status(cth)],[t10_tsp_2]) ).

fof(c_0_7,negated_conjecture,
    ! [X4] :
      ( ~ v3_struct_0(esk1_0)
      & v2_pre_topc(esk1_0)
      & l1_pre_topc(esk1_0)
      & ( ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(esk1_0)))
        | ~ v1_tsp_2(X4,esk1_0) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6])])])])])])]) ).

fof(c_0_8,plain,
    ! [X4,X5] :
      ( ( m1_subset_1(esk2_2(X4,X5),k1_zfmisc_1(u1_struct_0(X4)))
        | ~ v1_tsp_1(X5,X4)
        | ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
        | v3_struct_0(X4)
        | ~ v2_pre_topc(X4)
        | ~ l1_pre_topc(X4) )
      & ( r1_tarski(X5,esk2_2(X4,X5))
        | ~ v1_tsp_1(X5,X4)
        | ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
        | v3_struct_0(X4)
        | ~ v2_pre_topc(X4)
        | ~ l1_pre_topc(X4) )
      & ( v1_tsp_2(esk2_2(X4,X5),X4)
        | ~ v1_tsp_1(X5,X4)
        | ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
        | v3_struct_0(X4)
        | ~ v2_pre_topc(X4)
        | ~ l1_pre_topc(X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t9_tsp_2])])])])])])])]) ).

fof(c_0_9,plain,
    ! [X3,X4] :
      ( ~ v1_xboole_0(X3)
      | X3 = X4
      | ~ v1_xboole_0(X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).

fof(c_0_10,plain,
    ! [X3] :
      ( m1_subset_1(esk5_1(X3),k1_zfmisc_1(X3))
      & v1_xboole_0(esk5_1(X3)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ v1_tsp_2(X1,esk1_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( v3_struct_0(X1)
    | v1_tsp_2(esk2_2(X1,X2),X1)
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v1_tsp_1(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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,
    ! [X3,X4] :
      ( v3_struct_0(X3)
      | ~ l1_pre_topc(X3)
      | ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
      | ~ v3_tex_2(X4,X3)
      | v1_tsp_1(X4,X3) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t11_tsp_1])])])])])]) ).

fof(c_0_17,plain,
    ! [X3,X4] :
      ( v3_struct_0(X3)
      | ~ v2_pre_topc(X3)
      | ~ l1_pre_topc(X3)
      | ~ v1_xboole_0(X4)
      | ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
      | v3_tex_2(X4,X3) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t35_tex_2])])])])])]) ).

cnf(c_0_18,plain,
    ( X2 = X1
    | ~ v1_xboole_0(X1)
    | ~ v1_xboole_0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,plain,
    v1_xboole_0(esk5_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ v1_tsp_1(X1,esk1_0)
    | ~ m1_subset_1(esk2_2(esk1_0,X1),k1_zfmisc_1(u1_struct_0(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(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_21,plain,
    ( v3_struct_0(X1)
    | m1_subset_1(esk2_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v1_tsp_1(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,plain,
    ( v1_tsp_1(X1,X2)
    | v3_struct_0(X2)
    | ~ v3_tex_2(X1,X2)
    | ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
    | ~ l1_pre_topc(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ( v3_tex_2(X1,X2)
    | v3_struct_0(X2)
    | ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
    | ~ v1_xboole_0(X1)
    | ~ l1_pre_topc(X2)
    | ~ v2_pre_topc(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( X1 = esk5_1(X2)
    | ~ v1_xboole_0(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ v1_tsp_1(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(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_26,plain,
    ( v1_tsp_1(X1,X2)
    | v3_struct_0(X2)
    | ~ v1_xboole_0(X1)
    | ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
    | ~ l1_pre_topc(X2)
    | ~ v2_pre_topc(X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    m1_subset_1(esk5_1(X1),k1_zfmisc_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,plain,
    esk5_1(X1) = esk5_1(X2),
    inference(spm,[status(thm)],[c_0_24,c_0_19]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ v1_xboole_0(X1)
    | ~ 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(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_30,plain,
    m1_subset_1(esk5_1(X1),k1_zfmisc_1(X2)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : TOP028+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun May 29 03:47:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40  # Preprocessing time       : 0.020 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 32
% 0.22/1.40  # Proof object clause steps            : 19
% 0.22/1.40  # Proof object formula steps           : 13
% 0.22/1.40  # Proof object conjectures             : 11
% 0.22/1.40  # Proof object clause conjectures      : 8
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 11
% 0.22/1.40  # Proof object initial formulas used   : 6
% 0.22/1.40  # Proof object generating inferences   : 8
% 0.22/1.40  # Proof object simplifying inferences  : 14
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 63
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 22
% 0.22/1.40  # Initial clauses                      : 107
% 0.22/1.40  # Removed in clause preprocessing      : 3
% 0.22/1.40  # Initial clauses in saturation        : 104
% 0.22/1.40  # Processed clauses                    : 364
% 0.22/1.40  # ...of these trivial                  : 14
% 0.22/1.40  # ...subsumed                          : 140
% 0.22/1.40  # ...remaining for further processing  : 210
% 0.22/1.40  # Other redundant clauses eliminated   : 0
% 0.22/1.40  # Clauses deleted for lack of memory   : 0
% 0.22/1.40  # Backward-subsumed                    : 4
% 0.22/1.40  # Backward-rewritten                   : 7
% 0.22/1.40  # Generated clauses                    : 488
% 0.22/1.40  # ...of the previous two non-trivial   : 432
% 0.22/1.40  # Contextual simplify-reflections      : 84
% 0.22/1.40  # Paramodulations                      : 488
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 0
% 0.22/1.40  # Current number of processed clauses  : 199
% 0.22/1.40  #    Positive orientable unit clauses  : 20
% 0.22/1.40  #    Positive unorientable unit clauses: 1
% 0.22/1.40  #    Negative unit clauses             : 6
% 0.22/1.40  #    Non-unit-clauses                  : 172
% 0.22/1.40  # Current number of unprocessed clauses: 120
% 0.22/1.40  # ...number of literals in the above   : 579
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 11
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 11085
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 7768
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 221
% 0.22/1.40  # Unit Clause-clause subsumption calls : 468
% 0.22/1.40  # Rewrite failures with RHS unbound    : 10
% 0.22/1.40  # BW rewrite match attempts            : 25
% 0.22/1.40  # BW rewrite match successes           : 10
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 12088
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.037 s
% 0.22/1.40  # System time              : 0.002 s
% 0.22/1.40  # Total time               : 0.039 s
% 0.22/1.40  # Maximum resident set size: 3712 pages
%------------------------------------------------------------------------------