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

% Result   : Theorem 239.88s
% Output   : CNFRefutation 239.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  25 unt;   0 def)
%            Number of atoms       :  110 (  43 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  117 (  53   ~;  42   |;  19   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-3 aty)
%            Number of variables   :   67 (   3 sgn  41   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X4] : filling != waterLevel(X4),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',filling_not_waterLevel) ).

fof(6,axiom,
    ! [X3,X2] :
      ( ( ~ releasedAt(X3,X2)
        & ~ ? [X1] :
              ( happens(X1,X2)
              & releases(X1,X3,X2) ) )
     => ~ releasedAt(X3,plus(X2,n1)) ),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',keep_not_released) ).

fof(18,axiom,
    ! [X1,X3,X2] :
      ( releases(X1,X3,X2)
    <=> ? [X10] :
          ( X1 = tapOn
          & X3 = waterLevel(X10) ) ),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',releases_all_defn) ).

fof(27,axiom,
    plus(n1,n2) = n3,
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',plus1_2) ).

fof(28,axiom,
    plus(n1,n1) = n2,
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',plus1_1) ).

fof(29,conjecture,
    ~ releasedAt(filling,n3),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',filling_3_l1) ).

fof(33,axiom,
    plus(n0,n1) = n1,
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',plus0_1) ).

fof(41,axiom,
    ~ releasedAt(filling,n0),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',not_released_filling_0) ).

fof(42,axiom,
    ! [X4,X9] : plus(X4,X9) = plus(X9,X4),
    file('/tmp/tmpdKPeG_/sel_CSR014+1.p_5',symmetry_of_plus) ).

fof(56,negated_conjecture,
    ~ ~ releasedAt(filling,n3),
    inference(assume_negation,[status(cth)],[29]) ).

fof(58,plain,
    ! [X3,X2] :
      ( ( ~ releasedAt(X3,X2)
        & ~ ? [X1] :
              ( happens(X1,X2)
              & releases(X1,X3,X2) ) )
     => ~ releasedAt(X3,plus(X2,n1)) ),
    inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).

fof(64,negated_conjecture,
    releasedAt(filling,n3),
    inference(fof_simplification,[status(thm)],[56,theory(equality)]) ).

fof(68,plain,
    ~ releasedAt(filling,n0),
    inference(fof_simplification,[status(thm)],[41,theory(equality)]) ).

fof(77,plain,
    ! [X5] : filling != waterLevel(X5),
    inference(variable_rename,[status(thm)],[3]) ).

cnf(78,plain,
    filling != waterLevel(X1),
    inference(split_conjunct,[status(thm)],[77]) ).

fof(84,plain,
    ! [X3,X2] :
      ( releasedAt(X3,X2)
      | ? [X1] :
          ( happens(X1,X2)
          & releases(X1,X3,X2) )
      | ~ releasedAt(X3,plus(X2,n1)) ),
    inference(fof_nnf,[status(thm)],[58]) ).

fof(85,plain,
    ! [X4,X5] :
      ( releasedAt(X4,X5)
      | ? [X6] :
          ( happens(X6,X5)
          & releases(X6,X4,X5) )
      | ~ releasedAt(X4,plus(X5,n1)) ),
    inference(variable_rename,[status(thm)],[84]) ).

fof(86,plain,
    ! [X4,X5] :
      ( releasedAt(X4,X5)
      | ( happens(esk1_2(X4,X5),X5)
        & releases(esk1_2(X4,X5),X4,X5) )
      | ~ releasedAt(X4,plus(X5,n1)) ),
    inference(skolemize,[status(esa)],[85]) ).

fof(87,plain,
    ! [X4,X5] :
      ( ( happens(esk1_2(X4,X5),X5)
        | releasedAt(X4,X5)
        | ~ releasedAt(X4,plus(X5,n1)) )
      & ( releases(esk1_2(X4,X5),X4,X5)
        | releasedAt(X4,X5)
        | ~ releasedAt(X4,plus(X5,n1)) ) ),
    inference(distribute,[status(thm)],[86]) ).

cnf(88,plain,
    ( releasedAt(X1,X2)
    | releases(esk1_2(X1,X2),X1,X2)
    | ~ releasedAt(X1,plus(X2,n1)) ),
    inference(split_conjunct,[status(thm)],[87]) ).

fof(152,plain,
    ! [X1,X3,X2] :
      ( ( ~ releases(X1,X3,X2)
        | ? [X10] :
            ( X1 = tapOn
            & X3 = waterLevel(X10) ) )
      & ( ! [X10] :
            ( X1 != tapOn
            | X3 != waterLevel(X10) )
        | releases(X1,X3,X2) ) ),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(153,plain,
    ! [X11,X12,X13] :
      ( ( ~ releases(X11,X12,X13)
        | ? [X14] :
            ( X11 = tapOn
            & X12 = waterLevel(X14) ) )
      & ( ! [X15] :
            ( X11 != tapOn
            | X12 != waterLevel(X15) )
        | releases(X11,X12,X13) ) ),
    inference(variable_rename,[status(thm)],[152]) ).

fof(154,plain,
    ! [X11,X12,X13] :
      ( ( ~ releases(X11,X12,X13)
        | ( X11 = tapOn
          & X12 = waterLevel(esk7_3(X11,X12,X13)) ) )
      & ( ! [X15] :
            ( X11 != tapOn
            | X12 != waterLevel(X15) )
        | releases(X11,X12,X13) ) ),
    inference(skolemize,[status(esa)],[153]) ).

fof(155,plain,
    ! [X11,X12,X13,X15] :
      ( ( X11 != tapOn
        | X12 != waterLevel(X15)
        | releases(X11,X12,X13) )
      & ( ~ releases(X11,X12,X13)
        | ( X11 = tapOn
          & X12 = waterLevel(esk7_3(X11,X12,X13)) ) ) ),
    inference(shift_quantors,[status(thm)],[154]) ).

fof(156,plain,
    ! [X11,X12,X13,X15] :
      ( ( X11 != tapOn
        | X12 != waterLevel(X15)
        | releases(X11,X12,X13) )
      & ( X11 = tapOn
        | ~ releases(X11,X12,X13) )
      & ( X12 = waterLevel(esk7_3(X11,X12,X13))
        | ~ releases(X11,X12,X13) ) ),
    inference(distribute,[status(thm)],[155]) ).

cnf(157,plain,
    ( X2 = waterLevel(esk7_3(X1,X2,X3))
    | ~ releases(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[156]) ).

cnf(188,plain,
    plus(n1,n2) = n3,
    inference(split_conjunct,[status(thm)],[27]) ).

cnf(189,plain,
    plus(n1,n1) = n2,
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(190,negated_conjecture,
    releasedAt(filling,n3),
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(194,plain,
    plus(n0,n1) = n1,
    inference(split_conjunct,[status(thm)],[33]) ).

cnf(207,plain,
    ~ releasedAt(filling,n0),
    inference(split_conjunct,[status(thm)],[68]) ).

fof(208,plain,
    ! [X10,X11] : plus(X10,X11) = plus(X11,X10),
    inference(variable_rename,[status(thm)],[42]) ).

cnf(209,plain,
    plus(X1,X2) = plus(X2,X1),
    inference(split_conjunct,[status(thm)],[208]) ).

cnf(317,plain,
    plus(n1,n0) = n1,
    inference(rw,[status(thm)],[194,209,theory(equality)]) ).

cnf(368,plain,
    ( X2 != filling
    | ~ releases(X1,X2,X3) ),
    inference(spm,[status(thm)],[78,157,theory(equality)]) ).

cnf(702,plain,
    ( releasedAt(X1,X2)
    | X1 != filling
    | ~ releasedAt(X1,plus(X2,n1)) ),
    inference(spm,[status(thm)],[368,88,theory(equality)]) ).

cnf(1877,plain,
    ( releasedAt(X1,n1)
    | X1 != filling
    | ~ releasedAt(X1,n2) ),
    inference(spm,[status(thm)],[702,189,theory(equality)]) ).

cnf(1878,plain,
    ( releasedAt(X1,X2)
    | X1 != filling
    | ~ releasedAt(X1,plus(n1,X2)) ),
    inference(spm,[status(thm)],[702,209,theory(equality)]) ).

cnf(1946,plain,
    ( releasedAt(X1,n2)
    | X1 != filling
    | ~ releasedAt(X1,n3) ),
    inference(spm,[status(thm)],[1878,188,theory(equality)]) ).

cnf(1948,plain,
    ( releasedAt(X1,n0)
    | X1 != filling
    | ~ releasedAt(X1,n1) ),
    inference(spm,[status(thm)],[1878,317,theory(equality)]) ).

cnf(1954,plain,
    ( releasedAt(X1,n1)
    | X1 != filling
    | ~ releasedAt(X1,n3) ),
    inference(spm,[status(thm)],[1877,1946,theory(equality)]) ).

cnf(1955,negated_conjecture,
    releasedAt(filling,n1),
    inference(spm,[status(thm)],[1954,190,theory(equality)]) ).

cnf(1964,plain,
    ~ releasedAt(filling,n1),
    inference(spm,[status(thm)],[207,1948,theory(equality)]) ).

cnf(1967,plain,
    $false,
    inference(rw,[status(thm)],[1964,1955,theory(equality)]) ).

cnf(1968,plain,
    $false,
    inference(cn,[status(thm)],[1967,theory(equality)]) ).

cnf(1969,plain,
    $false,
    1968,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR014+1.p
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpdKPeG_/sel_CSR014+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpdKPeG_/sel_CSR014+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpdKPeG_/sel_CSR014+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpdKPeG_/sel_CSR014+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% -running prover on /tmp/tmpdKPeG_/sel_CSR014+1.p_5 with time limit 53
% -prover status Theorem
% Problem CSR014+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR014+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR014+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
% 
%------------------------------------------------------------------------------