%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC051+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:09:17 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 180 ( 34 equ)
% Maximal formula atoms : 17 ( 5 avg)
% Number of connectives : 222 ( 78 ~; 66 |; 65 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 35 ( 0 sgn 20 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/tmp/tmpLzt9pG/sel_SWC051+1.p_1',ax49) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpLzt9pG/sel_SWC051+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
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
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
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
& neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ rearsegP(X2,X5)
| ~ rearsegP(X1,X5) )
& ( nil = X3
| nil != X4 )
& ( ~ neq(X4,nil)
| ( neq(X3,nil)
& rearsegP(X4,X3) ) ) ) ) ) ),
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
& neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(X7,X10)
| ~ rearsegP(X6,X10) )
& ( nil = X8
| nil != X9 )
& ( ~ neq(X9,nil)
| ( neq(X8,nil)
& rearsegP(X9,X8) ) ) ) ) ) ),
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
& neq(esk7_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& ( nil = esk8_0
| nil != esk9_0 )
& ( ~ neq(esk9_0,nil)
| ( neq(esk8_0,nil)
& rearsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
! [X10] :
( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& neq(esk7_0,nil)
& ( nil = esk8_0
| nil != esk9_0 )
& ( ~ neq(esk9_0,nil)
| ( neq(esk8_0,nil)
& rearsegP(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] :
( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& neq(esk7_0,nil)
& ( nil = esk8_0
| nil != esk9_0 )
& ( neq(esk8_0,nil)
| ~ neq(esk9_0,nil) )
& ( rearsegP(esk9_0,esk8_0)
| ~ neq(esk9_0,nil) )
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( rearsegP(esk9_0,esk8_0)
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(150,negated_conjecture,
( neq(esk8_0,nil)
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
neq(esk7_0,nil),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(155,negated_conjecture,
( ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(156,negated_conjecture,
ssList(esk8_0),
inference(rw,[status(thm)],[145,153,theory(equality)]) ).
cnf(158,negated_conjecture,
neq(esk9_0,nil),
inference(rw,[status(thm)],[152,154,theory(equality)]) ).
cnf(159,negated_conjecture,
( rearsegP(esk9_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[149,158,theory(equality)]) ).
cnf(160,negated_conjecture,
rearsegP(esk9_0,esk8_0),
inference(cn,[status(thm)],[159,theory(equality)]) ).
cnf(161,negated_conjecture,
( neq(esk8_0,nil)
| $false ),
inference(rw,[status(thm)],[150,158,theory(equality)]) ).
cnf(162,negated_conjecture,
neq(esk8_0,nil),
inference(cn,[status(thm)],[161,theory(equality)]) ).
cnf(176,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk8_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[155,153,theory(equality)]) ).
cnf(177,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk8_0,X1)
| ~ rearsegP(esk9_0,X1) ),
inference(rw,[status(thm)],[176,154,theory(equality)]) ).
cnf(179,negated_conjecture,
( ~ rearsegP(esk8_0,esk8_0)
| ~ rearsegP(esk9_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[177,162,theory(equality)]) ).
cnf(182,negated_conjecture,
( ~ rearsegP(esk8_0,esk8_0)
| $false
| ~ ssList(esk8_0) ),
inference(rw,[status(thm)],[179,160,theory(equality)]) ).
cnf(183,negated_conjecture,
( ~ rearsegP(esk8_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(cn,[status(thm)],[182,theory(equality)]) ).
cnf(322,negated_conjecture,
( ~ rearsegP(esk8_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[183,156,theory(equality)]) ).
cnf(323,negated_conjecture,
~ rearsegP(esk8_0,esk8_0),
inference(cn,[status(thm)],[322,theory(equality)]) ).
cnf(324,negated_conjecture,
~ ssList(esk8_0),
inference(spm,[status(thm)],[323,53,theory(equality)]) ).
cnf(325,negated_conjecture,
$false,
inference(rw,[status(thm)],[324,156,theory(equality)]) ).
cnf(326,negated_conjecture,
$false,
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(327,negated_conjecture,
$false,
326,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC051+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpLzt9pG/sel_SWC051+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC051+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC051+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC051+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
%
%------------------------------------------------------------------------------