%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : CSR004+2 : TPTP v5.0.0. Bugfixed v3.1.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 : Sat Dec 25 05:52:00 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] :
      ( happens(X1,X2)
    <=> ( ( X1 = tapOn
          & X2 = n0 )
        | ( holdsAt(waterLevel(n3),X2)
          & holdsAt(filling,X2)
          & X1 = overflow ) ) ),
    file('/tmp/tmpGN-zXg/sel_CSR004+2.p_1',happens_all_defn) ).

fof(26,conjecture,
    happens(overflow,n3),
    file('/tmp/tmpGN-zXg/sel_CSR004+2.p_1',overflow_3) ).

fof(27,axiom,
    holdsAt(waterLevel(n3),n3),
    file('/tmp/tmpGN-zXg/sel_CSR004+2.p_1',waterLevel_3) ).

fof(37,axiom,
    holdsAt(filling,n3),
    file('/tmp/tmpGN-zXg/sel_CSR004+2.p_1',filling_3) ).

fof(50,negated_conjecture,
    ~ happens(overflow,n3),
    inference(assume_negation,[status(cth)],[26]) ).

fof(55,negated_conjecture,
    ~ happens(overflow,n3),
    inference(fof_simplification,[status(thm)],[50,theory(equality)]) ).

fof(64,plain,
    ! [X1,X2] :
      ( ( ~ happens(X1,X2)
        | ( X1 = tapOn
          & X2 = n0 )
        | ( holdsAt(waterLevel(n3),X2)
          & holdsAt(filling,X2)
          & X1 = overflow ) )
      & ( ( ( X1 != tapOn
            | X2 != n0 )
          & ( ~ holdsAt(waterLevel(n3),X2)
            | ~ holdsAt(filling,X2)
            | X1 != overflow ) )
        | happens(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(65,plain,
    ! [X3,X4] :
      ( ( ~ happens(X3,X4)
        | ( X3 = tapOn
          & X4 = n0 )
        | ( holdsAt(waterLevel(n3),X4)
          & holdsAt(filling,X4)
          & X3 = overflow ) )
      & ( ( ( X3 != tapOn
            | X4 != n0 )
          & ( ~ holdsAt(waterLevel(n3),X4)
            | ~ holdsAt(filling,X4)
            | X3 != overflow ) )
        | happens(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[64]) ).

fof(66,plain,
    ! [X3,X4] :
      ( ( holdsAt(waterLevel(n3),X4)
        | X3 = tapOn
        | ~ happens(X3,X4) )
      & ( holdsAt(filling,X4)
        | X3 = tapOn
        | ~ happens(X3,X4) )
      & ( X3 = overflow
        | X3 = tapOn
        | ~ happens(X3,X4) )
      & ( holdsAt(waterLevel(n3),X4)
        | X4 = n0
        | ~ happens(X3,X4) )
      & ( holdsAt(filling,X4)
        | X4 = n0
        | ~ happens(X3,X4) )
      & ( X3 = overflow
        | X4 = n0
        | ~ happens(X3,X4) )
      & ( X3 != tapOn
        | X4 != n0
        | happens(X3,X4) )
      & ( ~ holdsAt(waterLevel(n3),X4)
        | ~ holdsAt(filling,X4)
        | X3 != overflow
        | happens(X3,X4) ) ),
    inference(distribute,[status(thm)],[65]) ).

cnf(67,plain,
    ( happens(X1,X2)
    | X1 != overflow
    | ~ holdsAt(filling,X2)
    | ~ holdsAt(waterLevel(n3),X2) ),
    inference(split_conjunct,[status(thm)],[66]) ).

cnf(140,negated_conjecture,
    ~ happens(overflow,n3),
    inference(split_conjunct,[status(thm)],[55]) ).

cnf(141,plain,
    holdsAt(waterLevel(n3),n3),
    inference(split_conjunct,[status(thm)],[27]) ).

cnf(158,plain,
    holdsAt(filling,n3),
    inference(split_conjunct,[status(thm)],[37]) ).

cnf(324,negated_conjecture,
    ( ~ holdsAt(waterLevel(n3),n3)
    | ~ holdsAt(filling,n3) ),
    inference(spm,[status(thm)],[140,67,theory(equality)]) ).

cnf(331,negated_conjecture,
    ( $false
    | ~ holdsAt(filling,n3) ),
    inference(rw,[status(thm)],[324,141,theory(equality)]) ).

cnf(332,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[331,158,theory(equality)]) ).

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

cnf(334,negated_conjecture,
    $false,
    333,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR004+2.p
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% -running prover on /tmp/tmpGN-zXg/sel_CSR004+2.p_1 with time limit 29
% -prover status Theorem
% Problem CSR004+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR004+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR004+2.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
% 
%------------------------------------------------------------------------------