%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV387+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:26 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(20,axiom,
    ! [X1,X2,X3,X4] :
      ( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
        & ok(remove_cpq(triple(X1,X2,X3),X4)) )
     => check_cpq(triple(X1,X2,X3)) ),
    file('/tmp/tmpZzmZ8X/sel_SWV387+1.p_1',l23_l027) ).

fof(21,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] :
          ( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
          | ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
    file('/tmp/tmpZzmZ8X/sel_SWV387+1.p_1',l23_co) ).

fof(22,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4] :
            ( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
            | ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(assume_negation,[status(cth)],[21]) ).

fof(27,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4] :
            ( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
            | ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).

fof(89,plain,
    ! [X1,X2,X3,X4] :
      ( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
      | ~ ok(remove_cpq(triple(X1,X2,X3),X4))
      | check_cpq(triple(X1,X2,X3)) ),
    inference(fof_nnf,[status(thm)],[20]) ).

fof(90,plain,
    ! [X5,X6,X7,X8] :
      ( ~ check_cpq(remove_cpq(triple(X5,X6,X7),X8))
      | ~ ok(remove_cpq(triple(X5,X6,X7),X8))
      | check_cpq(triple(X5,X6,X7)) ),
    inference(variable_rename,[status(thm)],[89]) ).

cnf(91,plain,
    ( check_cpq(triple(X1,X2,X3))
    | ~ ok(remove_cpq(triple(X1,X2,X3),X4))
    | ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4)) ),
    inference(split_conjunct,[status(thm)],[90]) ).

fof(92,negated_conjecture,
    ? [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
      & ? [X4] :
          ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
          & ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(fof_nnf,[status(thm)],[27]) ).

fof(93,negated_conjecture,
    ? [X5,X6,X7] :
      ( ~ check_cpq(triple(X5,X6,X7))
      & ? [X8] :
          ( check_cpq(remove_cpq(triple(X5,X6,X7),X8))
          & ok(remove_cpq(triple(X5,X6,X7),X8)) ) ),
    inference(variable_rename,[status(thm)],[92]) ).

fof(94,negated_conjecture,
    ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
    & check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
    & ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
    inference(skolemize,[status(esa)],[93]) ).

cnf(95,negated_conjecture,
    ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(96,negated_conjecture,
    check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[94]) ).

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

cnf(115,negated_conjecture,
    ( check_cpq(triple(esk1_0,esk2_0,esk3_0))
    | ~ check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
    inference(spm,[status(thm)],[91,95,theory(equality)]) ).

cnf(117,negated_conjecture,
    ( check_cpq(triple(esk1_0,esk2_0,esk3_0))
    | $false ),
    inference(rw,[status(thm)],[115,96,theory(equality)]) ).

cnf(118,negated_conjecture,
    check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(cn,[status(thm)],[117,theory(equality)]) ).

cnf(119,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[118,97,theory(equality)]) ).

cnf(120,negated_conjecture,
    $false,
    119,
    [proof] ).

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