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

% Computer : art04.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 11:48:28 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    a_holds(key(generate_key(an_a_nonce),b)),
    file('/tmp/tmppa8O2M/sel_SWV011+1.p_1',ax3) ).

fof(3,axiom,
    b_holds(key(generate_key(an_a_nonce),a)),
    file('/tmp/tmppa8O2M/sel_SWV011+1.p_1',ax1) ).

fof(17,conjecture,
    ? [X1] :
      ( a_holds(key(X1,b))
      & b_holds(key(X1,a)) ),
    file('/tmp/tmppa8O2M/sel_SWV011+1.p_1',co1) ).

fof(18,negated_conjecture,
    ~ ? [X1] :
        ( a_holds(key(X1,b))
        & b_holds(key(X1,a)) ),
    inference(assume_negation,[status(cth)],[17]) ).

cnf(20,plain,
    a_holds(key(generate_key(an_a_nonce),b)),
    inference(split_conjunct,[status(thm)],[2]) ).

cnf(21,plain,
    b_holds(key(generate_key(an_a_nonce),a)),
    inference(split_conjunct,[status(thm)],[3]) ).

fof(35,negated_conjecture,
    ! [X1] :
      ( ~ a_holds(key(X1,b))
      | ~ b_holds(key(X1,a)) ),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(36,negated_conjecture,
    ! [X2] :
      ( ~ a_holds(key(X2,b))
      | ~ b_holds(key(X2,a)) ),
    inference(variable_rename,[status(thm)],[35]) ).

cnf(37,negated_conjecture,
    ( ~ b_holds(key(X1,a))
    | ~ a_holds(key(X1,b)) ),
    inference(split_conjunct,[status(thm)],[36]) ).

cnf(38,negated_conjecture,
    ~ a_holds(key(generate_key(an_a_nonce),b)),
    inference(spm,[status(thm)],[37,21,theory(equality)]) ).

cnf(39,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[38,20,theory(equality)]) ).

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

cnf(41,negated_conjecture,
    $false,
    40,
    [proof] ).

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