TSTP Solution File: SYN334+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN334+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 13:15:04 EST 2010

% Result   : Theorem 0.22s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :  125 (   0 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :  155 (  59   ~;  58   |;  24   &)
%                                         (   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   :   56 (   2 sgn  10   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,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('/tmp/tmpKloW5A/sel_SYN334+1.p_1',church_46_14_6) ).

fof(2,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)],[1]) ).

fof(3,negated_conjecture,
    ! [X1,X2] :
    ? [X3] :
      ( ( ~ big_f(X1,X2)
        | ( ( ~ big_f(X1,X3)
            | big_g(X2,X3) )
          & ( ~ big_g(X2,X3)
            | big_f(X1,X3) ) ) )
      & ( ~ big_f(X1,X2)
        | ~ big_f(X3,X3)
        | big_g(X3,X3) )
      & ( ( big_f(X3,X3)
          & ~ big_g(X3,X3) )
        | big_f(X1,X2) )
      & ( ~ big_g(X1,X2)
        | ~ big_g(X3,X3) )
      & ( big_g(X1,X2)
        | big_g(X3,X3) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ! [X4,X5] :
    ? [X6] :
      ( ( ~ big_f(X4,X5)
        | ( ( ~ big_f(X4,X6)
            | big_g(X5,X6) )
          & ( ~ big_g(X5,X6)
            | big_f(X4,X6) ) ) )
      & ( ~ big_f(X4,X5)
        | ~ big_f(X6,X6)
        | big_g(X6,X6) )
      & ( ( big_f(X6,X6)
          & ~ big_g(X6,X6) )
        | big_f(X4,X5) )
      & ( ~ big_g(X4,X5)
        | ~ big_g(X6,X6) )
      & ( big_g(X4,X5)
        | big_g(X6,X6) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X4,X5] :
      ( ( ~ big_f(X4,X5)
        | ( ( ~ big_f(X4,esk1_2(X4,X5))
            | big_g(X5,esk1_2(X4,X5)) )
          & ( ~ big_g(X5,esk1_2(X4,X5))
            | big_f(X4,esk1_2(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_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(skolemize,[status(esa)],[4]) ).

fof(6,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)],[5]) ).

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

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

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

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

cnf(11,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)],[6]) ).

cnf(12,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)],[6]) ).

cnf(13,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)],[6]) ).

cnf(14,negated_conjecture,
    ( big_f(X1,X2)
    | big_g(X1,X2) ),
    inference(spm,[status(thm)],[9,7,theory(equality)]) ).

cnf(17,negated_conjecture,
    ( ~ big_g(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(X1,X2) ),
    inference(spm,[status(thm)],[8,11,theory(equality)]) ).

cnf(19,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[8,14,theory(equality)]) ).

cnf(20,negated_conjecture,
    ( big_f(X1,esk1_2(X1,X2))
    | big_f(X2,esk1_2(X1,X2))
    | ~ big_f(X1,X2) ),
    inference(spm,[status(thm)],[12,14,theory(equality)]) ).

cnf(22,negated_conjecture,
    ( ~ big_g(X1,X2)
    | ~ big_f(X1,X2) ),
    inference(spm,[status(thm)],[17,19,theory(equality)]) ).

cnf(23,negated_conjecture,
    ( big_g(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(spm,[status(thm)],[22,7,theory(equality)]) ).

cnf(29,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[20,19,theory(equality)]) ).

cnf(34,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[13,29,theory(equality)]) ).

cnf(36,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(csr,[status(thm)],[34,23]) ).

cnf(37,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(spm,[status(thm)],[12,36,theory(equality)]) ).

cnf(38,negated_conjecture,
    ( ~ big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(spm,[status(thm)],[22,36,theory(equality)]) ).

cnf(41,negated_conjecture,
    ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)),
    inference(csr,[status(thm)],[38,37]) ).

cnf(43,negated_conjecture,
    big_f(X1,X2),
    inference(sr,[status(thm)],[10,41,theory(equality)]) ).

cnf(44,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[41,43,theory(equality)]) ).

cnf(45,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[44,theory(equality)]) ).

cnf(46,negated_conjecture,
    $false,
    45,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN334+1.p
% --creating new selector for []
% -running prover on /tmp/tmpKloW5A/sel_SYN334+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN334+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN334+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN334+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------