TSTP Solution File: SWV370+1 by SInE---0.4

View Problem - Process Solution

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

% Computer : art05.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:27:31 EST 2010

% Result   : Theorem 0.22s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   52 (   9 unt;   0 def)
%            Number of atoms       :  159 (  27 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  170 (  63   ~;  72   |;  26   &)
%                                         (   7 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  137 (  15 sgn  80   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2,X3] :
      ( contains_pq(insert_pq(X1,X2),X3)
    <=> ( contains_pq(X1,X3)
        | X2 = X3 ) ),
    file('/tmp/tmp7RkKhv/sel_SWV370+1.p_1',ax9) ).

fof(4,axiom,
    ! [X1,X2,X3,X4] :
      ( contains_cpq(triple(X1,X2,X3),X4)
    <=> contains_slb(X2,X4) ),
    file('/tmp/tmp7RkKhv/sel_SWV370+1.p_1',ax39) ).

fof(5,axiom,
    ! [X1,X2,X3,X4] :
      ( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
    <=> ( contains_slb(X1,X3)
        | X2 = X3 ) ),
    file('/tmp/tmp7RkKhv/sel_SWV370+1.p_1',ax21) ).

fof(6,axiom,
    ! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
    file('/tmp/tmp7RkKhv/sel_SWV370+1.p_1',ax55) ).

fof(7,conjecture,
    ! [X1] :
      ( ! [X2,X3,X4] :
          ( contains_cpq(triple(X2,X1,X3),X4)
        <=> contains_pq(i(triple(X2,X1,X3)),X4) )
     => ! [X5,X6,X7,X8,X9] :
          ( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
        <=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
    file('/tmp/tmp7RkKhv/sel_SWV370+1.p_1',l6_co) ).

fof(8,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2,X3,X4] :
            ( contains_cpq(triple(X2,X1,X3),X4)
          <=> contains_pq(i(triple(X2,X1,X3)),X4) )
       => ! [X5,X6,X7,X8,X9] :
            ( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
          <=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
    inference(assume_negation,[status(cth)],[7]) ).

fof(10,plain,
    ! [X1,X2,X3] :
      ( ( ~ contains_pq(insert_pq(X1,X2),X3)
        | contains_pq(X1,X3)
        | X2 = X3 )
      & ( ( ~ contains_pq(X1,X3)
          & X2 != X3 )
        | contains_pq(insert_pq(X1,X2),X3) ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(11,plain,
    ! [X4,X5,X6] :
      ( ( ~ contains_pq(insert_pq(X4,X5),X6)
        | contains_pq(X4,X6)
        | X5 = X6 )
      & ( ( ~ contains_pq(X4,X6)
          & X5 != X6 )
        | contains_pq(insert_pq(X4,X5),X6) ) ),
    inference(variable_rename,[status(thm)],[10]) ).

fof(12,plain,
    ! [X4,X5,X6] :
      ( ( ~ contains_pq(insert_pq(X4,X5),X6)
        | contains_pq(X4,X6)
        | X5 = X6 )
      & ( ~ contains_pq(X4,X6)
        | contains_pq(insert_pq(X4,X5),X6) )
      & ( X5 != X6
        | contains_pq(insert_pq(X4,X5),X6) ) ),
    inference(distribute,[status(thm)],[11]) ).

cnf(13,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | X2 != X3 ),
    inference(split_conjunct,[status(thm)],[12]) ).

cnf(14,plain,
    ( contains_pq(insert_pq(X1,X2),X3)
    | ~ contains_pq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[12]) ).

cnf(15,plain,
    ( X1 = X2
    | contains_pq(X3,X2)
    | ~ contains_pq(insert_pq(X3,X1),X2) ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(20,plain,
    ! [X1,X2,X3,X4] :
      ( ( ~ contains_cpq(triple(X1,X2,X3),X4)
        | contains_slb(X2,X4) )
      & ( ~ contains_slb(X2,X4)
        | contains_cpq(triple(X1,X2,X3),X4) ) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(21,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ contains_cpq(triple(X5,X6,X7),X8)
        | contains_slb(X6,X8) )
      & ( ~ contains_slb(X6,X8)
        | contains_cpq(triple(X5,X6,X7),X8) ) ),
    inference(variable_rename,[status(thm)],[20]) ).

cnf(22,plain,
    ( contains_cpq(triple(X1,X2,X3),X4)
    | ~ contains_slb(X2,X4) ),
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(23,plain,
    ( contains_slb(X1,X2)
    | ~ contains_cpq(triple(X3,X1,X4),X2) ),
    inference(split_conjunct,[status(thm)],[21]) ).

fof(24,plain,
    ! [X1,X2,X3,X4] :
      ( ( ~ contains_slb(insert_slb(X1,pair(X2,X4)),X3)
        | contains_slb(X1,X3)
        | X2 = X3 )
      & ( ( ~ contains_slb(X1,X3)
          & X2 != X3 )
        | contains_slb(insert_slb(X1,pair(X2,X4)),X3) ) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(25,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
        | contains_slb(X5,X7)
        | X6 = X7 )
      & ( ( ~ contains_slb(X5,X7)
          & X6 != X7 )
        | contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
    inference(variable_rename,[status(thm)],[24]) ).

fof(26,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
        | contains_slb(X5,X7)
        | X6 = X7 )
      & ( ~ contains_slb(X5,X7)
        | contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
      & ( X6 != X7
        | contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
    inference(distribute,[status(thm)],[25]) ).

cnf(27,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | X2 != X4 ),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(28,plain,
    ( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
    | ~ contains_slb(X1,X4) ),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(29,plain,
    ( X1 = X2
    | contains_slb(X3,X2)
    | ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
    inference(split_conjunct,[status(thm)],[26]) ).

fof(30,plain,
    ! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
    inference(variable_rename,[status(thm)],[6]) ).

cnf(31,plain,
    i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
    inference(split_conjunct,[status(thm)],[30]) ).

fof(32,negated_conjecture,
    ? [X1] :
      ( ! [X2,X3,X4] :
          ( ( ~ contains_cpq(triple(X2,X1,X3),X4)
            | contains_pq(i(triple(X2,X1,X3)),X4) )
          & ( ~ contains_pq(i(triple(X2,X1,X3)),X4)
            | contains_cpq(triple(X2,X1,X3),X4) ) )
      & ? [X5,X6,X7,X8,X9] :
          ( ( ~ contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
            | ~ contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) )
          & ( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
            | contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(33,negated_conjecture,
    ? [X10] :
      ( ! [X11,X12,X13] :
          ( ( ~ contains_cpq(triple(X11,X10,X12),X13)
            | contains_pq(i(triple(X11,X10,X12)),X13) )
          & ( ~ contains_pq(i(triple(X11,X10,X12)),X13)
            | contains_cpq(triple(X11,X10,X12),X13) ) )
      & ? [X14,X15,X16,X17,X18] :
          ( ( ~ contains_cpq(triple(X14,insert_slb(X10,pair(X16,X17)),X15),X18)
            | ~ contains_pq(i(triple(X14,insert_slb(X10,pair(X16,X17)),X15)),X18) )
          & ( contains_cpq(triple(X14,insert_slb(X10,pair(X16,X17)),X15),X18)
            | contains_pq(i(triple(X14,insert_slb(X10,pair(X16,X17)),X15)),X18) ) ) ),
    inference(variable_rename,[status(thm)],[32]) ).

fof(34,negated_conjecture,
    ( ! [X11,X12,X13] :
        ( ( ~ contains_cpq(triple(X11,esk1_0,X12),X13)
          | contains_pq(i(triple(X11,esk1_0,X12)),X13) )
        & ( ~ contains_pq(i(triple(X11,esk1_0,X12)),X13)
          | contains_cpq(triple(X11,esk1_0,X12),X13) ) )
    & ( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
      | ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) )
    & ( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
      | contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ) ),
    inference(skolemize,[status(esa)],[33]) ).

fof(35,negated_conjecture,
    ! [X11,X12,X13] :
      ( ( ~ contains_cpq(triple(X11,esk1_0,X12),X13)
        | contains_pq(i(triple(X11,esk1_0,X12)),X13) )
      & ( ~ contains_pq(i(triple(X11,esk1_0,X12)),X13)
        | contains_cpq(triple(X11,esk1_0,X12),X13) )
      & ( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
        | ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) )
      & ( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
        | contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ) ),
    inference(shift_quantors,[status(thm)],[34]) ).

cnf(36,negated_conjecture,
    ( contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0)
    | contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0) ),
    inference(split_conjunct,[status(thm)],[35]) ).

cnf(37,negated_conjecture,
    ( ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0)
    | ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0) ),
    inference(split_conjunct,[status(thm)],[35]) ).

cnf(38,negated_conjecture,
    ( contains_cpq(triple(X1,esk1_0,X2),X3)
    | ~ contains_pq(i(triple(X1,esk1_0,X2)),X3) ),
    inference(split_conjunct,[status(thm)],[35]) ).

cnf(39,negated_conjecture,
    ( contains_pq(i(triple(X1,esk1_0,X2)),X3)
    | ~ contains_cpq(triple(X1,esk1_0,X2),X3) ),
    inference(split_conjunct,[status(thm)],[35]) ).

cnf(40,plain,
    contains_pq(insert_pq(X1,X2),X2),
    inference(er,[status(thm)],[13,theory(equality)]) ).

cnf(43,plain,
    contains_slb(insert_slb(X1,pair(X2,X3)),X2),
    inference(er,[status(thm)],[27,theory(equality)]) ).

cnf(54,negated_conjecture,
    ( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
    | contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
    inference(rw,[status(thm)],[36,31,theory(equality)]) ).

cnf(55,negated_conjecture,
    ( contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
    | contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
    inference(spm,[status(thm)],[23,54,theory(equality)]) ).

cnf(56,negated_conjecture,
    ( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
    | ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
    inference(rw,[status(thm)],[37,31,theory(equality)]) ).

cnf(57,negated_conjecture,
    ( ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0)
    | ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0) ),
    inference(spm,[status(thm)],[56,22,theory(equality)]) ).

cnf(93,negated_conjecture,
    ( ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
    | ~ contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
    inference(spm,[status(thm)],[57,14,theory(equality)]) ).

cnf(94,negated_conjecture,
    ( ~ contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0)
    | ~ contains_slb(esk1_0,esk6_0) ),
    inference(spm,[status(thm)],[93,28,theory(equality)]) ).

cnf(95,negated_conjecture,
    ( ~ contains_slb(esk1_0,esk6_0)
    | ~ contains_cpq(triple(esk2_0,esk1_0,esk3_0),esk6_0) ),
    inference(spm,[status(thm)],[94,39,theory(equality)]) ).

cnf(96,negated_conjecture,
    ~ contains_slb(esk1_0,esk6_0),
    inference(csr,[status(thm)],[95,22]) ).

cnf(97,negated_conjecture,
    ( esk4_0 = esk6_0
    | contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0)
    | contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0) ),
    inference(spm,[status(thm)],[15,55,theory(equality)]) ).

cnf(99,negated_conjecture,
    ( esk4_0 = esk6_0
    | contains_slb(esk1_0,esk6_0)
    | contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
    inference(spm,[status(thm)],[29,97,theory(equality)]) ).

cnf(101,negated_conjecture,
    ( esk6_0 = esk4_0
    | contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
    inference(sr,[status(thm)],[99,96,theory(equality)]) ).

cnf(102,negated_conjecture,
    ( contains_cpq(triple(esk2_0,esk1_0,esk3_0),esk6_0)
    | esk6_0 = esk4_0 ),
    inference(spm,[status(thm)],[38,101,theory(equality)]) ).

cnf(104,negated_conjecture,
    ( contains_slb(esk1_0,esk6_0)
    | esk6_0 = esk4_0 ),
    inference(spm,[status(thm)],[23,102,theory(equality)]) ).

cnf(105,negated_conjecture,
    esk6_0 = esk4_0,
    inference(sr,[status(thm)],[104,96,theory(equality)]) ).

cnf(119,negated_conjecture,
    ( $false
    | ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[57,105,theory(equality)]),43,theory(equality)]) ).

cnf(120,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[119,105,theory(equality)]),40,theory(equality)]) ).

cnf(121,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[120,theory(equality)]) ).

cnf(122,negated_conjecture,
    $false,
    121,
    [proof] ).

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