TSTP Solution File: SWC256+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC256+1 : TPTP v5.0.0. Released v2.4.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 11:06:17 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 57 ( 17 unt; 0 def)
% Number of atoms : 252 ( 93 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 303 ( 108 ~; 109 |; 64 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 44 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpTn7Iil/sel_SWC256+1.p_1',ax21) ).
fof(14,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/tmp/tmpTn7Iil/sel_SWC256+1.p_1',ax4) ).
fof(16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpTn7Iil/sel_SWC256+1.p_1',ax15) ).
fof(18,axiom,
ssList(nil),
file('/tmp/tmpTn7Iil/sel_SWC256+1.p_1',ax17) ).
fof(25,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| singletonP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmpTn7Iil/sel_SWC256+1.p_1',co1) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| singletonP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[25]) ).
fof(29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| singletonP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
fof(63,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(64,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[64]) ).
cnf(66,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(94,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ singletonP(X1)
| ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) )
& ( ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X1 )
| singletonP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(95,plain,
! [X3] :
( ~ ssList(X3)
| ( ( ~ singletonP(X3)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X3 ) )
& ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3 )
| singletonP(X3) ) ) ),
inference(variable_rename,[status(thm)],[94]) ).
fof(96,plain,
! [X3] :
( ~ ssList(X3)
| ( ( ~ singletonP(X3)
| ( ssItem(esk7_1(X3))
& cons(esk7_1(X3),nil) = X3 ) )
& ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3 )
| singletonP(X3) ) ) ),
inference(skolemize,[status(esa)],[95]) ).
fof(97,plain,
! [X3,X5] :
( ( ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3) )
& ( ~ singletonP(X3)
| ( ssItem(esk7_1(X3))
& cons(esk7_1(X3),nil) = X3 ) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[96]) ).
fof(98,plain,
! [X3,X5] :
( ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) )
& ( ssItem(esk7_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk7_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[97]) ).
cnf(101,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[98]) ).
fof(106,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(107,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[107]) ).
fof(109,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)],[108]) ).
cnf(111,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(116,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[18]) ).
fof(145,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ~ singletonP(X1)
& ( ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X3
& memberP(X4,X5) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(146,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& neq(X7,nil)
& ~ singletonP(X6)
& ( ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X8
& memberP(X9,X10) )
| ( nil = X9
& nil = X8 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[145]) ).
fof(147,negated_conjecture,
( ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& neq(esk9_0,nil)
& ~ singletonP(esk8_0)
& ( ( ssItem(esk12_0)
& cons(esk12_0,nil) = esk10_0
& memberP(esk11_0,esk12_0) )
| ( nil = esk11_0
& nil = esk10_0 ) ) ),
inference(skolemize,[status(esa)],[146]) ).
fof(148,negated_conjecture,
( ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& neq(esk9_0,nil)
& ~ singletonP(esk8_0)
& ( nil = esk11_0
| ssItem(esk12_0) )
& ( nil = esk10_0
| ssItem(esk12_0) )
& ( nil = esk11_0
| cons(esk12_0,nil) = esk10_0 )
& ( nil = esk10_0
| cons(esk12_0,nil) = esk10_0 )
& ( nil = esk11_0
| memberP(esk11_0,esk12_0) )
& ( nil = esk10_0
| memberP(esk11_0,esk12_0) ) ),
inference(distribute,[status(thm)],[147]) ).
cnf(151,negated_conjecture,
( cons(esk12_0,nil) = esk10_0
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(152,negated_conjecture,
( cons(esk12_0,nil) = esk10_0
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(153,negated_conjecture,
( ssItem(esk12_0)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(154,negated_conjecture,
( ssItem(esk12_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(155,negated_conjecture,
~ singletonP(esk8_0),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(156,negated_conjecture,
neq(esk9_0,nil),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(157,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[148]) ).
cnf(158,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[148]) ).
cnf(162,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(163,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[162,157,theory(equality)]) ).
cnf(165,negated_conjecture,
~ singletonP(esk10_0),
inference(rw,[status(thm)],[155,157,theory(equality)]) ).
cnf(166,negated_conjecture,
neq(esk11_0,nil),
inference(rw,[status(thm)],[156,158,theory(equality)]) ).
cnf(174,negated_conjecture,
( esk11_0 = nil
| esk10_0 != nil
| ~ ssItem(esk12_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[66,152,theory(equality)]) ).
cnf(177,negated_conjecture,
( esk11_0 = nil
| esk10_0 != nil
| ~ ssItem(esk12_0)
| $false ),
inference(rw,[status(thm)],[174,116,theory(equality)]) ).
cnf(178,negated_conjecture,
( esk11_0 = nil
| esk10_0 != nil
| ~ ssItem(esk12_0) ),
inference(cn,[status(thm)],[177,theory(equality)]) ).
cnf(185,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[111,theory(equality)]) ).
cnf(187,negated_conjecture,
( singletonP(X1)
| esk10_0 = nil
| esk10_0 != X1
| ~ ssItem(esk12_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[101,151,theory(equality)]) ).
cnf(388,negated_conjecture,
( esk11_0 = nil
| esk10_0 != nil ),
inference(csr,[status(thm)],[178,154]) ).
cnf(395,negated_conjecture,
( esk10_0 = nil
| singletonP(X1)
| esk10_0 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[187,153]) ).
cnf(396,negated_conjecture,
( esk10_0 = nil
| singletonP(esk10_0)
| ~ ssList(esk10_0) ),
inference(er,[status(thm)],[395,theory(equality)]) ).
cnf(397,negated_conjecture,
( esk10_0 = nil
| singletonP(esk10_0)
| $false ),
inference(rw,[status(thm)],[396,163,theory(equality)]) ).
cnf(398,negated_conjecture,
( esk10_0 = nil
| singletonP(esk10_0) ),
inference(cn,[status(thm)],[397,theory(equality)]) ).
cnf(399,negated_conjecture,
esk10_0 = nil,
inference(sr,[status(thm)],[398,165,theory(equality)]) ).
cnf(407,negated_conjecture,
( esk11_0 = nil
| $false ),
inference(rw,[status(thm)],[388,399,theory(equality)]) ).
cnf(408,negated_conjecture,
esk11_0 = nil,
inference(cn,[status(thm)],[407,theory(equality)]) ).
cnf(416,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[166,408,theory(equality)]) ).
cnf(423,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[185,416,theory(equality)]) ).
cnf(425,negated_conjecture,
$false,
inference(rw,[status(thm)],[423,116,theory(equality)]) ).
cnf(426,negated_conjecture,
$false,
inference(cn,[status(thm)],[425,theory(equality)]) ).
cnf(427,negated_conjecture,
$false,
426,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC256+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpTn7Iil/sel_SWC256+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC256+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC256+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC256+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
%
%------------------------------------------------------------------------------