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

View Problem - Process Solution

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

% Computer : n022.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 : Tue Jul 19 09:18:13 EDT 2022

% Result   : Theorem 0.23s 1.40s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (   4 unt;   0 def)
%            Number of atoms       :  153 (  18 equ)
%            Maximal formula atoms :   22 (   4 avg)
%            Number of connectives :  198 (  77   ~;  89   |;  24   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (   1 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d6_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( is_connected_in(X1,X2)
        <=> ! [X3,X4] :
              ~ ( in(X3,X2)
                & in(X4,X2)
                & X3 != X4
                & ~ in(ordered_pair(X3,X4),X1)
                & ~ in(ordered_pair(X4,X3),X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d6_relat_2) ).

fof(d14_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ( connected(X1)
      <=> is_connected_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d14_relat_2) ).

fof(l4_wellord1,conjecture,
    ! [X1] :
      ( relation(X1)
     => ( connected(X1)
      <=> ! [X2,X3] :
            ~ ( in(X2,relation_field(X1))
              & in(X3,relation_field(X1))
              & X2 != X3
              & ~ in(ordered_pair(X2,X3),X1)
              & ~ in(ordered_pair(X3,X2),X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l4_wellord1) ).

fof(c_0_3,plain,
    ! [X5,X6,X7,X8,X6] :
      ( ( ~ is_connected_in(X5,X6)
        | ~ in(X7,X6)
        | ~ in(X8,X6)
        | X7 = X8
        | in(ordered_pair(X7,X8),X5)
        | in(ordered_pair(X8,X7),X5)
        | ~ relation(X5) )
      & ( in(esk6_2(X5,X6),X6)
        | is_connected_in(X5,X6)
        | ~ relation(X5) )
      & ( in(esk7_2(X5,X6),X6)
        | is_connected_in(X5,X6)
        | ~ relation(X5) )
      & ( esk6_2(X5,X6) != esk7_2(X5,X6)
        | is_connected_in(X5,X6)
        | ~ relation(X5) )
      & ( ~ in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5)
        | is_connected_in(X5,X6)
        | ~ relation(X5) )
      & ( ~ in(ordered_pair(esk7_2(X5,X6),esk6_2(X5,X6)),X5)
        | is_connected_in(X5,X6)
        | ~ relation(X5) ) ),
    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)],[d6_relat_2])])])])])])])]) ).

