TSTP Solution File: SWC182+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC182+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:40:39 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 6
% Syntax : Number of formulae : 69 ( 18 unt; 0 def)
% Number of atoms : 247 ( 84 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 279 ( 101 ~; 103 |; 45 &)
% ( 1 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 51 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',ax26) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',ax83) ).
fof(11,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',ax38) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',ax16) ).
fof(13,axiom,
ssList(nil),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',ax17) ).
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmpkTbsZT/sel_SWC182+1.p_1',co1) ).
fof(22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(23,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(39,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(40,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[40]) ).
cnf(42,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(54,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( nil != app(X1,X2)
| ( nil = X2
& nil = X1 ) )
& ( nil != X2
| nil != X1
| nil = app(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(55,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[55]) ).
fof(57,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[56]) ).
cnf(59,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(60,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(76,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(77,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[76]) ).
cnf(78,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
fof(79,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(80,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[79]) ).
fof(81,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[80]) ).
cnf(82,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(83,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[13]) ).
fof(119,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& nil = X3
& X2 = X4
& X1 = X3
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ( memberP(X6,X5)
| memberP(X7,X5) ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(120,negated_conjecture,
? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& nil = X10
& X9 = X11
& X8 = X10
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& app(app(X13,cons(X12,nil)),X14) = X8
& ( memberP(X13,X12)
| memberP(X14,X12) ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[119]) ).
fof(121,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& nil = esk9_0
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ( memberP(esk12_0,esk11_0)
| memberP(esk13_0,esk11_0) ) ),
inference(skolemize,[status(esa)],[120]) ).
cnf(122,negated_conjecture,
( memberP(esk13_0,esk11_0)
| memberP(esk12_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(124,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(125,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(126,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(127,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(129,negated_conjecture,
nil = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(136,negated_conjecture,
nil = esk7_0,
inference(rw,[status(thm)],[127,129,theory(equality)]) ).
cnf(140,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = nil,
inference(rw,[status(thm)],[123,136,theory(equality)]) ).
cnf(149,negated_conjecture,
( nil = esk13_0
| ~ ssList(esk13_0)
| ~ ssList(app(esk12_0,cons(esk11_0,nil))) ),
inference(spm,[status(thm)],[60,140,theory(equality)]) ).
cnf(153,negated_conjecture,
( nil = app(esk12_0,cons(esk11_0,nil))
| ~ ssList(esk13_0)
| ~ ssList(app(esk12_0,cons(esk11_0,nil))) ),
inference(spm,[status(thm)],[59,140,theory(equality)]) ).
cnf(293,negated_conjecture,
( esk13_0 = nil
| ~ ssList(app(esk12_0,cons(esk11_0,nil))) ),
inference(spm,[status(thm)],[149,124,theory(equality)]) ).
cnf(294,negated_conjecture,
( esk13_0 = nil
| ~ ssList(cons(esk11_0,nil))
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[293,42,theory(equality)]) ).
cnf(312,negated_conjecture,
( esk13_0 = nil
| ~ ssList(cons(esk11_0,nil)) ),
inference(spm,[status(thm)],[294,125,theory(equality)]) ).
cnf(313,negated_conjecture,
( esk13_0 = nil
| ~ ssList(nil)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[312,82,theory(equality)]) ).
cnf(314,negated_conjecture,
( esk13_0 = nil
| $false
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[313,83,theory(equality)]) ).
cnf(315,negated_conjecture,
( esk13_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[314,126,theory(equality)]) ).
cnf(316,negated_conjecture,
esk13_0 = nil,
inference(cn,[status(thm)],[315,theory(equality)]) ).
cnf(321,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| ~ ssList(app(esk12_0,cons(esk11_0,nil)))
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[153,316,theory(equality)]),83,theory(equality)]) ).
cnf(322,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| ~ ssList(app(esk12_0,cons(esk11_0,nil))) ),
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(327,negated_conjecture,
( memberP(nil,esk11_0)
| memberP(esk12_0,esk11_0) ),
inference(rw,[status(thm)],[122,316,theory(equality)]) ).
cnf(415,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| ~ ssList(cons(esk11_0,nil))
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[322,42,theory(equality)]) ).
cnf(484,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| ~ ssList(cons(esk11_0,nil)) ),
inference(spm,[status(thm)],[415,125,theory(equality)]) ).
cnf(528,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| ~ ssList(nil)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[484,82,theory(equality)]) ).
cnf(529,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| $false
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[528,83,theory(equality)]) ).
cnf(530,negated_conjecture,
( app(esk12_0,cons(esk11_0,nil)) = nil
| $false
| $false ),
inference(rw,[status(thm)],[529,126,theory(equality)]) ).
cnf(531,negated_conjecture,
app(esk12_0,cons(esk11_0,nil)) = nil,
inference(cn,[status(thm)],[530,theory(equality)]) ).
cnf(534,negated_conjecture,
( nil = esk12_0
| ~ ssList(cons(esk11_0,nil))
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[59,531,theory(equality)]) ).
cnf(553,negated_conjecture,
( esk12_0 = nil
| ~ ssList(cons(esk11_0,nil)) ),
inference(spm,[status(thm)],[534,125,theory(equality)]) ).
cnf(554,negated_conjecture,
( esk12_0 = nil
| ~ ssList(nil)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[553,82,theory(equality)]) ).
cnf(555,negated_conjecture,
( esk12_0 = nil
| $false
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[554,83,theory(equality)]) ).
cnf(556,negated_conjecture,
( esk12_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[555,126,theory(equality)]) ).
cnf(557,negated_conjecture,
esk12_0 = nil,
inference(cn,[status(thm)],[556,theory(equality)]) ).
cnf(599,negated_conjecture,
( memberP(nil,esk11_0)
| memberP(nil,esk11_0) ),
inference(rw,[status(thm)],[327,557,theory(equality)]) ).
cnf(600,negated_conjecture,
memberP(nil,esk11_0),
inference(cn,[status(thm)],[599,theory(equality)]) ).
cnf(601,negated_conjecture,
~ ssItem(esk11_0),
inference(spm,[status(thm)],[78,600,theory(equality)]) ).
cnf(608,negated_conjecture,
$false,
inference(rw,[status(thm)],[601,126,theory(equality)]) ).
cnf(609,negated_conjecture,
$false,
inference(cn,[status(thm)],[608,theory(equality)]) ).
cnf(610,negated_conjecture,
$false,
609,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC182+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpkTbsZT/sel_SWC182+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC182+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC182+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC182+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
%
%------------------------------------------------------------------------------