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

% Computer : art06.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 12:34:39 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(16,axiom,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
    file('/tmp/tmpWhxKC7/sel_SWV388+1.p_1',l24_l34) ).

fof(17,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
        | ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ) ),
    file('/tmp/tmpWhxKC7/sel_SWV388+1.p_1',l24_co) ).

fof(18,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
          | ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ) ),
    inference(assume_negation,[status(cth)],[17]) ).

fof(22,plain,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
    inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).

fof(23,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
          | ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ) ),
    inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).

fof(74,plain,
    ! [X1,X2,X3] :
      ( check_cpq(triple(X1,X2,X3))
      | ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
    inference(fof_nnf,[status(thm)],[22]) ).

fof(75,plain,
    ! [X4,X5,X6] :
      ( check_cpq(triple(X4,X5,X6))
      | ~ check_cpq(findmin_cpq_eff(triple(X4,X5,X6))) ),
    inference(variable_rename,[status(thm)],[74]) ).

cnf(76,plain,
    ( check_cpq(triple(X1,X2,X3))
    | ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
    inference(split_conjunct,[status(thm)],[75]) ).

fof(77,negated_conjecture,
    ? [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
      & check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
      & ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
    inference(fof_nnf,[status(thm)],[23]) ).

fof(78,negated_conjecture,
    ? [X4,X5,X6] :
      ( ~ check_cpq(triple(X4,X5,X6))
      & check_cpq(findmin_cpq_eff(triple(X4,X5,X6)))
      & ok(findmin_cpq_eff(triple(X4,X5,X6))) ),
    inference(variable_rename,[status(thm)],[77]) ).

fof(79,negated_conjecture,
    ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
    & check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
    & ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
    inference(skolemize,[status(esa)],[78]) ).

cnf(81,negated_conjecture,
    check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[79]) ).

cnf(82,negated_conjecture,
    ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[79]) ).

cnf(88,negated_conjecture,
    check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(spm,[status(thm)],[76,81,theory(equality)]) ).

cnf(89,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[88,82,theory(equality)]) ).

cnf(90,negated_conjecture,
    $false,
    89,
    [proof] ).

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