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

View Problem - Process Solution

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

% Computer : n007.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:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(kalish241,conjecture,
    ( ! [X1] :
        ( f(X1)
       => ( g(X1)
          | h(X1) ) )
   => ( ! [X2] :
          ( f(X2)
         => g(X2) )
      | ? [X3] :
          ( f(X3)
          & h(X3) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',kalish241) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
          ( f(X1)
         => ( g(X1)
            | h(X1) ) )
     => ( ! [X2] :
            ( f(X2)
           => g(X2) )
        | ? [X3] :
            ( f(X3)
            & h(X3) ) ) ),
    inference(assume_negation,[status(cth)],[kalish241]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X6] :
      ( ( ~ f(X4)
        | g(X4)
        | h(X4) )
      & f(esk1_0)
      & ~ g(esk1_0)
      & ( ~ f(X6)
        | ~ h(X6) ) ),
    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)],[c_0_1])])])])])]) ).

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

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

cnf(c_0_5,negated_conjecture,
    ~ g(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( g(X1)
    | ~ f(X1) ),
    inference(csr,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    f(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN407+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 19:44:18 EDT 2022
% 0.13/0.34  % 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             : 9
% 0.23/1.41  # Proof object clause steps            : 6
% 0.23/1.41  # Proof object formula steps           : 3
% 0.23/1.41  # Proof object conjectures             : 9
% 0.23/1.41  # Proof object clause conjectures      : 6
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 4
% 0.23/1.41  # Proof object initial formulas used   : 1
% 0.23/1.41  # Proof object generating inferences   : 1
% 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                      : 4
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 4
% 0.23/1.41  # Processed clauses                    : 4
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 0
% 0.23/1.41  # ...remaining for further processing  : 4
% 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                   : 0
% 0.23/1.41  # Generated clauses                    : 1
% 0.23/1.41  # ...of the previous two non-trivial   : 0
% 0.23/1.41  # Contextual simplify-reflections      : 1
% 0.23/1.41  # Paramodulations                      : 1
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 4
% 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                  : 2
% 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   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 1
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 1
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 1
% 0.23/1.41  # Unit Clause-clause subsumption calls : 0
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 228
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.011 s
% 0.23/1.41  # System time              : 0.002 s
% 0.23/1.41  # Total time               : 0.013 s
% 0.23/1.41  # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------