%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN392+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:19:18 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :  108 (   0 equ)
%            Maximal formula atoms :   48 (   6 avg)
%            Number of connectives :  141 (  49   ~;  66   |;  20   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   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,
    ( ( p1
    <=> p2 )
  <=> ( ( p2
        | ~ p1 )
      & ( ~ p2
        | p1 ) ) ),
    file('/tmp/tmpaW_p6d/sel_SYN392+1.p_1',pel14) ).

fof(2,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

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

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

cnf(6,negated_conjecture,
    ( p1
    | p1
    | ~ p2
    | ~ p2 ),
    inference(split_conjunct,[status(thm)],[5]) ).

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

cnf(11,negated_conjecture,
    ( p2
    | p1
    | p1
    | p2 ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(16,negated_conjecture,
    ( ~ p2
    | ~ p1
    | ~ p2
    | ~ p1 ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(18,negated_conjecture,
    p1,
    inference(csr,[status(thm)],[6,11]) ).

cnf(20,negated_conjecture,
    ( p2
    | $false ),
    inference(rw,[status(thm)],[9,18,theory(equality)]) ).

cnf(21,negated_conjecture,
    p2,
    inference(cn,[status(thm)],[20,theory(equality)]) ).

cnf(22,negated_conjecture,
    ( $false
    | ~ p2 ),
    inference(rw,[status(thm)],[16,18,theory(equality)]) ).

cnf(23,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[22,21,theory(equality)]) ).

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

cnf(25,negated_conjecture,
    $false,
    24,
    [proof] ).

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