fof(c_0_4,plain,
    ! [X2] :
      ( ( ~ connected(X2)
        | is_connected_in(X2,relation_field(X2))
        | ~ relation(X2) )
      & ( ~ is_connected_in(X2,relation_field(X2))
        | connected(X2)
        | ~ relation(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ( connected(X1)
        <=> ! [X2,X3] :
              ~ ( in(X2,relation_field(X1))
                & in(X3,relation_field(X1))
                & X2 != X3
                & ~ in(ordered_pair(X2,X3),X1)
                & ~ in(ordered_pair(X3,X2),X1) ) ) ),
    inference(assume_negation,[status(cth)],[l4_wellord1]) ).

cnf(c_0_6,plain,
    ( in(ordered_pair(X2,X3),X1)
    | in(ordered_pair(X3,X2),X1)
    | X3 = X2
    | ~ relation(X1)
    | ~ in(X2,X4)
    | ~ in(X3,X4)
    | ~ is_connected_in(X1,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    ( is_connected_in(X1,relation_field(X1))
    | ~ relation(X1)
    | ~ connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ! [X7,X8] :
      ( relation(esk1_0)
      & ( in(esk2_0,relation_field(esk1_0))
        | ~ connected(esk1_0) )
      & ( in(esk3_0,relation_field(esk1_0))
        | ~ connected(esk1_0) )
      & ( esk2_0 != esk3_0
        | ~ connected(esk1_0) )
      & ( ~ in(ordered_pair(esk2_0,esk3_0),esk1_0)
        | ~ connected(esk1_0) )
      & ( ~ in(ordered_pair(esk3_0,esk2_0),esk1_0)
        | ~ connected(esk1_0) )
      & ( connected(esk1_0)
        | ~ in(X7,relation_field(esk1_0))
        | ~ in(X8,relation_field(esk1_0))
        | X7 = X8
        | in(ordered_pair(X7,X8),esk1_0)
        | in(ordered_pair(X8,X7),esk1_0) ) ),
    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)],[c_0_5])])])])])])])]) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | in(ordered_pair(X2,X1),X3)
    | in(ordered_pair(X1,X2),X3)
    | ~ connected(X3)
    | ~ relation(X3)
    | ~ in(X2,relation_field(X3))
    | ~ in(X1,relation_field(X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( in(esk3_0,relation_field(esk1_0))
    | ~ connected(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    relation(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ( X1 = esk3_0
    | in(ordered_pair(X1,esk3_0),esk1_0)
    | in(ordered_pair(esk3_0,X1),esk1_0)
    | ~ connected(esk1_0)
    | ~ in(X1,relation_field(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_13,negated_conjecture,
    ( in(esk2_0,relation_field(esk1_0))
    | ~ connected(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ connected(esk1_0)
    | ~ in(ordered_pair(esk3_0,esk2_0),esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ connected(esk1_0)
    | ~ in(ordered_pair(esk2_0,esk3_0),esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ connected(esk1_0)
    | esk2_0 != esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    ( in(ordered_pair(X1,X2),esk1_0)
    | in(ordered_pair(X2,X1),esk1_0)
    | X2 = X1
    | connected(esk1_0)
    | ~ in(X1,relation_field(esk1_0))
    | ~ in(X2,relation_field(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,plain,
    ( is_connected_in(X1,X2)
    | in(esk6_2(X1,X2),X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_19,negated_conjecture,
    ~ connected(esk1_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( X1 = esk6_2(X2,relation_field(esk1_0))
    | is_connected_in(X2,relation_field(esk1_0))
    | in(ordered_pair(esk6_2(X2,relation_field(esk1_0)),X1),esk1_0)
    | in(ordered_pair(X1,esk6_2(X2,relation_field(esk1_0))),esk1_0)
    | ~ relation(X2)
    | ~ in(X1,relation_field(esk1_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_21,plain,
    ( is_connected_in(X1,X2)
    | in(esk7_2(X1,X2),X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_22,negated_conjecture,
    ( esk7_2(X1,relation_field(esk1_0)) = esk6_2(X2,relation_field(esk1_0))
    | is_connected_in(X1,relation_field(esk1_0))
    | is_connected_in(X2,relation_field(esk1_0))
    | in(ordered_pair(esk7_2(X1,relation_field(esk1_0)),esk6_2(X2,relation_field(esk1_0))),esk1_0)
    | in(ordered_pair(esk6_2(X2,relation_field(esk1_0)),esk7_2(X1,relation_field(esk1_0))),esk1_0)
    | ~ relation(X2)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    ( is_connected_in(X1,X2)
    | ~ relation(X1)
    | ~ in(ordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_24,negated_conjecture,
    ( esk7_2(X1,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
    | is_connected_in(esk1_0,relation_field(esk1_0))
    | is_connected_in(X1,relation_field(esk1_0))
    | in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(X1,relation_field(esk1_0))),esk1_0)
    | in(ordered_pair(esk7_2(X1,relation_field(esk1_0)),esk6_2(esk1_0,relation_field(esk1_0))),esk1_0)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_11]) ).

cnf(c_0_25,plain,
    ( is_connected_in(X1,X2)
    | ~ relation(X1)
    | ~ in(ordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_26,negated_conjecture,
    ( esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
    | is_connected_in(esk1_0,relation_field(esk1_0))
    | in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(esk1_0,relation_field(esk1_0))),esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11])]) ).

cnf(c_0_27,plain,
    ( is_connected_in(X1,X2)
    | ~ relation(X1)
    | esk6_2(X1,X2) != esk7_2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_28,negated_conjecture,
    ( esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
    | is_connected_in(esk1_0,relation_field(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11])]) ).

cnf(c_0_29,plain,
    ( connected(X1)
    | ~ relation(X1)
    | ~ is_connected_in(X1,relation_field(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_30,negated_conjecture,
    is_connected_in(esk1_0,relation_field(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_11])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU242+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n022.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 Jun 19 21:45:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40  # Preprocessing time       : 0.015 s
% 0.23/1.40  
% 0.23/1.40  # Proof found!
% 0.23/1.40  # SZS status Theorem
% 0.23/1.40  # SZS output start CNFRefutation
% See solution above
% 0.23/1.40  # Proof object total steps             : 32
% 0.23/1.40  # Proof object clause steps            : 25
% 0.23/1.40  # Proof object formula steps           : 7
% 0.23/1.40  # Proof object conjectures             : 19
% 0.23/1.40  # Proof object clause conjectures      : 16
% 0.23/1.40  # Proof object formula conjectures     : 3
% 0.23/1.40  # Proof object initial clauses used    : 15
% 0.23/1.40  # Proof object initial formulas used   : 3
% 0.23/1.40  # Proof object generating inferences   : 10
% 0.23/1.40  # Proof object simplifying inferences  : 15
% 0.23/1.40  # Training examples: 0 positive, 0 negative
% 0.23/1.40  # Parsed axioms                        : 36
% 0.23/1.40  # Removed by relevancy pruning/SinE    : 27
% 0.23/1.40  # Initial clauses                      : 21
% 0.23/1.40  # Removed in clause preprocessing      : 0
% 0.23/1.40  # Initial clauses in saturation        : 21
% 0.23/1.40  # Processed clauses                    : 60
% 0.23/1.40  # ...of these trivial                  : 0
% 0.23/1.40  # ...subsumed                          : 15
% 0.23/1.40  # ...remaining for further processing  : 45
% 0.23/1.40  # Other redundant clauses eliminated   : 0
% 0.23/1.40  # Clauses deleted for lack of memory   : 0
% 0.23/1.40  # Backward-subsumed                    : 1
% 0.23/1.40  # Backward-rewritten                   : 2
% 0.23/1.40  # Generated clauses                    : 57
% 0.23/1.40  # ...of the previous two non-trivial   : 53
% 0.23/1.40  # Contextual simplify-reflections      : 11
% 0.23/1.40  # Paramodulations                      : 57
% 0.23/1.40  # Factorizations                       : 0
% 0.23/1.40  # Equation resolutions                 : 0
% 0.23/1.40  # Current number of processed clauses  : 42
% 0.23/1.40  #    Positive orientable unit clauses  : 3
% 0.23/1.40  #    Positive unorientable unit clauses: 0
% 0.23/1.40  #    Negative unit clauses             : 3
% 0.23/1.40  #    Non-unit-clauses                  : 36
% 0.23/1.40  # Current number of unprocessed clauses: 6
% 0.23/1.40  # ...number of literals in the above   : 44
% 0.23/1.40  # Current number of archived formulas  : 0
% 0.23/1.40  # Current number of archived clauses   : 3
% 0.23/1.40  # Clause-clause subsumption calls (NU) : 1227
% 0.23/1.40  # Rec. Clause-clause subsumption calls : 132
% 0.23/1.40  # Non-unit clause-clause subsumptions  : 16
% 0.23/1.40  # Unit Clause-clause subsumption calls : 15
% 0.23/1.40  # Rewrite failures with RHS unbound    : 0
% 0.23/1.40  # BW rewrite match attempts            : 1
% 0.23/1.40  # BW rewrite match successes           : 1
% 0.23/1.40  # Condensation attempts                : 0
% 0.23/1.40  # Condensation successes               : 0
% 0.23/1.40  # Termbank termtop insertions          : 3299
% 0.23/1.40  
% 0.23/1.40  # -------------------------------------------------
% 0.23/1.40  # User time                : 0.023 s
% 0.23/1.40  # System time              : 0.001 s
% 0.23/1.40  # Total time               : 0.024 s
% 0.23/1.40  # Maximum resident set size: 2984 pages
%------------------------------------------------------------------------------