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

% Computer : art02.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:15 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(11,axiom,
    ! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
    file('/tmp/tmpeKLvz_/sel_SWV395+1.p_1',ax22) ).

fof(24,conjecture,
    ! [X1,X2,X3,X4] :
      ( ( pair_in_list(create_slb,X3,X4)
        & strictly_less_than(X3,X4)
        & ok(remove_cpq(triple(X1,create_slb,X2),X3)) )
     => pair_in_list(remove_slb(create_slb,X3),X3,X4) ),
    file('/tmp/tmpeKLvz_/sel_SWV395+1.p_1',l31_co) ).

fof(25,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ( pair_in_list(create_slb,X3,X4)
          & strictly_less_than(X3,X4)
          & ok(remove_cpq(triple(X1,create_slb,X2),X3)) )
       => pair_in_list(remove_slb(create_slb,X3),X3,X4) ),
    inference(assume_negation,[status(cth)],[24]) ).

fof(29,plain,
    ! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
    inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).

fof(66,plain,
    ! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
    inference(variable_rename,[status(thm)],[29]) ).

cnf(67,plain,
    ~ pair_in_list(create_slb,X1,X2),
    inference(split_conjunct,[status(thm)],[66]) ).

fof(106,negated_conjecture,
    ? [X1,X2,X3,X4] :
      ( pair_in_list(create_slb,X3,X4)
      & strictly_less_than(X3,X4)
      & ok(remove_cpq(triple(X1,create_slb,X2),X3))
      & ~ pair_in_list(remove_slb(create_slb,X3),X3,X4) ),
    inference(fof_nnf,[status(thm)],[25]) ).

fof(107,negated_conjecture,
    ? [X5,X6,X7,X8] :
      ( pair_in_list(create_slb,X7,X8)
      & strictly_less_than(X7,X8)
      & ok(remove_cpq(triple(X5,create_slb,X6),X7))
      & ~ pair_in_list(remove_slb(create_slb,X7),X7,X8) ),
    inference(variable_rename,[status(thm)],[106]) ).

fof(108,negated_conjecture,
    ( pair_in_list(create_slb,esk3_0,esk4_0)
    & strictly_less_than(esk3_0,esk4_0)
    & ok(remove_cpq(triple(esk1_0,create_slb,esk2_0),esk3_0))
    & ~ pair_in_list(remove_slb(create_slb,esk3_0),esk3_0,esk4_0) ),
    inference(skolemize,[status(esa)],[107]) ).

cnf(112,negated_conjecture,
    pair_in_list(create_slb,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[108]) ).

cnf(113,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[112,67,theory(equality)]) ).

cnf(114,negated_conjecture,
    $false,
    113,
    [proof] ).

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