%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV397+1 : TPTP v5.0.0. Released v3.3.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 : Sun Dec 26 12:37:42 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(13,axiom,
    ! [X1,X2,X3,X4] :
      ( ~ contains_slb(X2,X4)
     => remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
    file('/tmp/tmpTebCA6/sel_SWV397+1.p_1',ax43) ).

fof(16,axiom,
    ! [X1,X2] :
      ( ok(triple(X1,X2,bad))
    <=> ~ $true ),
    file('/tmp/tmpTebCA6/sel_SWV397+1.p_1',ax40) ).

fof(20,conjecture,
    ! [X1,X2,X3,X4] :
      ( ok(remove_cpq(triple(X1,X2,X3),X4))
     => contains_slb(X2,X4) ),
    file('/tmp/tmpTebCA6/sel_SWV397+1.p_1',l33_co) ).

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

fof(23,plain,
    ! [X1,X2,X3,X4] :
      ( ~ contains_slb(X2,X4)
     => remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
    inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).

fof(61,plain,
    ! [X1,X2,X3,X4] :
      ( contains_slb(X2,X4)
      | remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
    inference(fof_nnf,[status(thm)],[23]) ).

fof(62,plain,
    ! [X5,X6,X7,X8] :
      ( contains_slb(X6,X8)
      | remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
    inference(variable_rename,[status(thm)],[61]) ).

cnf(63,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
    | contains_slb(X2,X4) ),
    inference(split_conjunct,[status(thm)],[62]) ).

fof(70,plain,
    ! [X1,X2] :
      ( ( ~ ok(triple(X1,X2,bad))
        | ~ $true )
      & ( $true
        | ok(triple(X1,X2,bad)) ) ),
    inference(fof_nnf,[status(thm)],[16]) ).

fof(71,plain,
    ! [X3,X4] :
      ( ( ~ ok(triple(X3,X4,bad))
        | ~ $true )
      & ( $true
        | ok(triple(X3,X4,bad)) ) ),
    inference(variable_rename,[status(thm)],[70]) ).

cnf(73,plain,
    ( $false
    | ~ ok(triple(X1,X2,bad)) ),
    inference(split_conjunct,[status(thm)],[71]) ).

fof(87,negated_conjecture,
    ? [X1,X2,X3,X4] :
      ( ok(remove_cpq(triple(X1,X2,X3),X4))
      & ~ contains_slb(X2,X4) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(88,negated_conjecture,
    ? [X5,X6,X7,X8] :
      ( ok(remove_cpq(triple(X5,X6,X7),X8))
      & ~ contains_slb(X6,X8) ),
    inference(variable_rename,[status(thm)],[87]) ).

fof(89,negated_conjecture,
    ( ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
    & ~ contains_slb(esk2_0,esk4_0) ),
    inference(skolemize,[status(esa)],[88]) ).

cnf(90,negated_conjecture,
    ~ contains_slb(esk2_0,esk4_0),
    inference(split_conjunct,[status(thm)],[89]) ).

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

cnf(106,negated_conjecture,
    ( ok(triple(esk1_0,esk2_0,bad))
    | contains_slb(esk2_0,esk4_0) ),
    inference(spm,[status(thm)],[91,63,theory(equality)]) ).

cnf(107,negated_conjecture,
    contains_slb(esk2_0,esk4_0),
    inference(sr,[status(thm)],[106,73,theory(equality)]) ).

cnf(108,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[107,90,theory(equality)]) ).

cnf(109,negated_conjecture,
    $false,
    108,
    [proof] ).

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