TSTP Solution File: SWC217+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC217+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 10:52:44 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 16 unt; 0 def)
% Number of atoms : 189 ( 61 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 223 ( 79 ~; 70 |; 54 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 33 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmp_d5Q4D/sel_SWC217+1.p_1',ax21) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmp_d5Q4D/sel_SWC217+1.p_1',ax15) ).
fof(17,axiom,
ssList(nil),
file('/tmp/tmp_d5Q4D/sel_SWC217+1.p_1',ax17) ).
fof(23,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmp_d5Q4D/sel_SWC217+1.p_1',co1) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(60,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(61,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[61]) ).
cnf(63,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(95,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(96,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[95]) ).
fof(97,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[96]) ).
fof(98,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[97]) ).
cnf(99,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(105,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[17]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ~ neq(X1,nil)
& ( nil = X3
| nil != X4 )
& ( ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X3
& memberP(X4,X5) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(134,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& neq(X7,nil)
& ~ neq(X6,nil)
& ( nil = X8
| nil != X9 )
& ( ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X8
& memberP(X9,X10) )
| ~ neq(X9,nil) ) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ~ neq(esk7_0,nil)
& ( nil = esk9_0
| nil != esk10_0 )
& ( ( ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ~ neq(esk10_0,nil) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ~ neq(esk7_0,nil)
& ( nil = esk9_0
| nil != esk10_0 )
& ( ssItem(esk11_0)
| ~ neq(esk10_0,nil) )
& ( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) )
& ( memberP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) ) ),
inference(distribute,[status(thm)],[135]) ).
cnf(138,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(139,negated_conjecture,
( ssItem(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(141,negated_conjecture,
~ neq(esk7_0,nil),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
neq(esk8_0,nil),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(143,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[136]) ).
cnf(144,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[136]) ).
cnf(148,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(149,negated_conjecture,
ssList(esk9_0),
inference(rw,[status(thm)],[148,143,theory(equality)]) ).
cnf(151,negated_conjecture,
neq(esk10_0,nil),
inference(rw,[status(thm)],[142,144,theory(equality)]) ).
cnf(152,negated_conjecture,
~ neq(esk9_0,nil),
inference(rw,[status(thm)],[141,143,theory(equality)]) ).
cnf(153,negated_conjecture,
( ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[139,151,theory(equality)]) ).
cnf(154,negated_conjecture,
ssItem(esk11_0),
inference(cn,[status(thm)],[153,theory(equality)]) ).
cnf(157,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| $false ),
inference(rw,[status(thm)],[138,151,theory(equality)]) ).
cnf(158,negated_conjecture,
cons(esk11_0,nil) = esk9_0,
inference(cn,[status(thm)],[157,theory(equality)]) ).
cnf(163,negated_conjecture,
( esk9_0 = nil
| ~ ssList(nil)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[152,99,theory(equality)]) ).
cnf(164,negated_conjecture,
( esk9_0 = nil
| $false
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[163,105,theory(equality)]) ).
cnf(165,negated_conjecture,
( esk9_0 = nil
| ~ ssList(esk9_0) ),
inference(cn,[status(thm)],[164,theory(equality)]) ).
cnf(335,negated_conjecture,
( esk9_0 = nil
| $false ),
inference(rw,[status(thm)],[165,149,theory(equality)]) ).
cnf(336,negated_conjecture,
esk9_0 = nil,
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(339,negated_conjecture,
cons(esk11_0,nil) = nil,
inference(rw,[status(thm)],[158,336,theory(equality)]) ).
cnf(353,negated_conjecture,
( ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[63,339,theory(equality)]) ).
cnf(366,negated_conjecture,
( $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[353,154,theory(equality)]) ).
cnf(367,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[366,105,theory(equality)]) ).
cnf(368,negated_conjecture,
$false,
inference(cn,[status(thm)],[367,theory(equality)]) ).
cnf(369,negated_conjecture,
$false,
368,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC217+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp_d5Q4D/sel_SWC217+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC217+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC217+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC217+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
%
%------------------------------------------------------------------------------