TSTP Solution File: SWC047+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC047+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:08:52 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 185 ( 57 equ)
% Maximal formula atoms : 21 ( 5 avg)
% Number of connectives : 238 ( 90 ~; 77 |; 58 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 20 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/tmp/tmpn1yV1o/sel_SWC047+1.p_1',ax49) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) ) ) ) ) ) ),
file('/tmp/tmpn1yV1o/sel_SWC047+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(51,plain,
! [X1] :
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(52,plain,
! [X2] :
( ~ ssList(X2)
| rearsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(140,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& X4 = X3
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ rearsegP(X2,X5)
| ~ rearsegP(X1,X5) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(141,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& X9 = X8
& ( ( nil = X7
& nil != X6 )
| ( neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(X7,X10)
| ~ rearsegP(X6,X10) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& esk9_0 = esk8_0
& ( ( nil = esk7_0
& nil != esk6_0 )
| ( neq(esk7_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) ) ) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
! [X10] :
( ( ( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& neq(esk7_0,nil) )
| ( nil = esk7_0
& nil != esk6_0 ) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& esk9_0 = esk8_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(shift_quantors,[status(thm)],[142]) ).
fof(144,negated_conjecture,
! [X10] :
( ( nil = esk7_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& ( nil != esk6_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& ( nil = esk7_0
| neq(esk7_0,nil) )
& ( nil != esk6_0
| neq(esk7_0,nil) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& esk9_0 = esk8_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(distribute,[status(thm)],[143]) ).
cnf(146,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
esk9_0 = esk8_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(150,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(151,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
( neq(esk7_0,nil)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
( neq(esk7_0,nil)
| nil = esk7_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
( ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(155,negated_conjecture,
( nil = esk7_0
| ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(160,negated_conjecture,
esk7_0 = esk8_0,
inference(rw,[status(thm)],[149,151,theory(equality)]) ).
cnf(161,negated_conjecture,
esk7_0 = esk6_0,
inference(rw,[status(thm)],[160,150,theory(equality)]) ).
cnf(166,negated_conjecture,
( neq(esk7_0,nil)
| esk7_0 != nil ),
inference(rw,[status(thm)],[152,161,theory(equality)]) ).
cnf(167,negated_conjecture,
neq(esk7_0,nil),
inference(csr,[status(thm)],[166,153]) ).
cnf(179,negated_conjecture,
( esk7_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk7_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[155,161,theory(equality)]) ).
cnf(180,negated_conjecture,
( esk7_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk7_0,X1) ),
inference(cn,[status(thm)],[179,theory(equality)]) ).
cnf(209,negated_conjecture,
( esk7_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[154,161,theory(equality)]) ).
cnf(210,negated_conjecture,
( esk7_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk7_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[209,161,theory(equality)]) ).
cnf(211,negated_conjecture,
( esk7_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk7_0,X1) ),
inference(cn,[status(thm)],[210,theory(equality)]) ).
cnf(212,negated_conjecture,
( ~ neq(X1,nil)
| ~ rearsegP(esk7_0,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[211,180]) ).
cnf(213,negated_conjecture,
( ~ rearsegP(esk7_0,esk7_0)
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[212,167,theory(equality)]) ).
cnf(216,negated_conjecture,
( ~ rearsegP(esk7_0,esk7_0)
| $false ),
inference(rw,[status(thm)],[213,146,theory(equality)]) ).
cnf(217,negated_conjecture,
~ rearsegP(esk7_0,esk7_0),
inference(cn,[status(thm)],[216,theory(equality)]) ).
cnf(315,negated_conjecture,
~ ssList(esk7_0),
inference(spm,[status(thm)],[217,53,theory(equality)]) ).
cnf(316,negated_conjecture,
$false,
inference(rw,[status(thm)],[315,146,theory(equality)]) ).
cnf(317,negated_conjecture,
$false,
inference(cn,[status(thm)],[316,theory(equality)]) ).
cnf(318,negated_conjecture,
$false,
317,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC047+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpn1yV1o/sel_SWC047+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC047+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC047+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC047+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
%
%------------------------------------------------------------------------------