TSTP Solution File: SWC025+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC025+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 10:06:41 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 4
% Syntax : Number of formulae : 68 ( 11 unt; 0 def)
% Number of atoms : 325 ( 114 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 396 ( 139 ~; 152 |; 86 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 41 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/tmp/tmpgbJ3h4/sel_SWC025+1.p_1',ax20) ).
fof(19,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpgbJ3h4/sel_SWC025+1.p_1',ax37) ).
fof(21,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpgbJ3h4/sel_SWC025+1.p_1',ax38) ).
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/tmp/tmpgbJ3h4/sel_SWC025+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(26,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(65,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(66,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssItem(X6)
& cons(X6,X5) = X4 ) ) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ( ssList(esk1_1(X4))
& ssItem(esk2_1(X4))
& cons(esk2_1(X4),esk1_1(X4)) = X4 ) ),
inference(skolemize,[status(esa)],[66]) ).
fof(68,plain,
! [X4] :
( ( ssList(esk1_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk2_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk2_1(X4),esk1_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[67]) ).
cnf(69,plain,
( nil = X1
| cons(esk2_1(X1),esk1_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(70,plain,
( nil = X1
| ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(71,plain,
( nil = X1
| ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
fof(106,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(cons(X2,X3),X1)
| X1 = X2
| memberP(X3,X1) )
& ( ( X1 != X2
& ~ memberP(X3,X1) )
| memberP(cons(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(107,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) )
| ~ ssItem(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[107]) ).
fof(109,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(111,plain,
( memberP(cons(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(126,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(127,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[126]) ).
cnf(128,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[127]) ).
fof(139,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& duplicatefreeP(X3)
& ! [X5] :
( ~ ssItem(X5)
| ( ( memberP(X4,X5)
| ~ memberP(X3,X5) )
& ( memberP(X3,X5)
| ~ memberP(X4,X5) ) ) )
& ( ( nil = X2
& nil != X1 )
| ( nil = X1
& nil != X2 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(140,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& duplicatefreeP(X8)
& ! [X10] :
( ~ ssItem(X10)
| ( ( memberP(X9,X10)
| ~ memberP(X8,X10) )
& ( memberP(X8,X10)
| ~ memberP(X9,X10) ) ) )
& ( ( nil = X7
& nil != X6 )
| ( nil = X6
& nil != X7 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,negated_conjecture,
( ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& duplicatefreeP(esk14_0)
& ! [X10] :
( ~ ssItem(X10)
| ( ( memberP(esk15_0,X10)
| ~ memberP(esk14_0,X10) )
& ( memberP(esk14_0,X10)
| ~ memberP(esk15_0,X10) ) ) )
& ( ( nil = esk13_0
& nil != esk12_0 )
| ( nil = esk12_0
& nil != esk13_0 ) ) ),
inference(skolemize,[status(esa)],[140]) ).
fof(142,negated_conjecture,
! [X10] :
( ( ~ ssItem(X10)
| ( ( memberP(esk15_0,X10)
| ~ memberP(esk14_0,X10) )
& ( memberP(esk14_0,X10)
| ~ memberP(esk15_0,X10) ) ) )
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& duplicatefreeP(esk14_0)
& ( ( nil = esk13_0
& nil != esk12_0 )
| ( nil = esk12_0
& nil != esk13_0 ) )
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0) ),
inference(shift_quantors,[status(thm)],[141]) ).
fof(143,negated_conjecture,
! [X10] :
( ( memberP(esk15_0,X10)
| ~ memberP(esk14_0,X10)
| ~ ssItem(X10) )
& ( memberP(esk14_0,X10)
| ~ memberP(esk15_0,X10)
| ~ ssItem(X10) )
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& duplicatefreeP(esk14_0)
& ( nil = esk12_0
| nil = esk13_0 )
& ( nil != esk13_0
| nil = esk13_0 )
& ( nil = esk12_0
| nil != esk12_0 )
& ( nil != esk13_0
| nil != esk12_0 )
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0) ),
inference(distribute,[status(thm)],[142]) ).
cnf(144,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(147,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(148,negated_conjecture,
( nil != esk12_0
| nil != esk13_0 ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(151,negated_conjecture,
( nil = esk13_0
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(153,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(154,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(155,negated_conjecture,
( memberP(esk14_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk15_0,X1) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(156,negated_conjecture,
( memberP(esk15_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk14_0,X1) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(157,negated_conjecture,
ssList(esk14_0),
inference(rw,[status(thm)],[144,153,theory(equality)]) ).
cnf(159,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil ),
inference(rw,[status(thm)],[151,153,theory(equality)]) ).
cnf(160,negated_conjecture,
( esk14_0 = nil
| esk15_0 = nil ),
inference(rw,[status(thm)],[159,154,theory(equality)]) ).
cnf(164,negated_conjecture,
( esk14_0 != nil
| esk13_0 != nil ),
inference(rw,[status(thm)],[148,153,theory(equality)]) ).
cnf(165,negated_conjecture,
( esk14_0 != nil
| esk15_0 != nil ),
inference(rw,[status(thm)],[164,154,theory(equality)]) ).
cnf(182,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[111,theory(equality)]) ).
cnf(355,plain,
( memberP(X1,esk2_1(X1))
| nil = X1
| ~ ssItem(esk2_1(X1))
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[182,69,theory(equality)]) ).
cnf(578,plain,
( nil = X1
| memberP(X1,esk2_1(X1))
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[355,71]) ).
cnf(579,plain,
( nil = X1
| memberP(X1,esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[578,70]) ).
cnf(582,negated_conjecture,
( memberP(esk15_0,esk2_1(esk14_0))
| nil = esk14_0
| ~ ssItem(esk2_1(esk14_0))
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[156,579,theory(equality)]) ).
cnf(595,negated_conjecture,
( memberP(esk15_0,esk2_1(esk14_0))
| nil = esk14_0
| ~ ssItem(esk2_1(esk14_0))
| $false ),
inference(rw,[status(thm)],[582,157,theory(equality)]) ).
cnf(596,negated_conjecture,
( memberP(esk15_0,esk2_1(esk14_0))
| nil = esk14_0
| ~ ssItem(esk2_1(esk14_0)) ),
inference(cn,[status(thm)],[595,theory(equality)]) ).
cnf(643,negated_conjecture,
( esk14_0 = nil
| memberP(esk15_0,esk2_1(esk14_0))
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[596,70,theory(equality)]) ).
cnf(644,negated_conjecture,
( esk14_0 = nil
| memberP(esk15_0,esk2_1(esk14_0))
| $false ),
inference(rw,[status(thm)],[643,157,theory(equality)]) ).
cnf(645,negated_conjecture,
( esk14_0 = nil
| memberP(esk15_0,esk2_1(esk14_0)) ),
inference(cn,[status(thm)],[644,theory(equality)]) ).
cnf(646,negated_conjecture,
( esk14_0 = nil
| memberP(nil,esk2_1(esk14_0)) ),
inference(spm,[status(thm)],[645,160,theory(equality)]) ).
cnf(669,negated_conjecture,
( esk14_0 = nil
| ~ ssItem(esk2_1(esk14_0)) ),
inference(spm,[status(thm)],[128,646,theory(equality)]) ).
cnf(688,negated_conjecture,
( esk14_0 = nil
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[669,70,theory(equality)]) ).
cnf(689,negated_conjecture,
( esk14_0 = nil
| $false ),
inference(rw,[status(thm)],[688,157,theory(equality)]) ).
cnf(690,negated_conjecture,
esk14_0 = nil,
inference(cn,[status(thm)],[689,theory(equality)]) ).
cnf(715,negated_conjecture,
( $false
| esk15_0 != nil ),
inference(rw,[status(thm)],[165,690,theory(equality)]) ).
cnf(716,negated_conjecture,
esk15_0 != nil,
inference(cn,[status(thm)],[715,theory(equality)]) ).
cnf(718,negated_conjecture,
( memberP(nil,X1)
| ~ memberP(esk15_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[155,690,theory(equality)]) ).
cnf(721,negated_conjecture,
( ~ memberP(esk15_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[718,128]) ).
cnf(722,negated_conjecture,
( nil = esk15_0
| ~ ssItem(esk2_1(esk15_0))
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[721,579,theory(equality)]) ).
cnf(723,negated_conjecture,
( nil = esk15_0
| ~ ssItem(esk2_1(esk15_0))
| $false ),
inference(rw,[status(thm)],[722,147,theory(equality)]) ).
cnf(724,negated_conjecture,
( nil = esk15_0
| ~ ssItem(esk2_1(esk15_0)) ),
inference(cn,[status(thm)],[723,theory(equality)]) ).
cnf(725,negated_conjecture,
~ ssItem(esk2_1(esk15_0)),
inference(sr,[status(thm)],[724,716,theory(equality)]) ).
cnf(751,negated_conjecture,
( nil = esk15_0
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[725,70,theory(equality)]) ).
cnf(752,negated_conjecture,
( nil = esk15_0
| $false ),
inference(rw,[status(thm)],[751,147,theory(equality)]) ).
cnf(753,negated_conjecture,
nil = esk15_0,
inference(cn,[status(thm)],[752,theory(equality)]) ).
cnf(754,negated_conjecture,
$false,
inference(sr,[status(thm)],[753,716,theory(equality)]) ).
cnf(755,negated_conjecture,
$false,
754,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC025+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpgbJ3h4/sel_SWC025+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC025+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC025+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC025+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
%
%------------------------------------------------------------------------------