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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN047+1 : TPTP v8.1.0. Released v2.0.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 05:51:11 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :  169 (   0 equ)
%            Maximal formula atoms :  114 (  10 avg)
%            Number of connectives :  235 (  82   ~; 113   |;  34   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (   6 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    5 (   4 usr;   5 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel17,conjecture,
    ( ( ( p
        & ( q
         => r ) )
     => s )
  <=> ( ( ~ p
        | q
        | s )
      & ( ~ p
        | ~ r
        | s ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel17) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ( p
          & ( q
           => r ) )
       => s )
    <=> ( ( ~ p
          | q
          | s )
        & ( ~ p
          | ~ r
          | s ) ) ),
    inference(assume_negation,[status(cth)],[pel17]) ).

fof(c_0_2,negated_conjecture,
    ( ( p
      | p
      | p )
    & ( r
      | p
      | p )
    & ( ~ s
      | p
      | p )
    & ( p
      | ~ q
      | p )
    & ( r
      | ~ q
      | p )
    & ( ~ s
      | ~ q
      | p )
    & ( p
      | ~ s
      | p )
    & ( r
      | ~ s
      | p )
    & ( ~ s
      | ~ s
      | p )
    & ( p
      | p
      | ~ q
      | r )
    & ( r
      | p
      | ~ q
      | r )
    & ( ~ s
      | p
      | ~ q
      | r )
    & ( p
      | ~ q
      | ~ q
      | r )
    & ( r
      | ~ q
      | ~ q
      | r )
    & ( ~ s
      | ~ q
      | ~ q
      | r )
    & ( p
      | ~ s
      | ~ q
      | r )
    & ( r
      | ~ s
      | ~ q
      | r )
    & ( ~ s
      | ~ s
      | ~ q
      | r )
    & ( p
      | p
      | ~ s )
    & ( r
      | p
      | ~ s )
    & ( ~ s
      | p
      | ~ s )
    & ( p
      | ~ q
      | ~ s )
    & ( r
      | ~ q
      | ~ s )
    & ( ~ s
      | ~ q
      | ~ s )
    & ( p
      | ~ s
      | ~ s )
    & ( r
      | ~ s
      | ~ s )
    & ( ~ s
      | ~ s
      | ~ s )
    & ( ~ p
      | q
      | s
      | q
      | ~ p
      | s )
    & ( ~ p
      | ~ r
      | s
      | q
      | ~ p
      | s )
    & ( ~ p
      | q
      | s
      | ~ r
      | ~ p
      | s )
    & ( ~ p
      | ~ r
      | s
      | ~ r
      | ~ p
      | s ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])]) ).

cnf(c_0_3,negated_conjecture,
    ( s
    | s
    | ~ p
    | ~ r
    | ~ r
    | ~ p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    ( ~ s
    | ~ s
    | ~ s ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( r
    | r
    | ~ q
    | ~ q ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( s
    | ~ p
    | ~ r ),
    inference(cn,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    p,
    inference(cn,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ~ s,
    inference(cn,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    ( s
    | q
    | s
    | q
    | ~ p
    | ~ p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    ( r
    | ~ q ),
    inference(cn,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ~ r,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ( q
    | s
    | ~ p ),
    inference(cn,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ~ q,
    inference(sr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8])]),c_0_14]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n025.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 : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul 12 07:29:18 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.014 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 16
% 0.22/1.41  # Proof object clause steps            : 13
% 0.22/1.41  # Proof object formula steps           : 3
% 0.22/1.41  # Proof object conjectures             : 16
% 0.22/1.41  # Proof object clause conjectures      : 13
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 5
% 0.22/1.41  # Proof object initial formulas used   : 1
% 0.22/1.41  # Proof object generating inferences   : 0
% 0.22/1.41  # Proof object simplifying inferences  : 13
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 1
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 31
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 31
% 0.22/1.41  # Processed clauses                    : 23
% 0.22/1.41  # ...of these trivial                  : 16
% 0.22/1.41  # ...subsumed                          : 2
% 0.22/1.41  # ...remaining for further processing  : 4
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 0
% 0.22/1.41  # Backward-rewritten                   : 0
% 0.22/1.41  # Generated clauses                    : 0
% 0.22/1.41  # ...of the previous two non-trivial   : 0
% 0.22/1.41  # Contextual simplify-reflections      : 0
% 0.22/1.41  # Paramodulations                      : 0
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 0
% 0.22/1.41  # Current number of processed clauses  : 4
% 0.22/1.41  #    Positive orientable unit clauses  : 1
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 3
% 0.22/1.41  #    Non-unit-clauses                  : 0
% 0.22/1.41  # Current number of unprocessed clauses: 8
% 0.22/1.41  # ...number of literals in the above   : 28
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 0
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.22/1.41  # Unit Clause-clause subsumption calls : 0
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 0
% 0.22/1.41  # BW rewrite match successes           : 0
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 859
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.014 s
% 0.22/1.41  # System time              : 0.000 s
% 0.22/1.41  # Total time               : 0.014 s
% 0.22/1.41  # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------