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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN413+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n024.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 05:54:05 EDT 2022

% Result   : Theorem 0.11s 1.30s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   29 (  12   ~;   8   |;   5   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   20 (   3 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kalish256,conjecture,
    ( ! [X1] :
      ? [X2] :
      ! [X3] :
        ( f(X3,X2)
      <=> ( f(X3,X1)
          & ~ f(X3,X3) ) )
   => ~ ? [X4] :
        ! [X5] : f(X5,X4) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',kalish256) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
        ? [X2] :
        ! [X3] :
          ( f(X3,X2)
        <=> ( f(X3,X1)
            & ~ f(X3,X3) ) )
     => ~ ? [X4] :
          ! [X5] : f(X5,X4) ),
    inference(assume_negation,[status(cth)],[kalish256]) ).

fof(c_0_2,negated_conjecture,
    ! [X6,X8,X8,X10] :
      ( ( f(X8,X6)
        | ~ f(X8,esk1_1(X6)) )
      & ( ~ f(X8,X8)
        | ~ f(X8,esk1_1(X6)) )
      & ( ~ f(X8,X6)
        | f(X8,X8)
        | f(X8,esk1_1(X6)) )
      & f(X10,esk2_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_1])])])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( f(X1,esk1_1(X2))
    | f(X1,X1)
    | ~ f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    f(X1,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( f(X1,esk1_1(esk2_0))
    | f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    ( ~ f(X1,esk1_1(X2))
    | ~ f(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    f(esk1_1(esk2_0),esk1_1(esk2_0)),
    inference(ef,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07  % Problem  : SYN413+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.07  % Command  : run_ET %s %d
% 0.06/0.25  % Computer : n024.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Tue Jul 12 00:05:13 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.11/1.30  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.11/1.30  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.11/1.30  # Preprocessing time       : 0.007 s
% 0.11/1.30  
% 0.11/1.30  # Proof found!
% 0.11/1.30  # SZS status Theorem
% 0.11/1.30  # SZS output start CNFRefutation
% See solution above
% 0.11/1.30  # Proof object total steps             : 9
% 0.11/1.30  # Proof object clause steps            : 6
% 0.11/1.30  # Proof object formula steps           : 3
% 0.11/1.30  # Proof object conjectures             : 9
% 0.11/1.30  # Proof object clause conjectures      : 6
% 0.11/1.30  # Proof object formula conjectures     : 3
% 0.11/1.30  # Proof object initial clauses used    : 3
% 0.11/1.30  # Proof object initial formulas used   : 1
% 0.11/1.30  # Proof object generating inferences   : 3
% 0.11/1.30  # Proof object simplifying inferences  : 2
% 0.11/1.30  # Training examples: 0 positive, 0 negative
% 0.11/1.30  # Parsed axioms                        : 1
% 0.11/1.30  # Removed by relevancy pruning/SinE    : 0
% 0.11/1.30  # Initial clauses                      : 4
% 0.11/1.30  # Removed in clause preprocessing      : 0
% 0.11/1.30  # Initial clauses in saturation        : 4
% 0.11/1.30  # Processed clauses                    : 6
% 0.11/1.30  # ...of these trivial                  : 0
% 0.11/1.30  # ...subsumed                          : 0
% 0.11/1.30  # ...remaining for further processing  : 6
% 0.11/1.30  # Other redundant clauses eliminated   : 0
% 0.11/1.30  # Clauses deleted for lack of memory   : 0
% 0.11/1.30  # Backward-subsumed                    : 0
% 0.11/1.30  # Backward-rewritten                   : 0
% 0.11/1.30  # Generated clauses                    : 12
% 0.11/1.30  # ...of the previous two non-trivial   : 7
% 0.11/1.30  # Contextual simplify-reflections      : 0
% 0.11/1.30  # Paramodulations                      : 10
% 0.11/1.30  # Factorizations                       : 2
% 0.11/1.30  # Equation resolutions                 : 0
% 0.11/1.30  # Current number of processed clauses  : 6
% 0.11/1.30  #    Positive orientable unit clauses  : 2
% 0.11/1.30  #    Positive unorientable unit clauses: 0
% 0.11/1.30  #    Negative unit clauses             : 0
% 0.11/1.30  #    Non-unit-clauses                  : 4
% 0.11/1.30  # Current number of unprocessed clauses: 5
% 0.11/1.30  # ...number of literals in the above   : 10
% 0.11/1.30  # Current number of archived formulas  : 0
% 0.11/1.30  # Current number of archived clauses   : 0
% 0.11/1.30  # Clause-clause subsumption calls (NU) : 5
% 0.11/1.30  # Rec. Clause-clause subsumption calls : 5
% 0.11/1.30  # Non-unit clause-clause subsumptions  : 0
% 0.11/1.30  # Unit Clause-clause subsumption calls : 0
% 0.11/1.30  # Rewrite failures with RHS unbound    : 0
% 0.11/1.30  # BW rewrite match attempts            : 0
% 0.11/1.30  # BW rewrite match successes           : 0
% 0.11/1.30  # Condensation attempts                : 0
% 0.11/1.30  # Condensation successes               : 0
% 0.11/1.30  # Termbank termtop insertions          : 416
% 0.11/1.30  
% 0.11/1.30  # -------------------------------------------------
% 0.11/1.30  # User time                : 0.006 s
% 0.11/1.30  # System time              : 0.001 s
% 0.11/1.30  # Total time               : 0.007 s
% 0.11/1.30  # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------