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

% Computer : art07.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 12:40:34 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
    file('/tmp/tmppWrDXw/sel_SWV414+1.p_1',ax54) ).

fof(6,conjecture,
    ! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
    file('/tmp/tmppWrDXw/sel_SWV414+1.p_1',co1) ).

fof(7,negated_conjecture,
    ~ ! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
    inference(assume_negation,[status(cth)],[6]) ).

fof(17,plain,
    ! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
    inference(variable_rename,[status(thm)],[3]) ).

cnf(18,plain,
    i(triple(X1,create_slb,X2)) = create_pq,
    inference(split_conjunct,[status(thm)],[17]) ).

fof(23,negated_conjecture,
    ? [X1] : i(triple(create_pqp,create_slb,X1)) != create_pq,
    inference(fof_nnf,[status(thm)],[7]) ).

fof(24,negated_conjecture,
    ? [X2] : i(triple(create_pqp,create_slb,X2)) != create_pq,
    inference(variable_rename,[status(thm)],[23]) ).

fof(25,negated_conjecture,
    i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
    inference(skolemize,[status(esa)],[24]) ).

cnf(26,negated_conjecture,
    i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
    inference(split_conjunct,[status(thm)],[25]) ).

cnf(27,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[26,18,theory(equality)]) ).

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

cnf(29,negated_conjecture,
    $false,
    28,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV414+1.p
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% -running prover on /tmp/tmppWrDXw/sel_SWV414+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV414+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV414+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV414+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
% 
%------------------------------------------------------------------------------