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

View Problem - Process Solution

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

% Computer : n021.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:53:32 EDT 2022

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

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

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

fof(c_0_2,negated_conjecture,
    ! [X8,X9] :
      ( big_f(esk1_0,X9,esk1_0,esk3_2(X8,X9))
      & ( ~ big_f(esk1_0,X8,esk1_0,X9)
        | big_f(X8,esk2_0,X8,X9) )
      & ( ~ big_f(X8,esk2_0,X8,X9)
        | big_f(esk1_0,X8,esk1_0,X9) )
      & big_f(esk1_0,X8,esk1_0,X9)
      & ( big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
        | big_f(esk1_0,X9,X8,X9) )
      & ( ~ big_f(esk1_0,X8,esk1_0,X9)
        | ~ big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,X9,X8,X9) )
      & ( big_f(esk1_0,X8,esk1_0,X9)
        | big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,X9,X8,X9) )
      & ( big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
        | ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
      & ( ~ big_f(esk1_0,X8,esk1_0,X9)
        | ~ big_f(esk1_0,X9,X8,X9)
        | ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
      & ( big_f(esk1_0,X8,esk1_0,X9)
        | big_f(esk1_0,X9,X8,X9)
        | ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
    | ~ big_f(esk1_0,X2,X1,X2)
    | ~ big_f(esk1_0,X1,esk1_0,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    big_f(esk1_0,X1,esk1_0,X2),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
    | ~ big_f(esk1_0,X2,X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

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

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