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

% Result   : Theorem 0.24s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   41 (  23   ~;   7   |;   6   &)
%                                         (   0 <=>;   5  =>;   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   :   44 (   1 sgn  32   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(21,axiom,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    file('/tmp/tmpqhWZQH/sel_SWV386+1.p_1',l22_l26) ).

fof(22,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] :
          ( ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4))
          | ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ) ),
    file('/tmp/tmpqhWZQH/sel_SWV386+1.p_1',l22_co) ).

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

fof(28,plain,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).

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

fof(94,plain,
    ! [X1,X2,X3] :
      ( check_cpq(triple(X1,X2,X3))
      | ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(95,plain,
    ! [X5,X6,X7] :
      ( check_cpq(triple(X5,X6,X7))
      | ! [X8] : ~ check_cpq(insert_cpq(triple(X5,X6,X7),X8)) ),
    inference(variable_rename,[status(thm)],[94]) ).

fof(96,plain,
    ! [X5,X6,X7,X8] :
      ( ~ check_cpq(insert_cpq(triple(X5,X6,X7),X8))
      | check_cpq(triple(X5,X6,X7)) ),
    inference(shift_quantors,[status(thm)],[95]) ).

cnf(97,plain,
    ( check_cpq(triple(X1,X2,X3))
    | ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(split_conjunct,[status(thm)],[96]) ).

fof(98,negated_conjecture,
    ? [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
      & ? [X4] :
          ( check_cpq(insert_cpq(triple(X1,X2,X3),X4))
          & ok(insert_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(fof_nnf,[status(thm)],[29]) ).

fof(99,negated_conjecture,
    ? [X5,X6,X7] :
      ( ~ check_cpq(triple(X5,X6,X7))
      & ? [X8] :
          ( check_cpq(insert_cpq(triple(X5,X6,X7),X8))
          & ok(insert_cpq(triple(X5,X6,X7),X8)) ) ),
    inference(variable_rename,[status(thm)],[98]) ).

fof(100,negated_conjecture,
    ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
    & check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
    & ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
    inference(skolemize,[status(esa)],[99]) ).

cnf(102,negated_conjecture,
    check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[100]) ).

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

cnf(109,negated_conjecture,
    check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(spm,[status(thm)],[97,102,theory(equality)]) ).

cnf(110,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[109,103,theory(equality)]) ).

cnf(111,negated_conjecture,
    $false,
    110,
    [proof] ).

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