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

View Problem - Process Solution

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

% Computer : n010.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:21 EDT 2022

% Result   : Theorem 0.26s 1.44s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   2 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :   17 (   3 avg)
%            Number of connectives :   74 (  26   ~;  28   |;   6   &)
%                                         (   6 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   36 (   2 sgn   4   !;   4   ?)

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

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

fof(c_0_2,negated_conjecture,
    ! [X4,X5] :
      ( ( ~ big_f(X4,esk1_2(X4,X5))
        | big_g(X5,esk1_2(X4,X5))
        | ~ big_f(X4,X5) )
      & ( ~ big_g(X5,esk1_2(X4,X5))
        | big_f(X4,esk1_2(X4,X5))
        | ~ big_f(X4,X5) )
      & ( ~ big_f(X4,X5)
        | ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5))
        | big_g(esk1_2(X4,X5),esk1_2(X4,X5)) )
      & ( big_f(esk1_2(X4,X5),esk1_2(X4,X5))
        | big_f(X4,X5) )
      & ( ~ big_g(esk1_2(X4,X5),esk1_2(X4,X5))
        | big_f(X4,X5) )
      & ( ~ big_g(X4,X5)
        | ~ big_g(esk1_2(X4,X5),esk1_2(X4,X5)) )
      & ( big_g(X4,X5)
        | big_g(esk1_2(X4,X5),esk1_2(X4,X5)) ) ),
    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(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | big_g(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_6,negated_conjecture,
    ( big_g(X1,X2)
    | big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ( big_f(X1,esk1_2(X1,X2))
    | ~ big_f(X1,X2)
    | ~ big_g(X2,esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ big_g(X1,X2)
    | ~ big_f(X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( big_g(X2,esk1_2(X1,X2))
    | ~ big_f(X1,X2)
    | ~ big_f(X1,esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_12,negated_conjecture,
    ( big_f(X1,esk1_2(X2,X1))
    | big_f(X2,esk1_2(X2,X1))
    | ~ big_f(X2,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_f(X1,esk1_2(X2,X1))
    | ~ big_f(X2,esk1_2(X2,X1))
    | ~ big_f(X2,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    big_f(X1,X2),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]),c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_16]),c_0_16]),c_0_16])]),
    [proof] ).

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