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

View Problem - Process Solution

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

% Computer : n027.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:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel32,conjecture,
    ! [X1] :
      ( ( big_f(X1)
        & big_k(X1) )
     => big_j(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel32) ).

fof(pel32_2,axiom,
    ! [X1] :
      ( ( big_i(X1)
        & big_h(X1) )
     => big_j(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel32_2) ).

fof(pel32_1,axiom,
    ! [X1] :
      ( ( big_f(X1)
        & ( big_g(X1)
          | big_h(X1) ) )
     => big_i(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel32_1) ).

fof(pel32_3,axiom,
    ! [X1] :
      ( big_k(X1)
     => big_h(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel32_3) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( big_f(X1)
          & big_k(X1) )
       => big_j(X1) ),
    inference(assume_negation,[status(cth)],[pel32]) ).

fof(c_0_5,negated_conjecture,
    ( big_f(esk1_0)
    & big_k(esk1_0)
    & ~ big_j(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X2] :
      ( ~ big_i(X2)
      | ~ big_h(X2)
      | big_j(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_2])]) ).

cnf(c_0_7,negated_conjecture,
    ~ big_j(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( big_j(X1)
    | ~ big_h(X1)
    | ~ big_i(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X2] :
      ( ( ~ big_g(X2)
        | ~ big_f(X2)
        | big_i(X2) )
      & ( ~ big_h(X2)
        | ~ big_f(X2)
        | big_i(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_1])])]) ).

fof(c_0_10,plain,
    ! [X2] :
      ( ~ big_k(X2)
      | big_h(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_3])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ big_i(esk1_0)
    | ~ big_h(esk1_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( big_i(X1)
    | ~ big_f(X1)
    | ~ big_h(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    big_f(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,plain,
    ( big_h(X1)
    | ~ big_k(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    big_k(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    ~ big_h(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN062+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n027.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 : Mon Jul 11 19:41:49 EDT 2022
% 0.12/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.014 s
% 0.23/1.41  
% 0.23/1.41  # Failure: Out of unprocessed clauses!
% 0.23/1.41  # OLD status GaveUp
% 0.23/1.41  # Parsed axioms                        : 4
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 1
% 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                    : 5
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 0
% 0.23/1.41  # ...remaining for further processing  : 5
% 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                    : 0
% 0.23/1.41  # ...of the previous two non-trivial   : 0
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 0
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 5
% 0.23/1.41  #    Positive orientable unit clauses  : 2
% 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) : 0
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 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          : 212
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.012 s
% 0.23/1.41  # System time              : 0.002 s
% 0.23/1.41  # Total time               : 0.014 s
% 0.23/1.41  # Maximum resident set size: 2764 pages
% 0.23/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 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             : 18
% 0.23/1.41  # Proof object clause steps            : 9
% 0.23/1.41  # Proof object formula steps           : 9
% 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    : 6
% 0.23/1.41  # Proof object initial formulas used   : 4
% 0.23/1.41  # Proof object generating inferences   : 3
% 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                        : 4
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 7
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 7
% 0.23/1.41  # Processed clauses                    : 10
% 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                   : 0
% 0.23/1.41  # Generated clauses                    : 3
% 0.23/1.41  # ...of the previous two non-trivial   : 3
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 3
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 9
% 0.23/1.41  #    Positive orientable unit clauses  : 2
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 2
% 0.23/1.41  #    Non-unit-clauses                  : 5
% 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) : 0
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 1
% 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          : 329
% 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
%------------------------------------------------------------------------------