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

View Problem - Process Solution

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

% Computer : n016.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 06:04:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(thm69,conjecture,
    ( ( ! [X1] :
          ( ? [X2] : p(X1,X2)
         => ! [X3] : p(X3,X3) )
      & ! [X4] :
        ? [X5] :
          ( p(X4,X5)
          | ( m(X4)
            & q(f(X4,X5)) ) )
      & ! [X6] :
          ( q(X6)
         => ~ m(g(X6)) ) )
   => ! [X7] :
      ? [X8] :
        ( p(g(X7),X8)
        & p(X7,X7) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm69) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X1] :
            ( ? [X2] : p(X1,X2)
           => ! [X3] : p(X3,X3) )
        & ! [X4] :
          ? [X5] :
            ( p(X4,X5)
            | ( m(X4)
              & q(f(X4,X5)) ) )
        & ! [X6] :
            ( q(X6)
           => ~ m(g(X6)) ) )
     => ! [X7] :
        ? [X8] :
          ( p(g(X7),X8)
          & p(X7,X7) ) ),
    inference(assume_negation,[status(cth)],[thm69]) ).

fof(c_0_2,negated_conjecture,
    ! [X9,X10,X11,X12,X14,X16] :
      ( ( ~ p(X9,X10)
        | p(X11,X11) )
      & ( m(X12)
        | p(X12,esk1_1(X12)) )
      & ( q(f(X12,esk2_1(X12)))
        | p(X12,esk1_1(X12)) )
      & ( ~ q(X14)
        | ~ m(g(X14)) )
      & ( ~ p(g(esk3_0),X16)
        | ~ p(esk4_0,esk4_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,
    ( ~ m(g(X1))
    | ~ q(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( p(X1,esk1_1(X1))
    | m(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( p(X1,X1)
    | ~ p(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( p(g(X1),esk1_1(g(X1)))
    | ~ q(X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( p(X1,X1)
    | ~ q(X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( p(X1,esk1_1(X1))
    | q(f(X1,esk2_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p(esk4_0,esk4_0)
    | ~ p(g(esk3_0),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    p(X1,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ~ p(g(esk3_0),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_11,c_0_10]),
    [proof] ).

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