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

% Computer : art02.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:20:38 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  20   ~;  13   |;   4   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   66 (  12 sgn  33   !;  21   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ! [X1,X2,X3] : f(X1,X2,X3)
  <=> ~ ? [X4,X5,X6] : ~ f(X4,X5,X6) ),
    file('/tmp/tmpwXDZaE/sel_SYN411+1.p_1',kalish250) ).

fof(2,negated_conjecture,
    ~ ( ! [X1,X2,X3] : f(X1,X2,X3)
    <=> ~ ? [X4,X5,X6] : ~ f(X4,X5,X6) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ( ! [X1,X2,X3] : f(X1,X2,X3)
    <=> ~ ? [X4,X5,X6] : ~ f(X4,X5,X6) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(4,negated_conjecture,
    ( ( ? [X1,X2,X3] : ~ f(X1,X2,X3)
      | ? [X4,X5,X6] : ~ f(X4,X5,X6) )
    & ( ! [X1,X2,X3] : f(X1,X2,X3)
      | ! [X4,X5,X6] : f(X4,X5,X6) ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ( ? [X7,X8,X9] : ~ f(X7,X8,X9)
      | ? [X10,X11,X12] : ~ f(X10,X11,X12) )
    & ( ! [X13,X14,X15] : f(X13,X14,X15)
      | ! [X16,X17,X18] : f(X16,X17,X18) ) ),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ( ( ~ f(esk1_0,esk2_0,esk3_0)
      | ~ f(esk4_0,esk5_0,esk6_0) )
    & ( ! [X13,X14,X15] : f(X13,X14,X15)
      | ! [X16,X17,X18] : f(X16,X17,X18) ) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X13,X14,X15,X16,X17,X18] :
      ( ( f(X16,X17,X18)
        | f(X13,X14,X15) )
      & ( ~ f(esk1_0,esk2_0,esk3_0)
        | ~ f(esk4_0,esk5_0,esk6_0) ) ),
    inference(shift_quantors,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( ~ f(esk4_0,esk5_0,esk6_0)
    | ~ f(esk1_0,esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    ( f(X1,X2,X3)
    | f(X4,X5,X6) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(12,negated_conjecture,
    ( f(X1,X2,X3)
    | ~ f(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[8,9,theory(equality)]) ).

cnf(14,negated_conjecture,
    f(X1,X2,X3),
    inference(csr,[status(thm)],[12,9]) ).

cnf(15,negated_conjecture,
    ( $false
    | ~ f(esk4_0,esk5_0,esk6_0) ),
    inference(rw,[status(thm)],[8,14,theory(equality)]) ).

cnf(16,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[15,14,theory(equality)]) ).

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

cnf(18,negated_conjecture,
    $false,
    17,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN411+1.p
% --creating new selector for []
% -running prover on /tmp/tmpwXDZaE/sel_SYN411+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN411+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN411+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN411+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
% 
%------------------------------------------------------------------------------