%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : LCL181+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 : Sat Dec 25 17:23:18 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ~ p
     => q )
  <=> ( ~ q
     => p ) ),
    file('/tmp/tmp6DxB_4/sel_LCL181+1.p_1',pel4) ).

fof(2,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(4,negated_conjecture,
    ( ( ( ~ p
        & ~ q )
      | ( ~ q
        & ~ p ) )
    & ( p
      | q
      | q
      | p ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ( ~ q
      | ~ p )
    & ( ~ p
      | ~ p )
    & ( ~ q
      | ~ q )
    & ( ~ p
      | ~ q )
    & ( p
      | q
      | q
      | p ) ),
    inference(distribute,[status(thm)],[4]) ).

cnf(6,negated_conjecture,
    ( p
    | q
    | q
    | p ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    ( ~ q
    | ~ q ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(9,negated_conjecture,
    ( ~ p
    | ~ p ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(11,negated_conjecture,
    q,
    inference(sr,[status(thm)],[6,9,theory(equality)]) ).

cnf(12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[11,8,theory(equality)]) ).

cnf(13,negated_conjecture,
    $false,
    12,
    [proof] ).

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