TSTP Solution File: SWC066+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC066+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:11:13 EST 2010
% Result : Theorem 112.65s
% Output : CNFRefutation 112.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 18
% Syntax : Number of formulae : 183 ( 16 unt; 0 def)
% Number of atoms : 910 ( 229 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 1249 ( 522 ~; 537 |; 142 &)
% ( 5 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 285 ( 0 sgn 160 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( totalorderedP(cons(X1,X2))
<=> ( nil = X2
| ( nil != X2
& totalorderedP(X2)
& leq(X1,hd(X2)) ) ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax67) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax83) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax82) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax81) ).
fof(11,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax28) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax27) ).
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax26) ).
fof(14,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax21) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax20) ).
fof(20,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax7) ).
fof(29,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax58) ).
fof(31,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax16) ).
fof(32,axiom,
ssList(nil),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax17) ).
fof(35,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax53) ).
fof(37,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax55) ).
fof(39,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax57) ).
fof(40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',ax15) ).
fof(43,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ) ),
file('/tmp/tmp9ZRrpy/sel_SWC066+1.p_3',co1) ).
fof(44,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[43]) ).
fof(47,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).
fof(51,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ totalorderedP(cons(X1,X2))
| nil = X2
| ( nil != X2
& totalorderedP(X2)
& leq(X1,hd(X2)) ) )
& ( ( nil != X2
& ( nil = X2
| ~ totalorderedP(X2)
| ~ leq(X1,hd(X2)) ) )
| totalorderedP(cons(X1,X2)) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(52,plain,
! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ totalorderedP(cons(X3,X4))
| nil = X4
| ( nil != X4
& totalorderedP(X4)
& leq(X3,hd(X4)) ) )
& ( ( nil != X4
& ( nil = X4
| ~ totalorderedP(X4)
| ~ leq(X3,hd(X4)) ) )
| totalorderedP(cons(X3,X4)) ) ) ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ totalorderedP(cons(X3,X4))
| nil = X4
| ( nil != X4
& totalorderedP(X4)
& leq(X3,hd(X4)) ) )
& ( ( nil != X4
& ( nil = X4
| ~ totalorderedP(X4)
| ~ leq(X3,hd(X4)) ) )
| totalorderedP(cons(X3,X4)) ) )
| ~ ssItem(X3) ),
inference(shift_quantors,[status(thm)],[52]) ).
fof(54,plain,
! [X3,X4] :
( ( nil != X4
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( totalorderedP(X4)
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( leq(X3,hd(X4))
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( nil != X4
| totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( nil = X4
| ~ totalorderedP(X4)
| ~ leq(X3,hd(X4))
| totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(56,plain,
( totalorderedP(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| nil != X2 ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(68,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)],[6]) ).
fof(69,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)],[68]) ).
fof(70,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)],[69]) ).
fof(71,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)],[70]) ).
cnf(72,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[71]) ).
fof(75,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(76,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6))
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[76]) ).
cnf(78,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[77]) ).
fof(79,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(80,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[79]) ).
fof(81,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[80]) ).
cnf(82,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(91,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(92,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[91]) ).
cnf(93,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[92]) ).
fof(94,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssItem(X3)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(95,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ) ) ),
inference(variable_rename,[status(thm)],[94]) ).
fof(96,plain,
! [X4,X5,X6] :
( ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[95]) ).
cnf(97,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(98,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(99,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[98]) ).
fof(100,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[99]) ).
cnf(101,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[100]) ).
fof(102,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(103,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[103]) ).
cnf(105,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[104]) ).
fof(106,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(107,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssItem(X6)
& cons(X6,X5) = X4 ) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,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)],[107]) ).
fof(109,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)],[108]) ).
cnf(110,plain,
( nil = X1
| cons(esk2_1(X1),esk1_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(111,plain,
( nil = X1
| ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(112,plain,
( nil = X1
| ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(131,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(app(X3,X2),X4) != X1 ) )
| segmentP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(132,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,X6),X8) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[131]) ).
fof(133,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[132]) ).
fof(134,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[133]) ).
fof(135,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[134]) ).
cnf(139,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[135]) ).
fof(178,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(179,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[178]) ).
fof(180,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[179]) ).
cnf(181,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[180]) ).
cnf(182,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[180]) ).
fof(187,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(188,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[188]) ).
cnf(190,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[189]) ).
cnf(191,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[32]) ).
fof(209,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| segmentP(X1,X3) ) ) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(210,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,X6) ) ) ),
inference(variable_rename,[status(thm)],[209]) ).
fof(211,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[210]) ).
cnf(212,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[211]) ).
fof(217,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(218,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[217]) ).
cnf(219,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[218]) ).
fof(224,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(225,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[224]) ).
cnf(226,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[225]) ).
fof(227,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(228,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[227]) ).
fof(229,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[228]) ).
fof(230,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)],[229]) ).
cnf(231,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[230]) ).
fof(240,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& segmentP(X4,X3)
& totalorderedP(X3)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X3,X5)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X3)
| ~ totalorderedP(X5) )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X2,X6)
| ~ segmentP(X1,X6) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(241,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& segmentP(X10,X9)
& totalorderedP(X9)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X9,X11)
| ~ segmentP(X10,X11)
| ~ segmentP(X11,X9)
| ~ totalorderedP(X11) )
& ( ( nil = X8
& nil != X7 )
| ( neq(X8,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(X8,X12)
| ~ segmentP(X7,X12) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[240]) ).
fof(242,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& ( ( nil = esk14_0
& nil != esk13_0 )
| ( neq(esk14_0,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk14_0,X12)
| ~ segmentP(esk13_0,X12) ) ) ) ),
inference(skolemize,[status(esa)],[241]) ).
fof(243,negated_conjecture,
! [X11,X12] :
( ( ( ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk14_0,X12)
| ~ segmentP(esk13_0,X12) )
& neq(esk14_0,nil) )
| ( nil = esk14_0
& nil != esk13_0 ) )
& ( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(shift_quantors,[status(thm)],[242]) ).
fof(244,negated_conjecture,
! [X11,X12] :
( ( nil = esk14_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk14_0,X12)
| ~ segmentP(esk13_0,X12) )
& ( nil != esk13_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk14_0,X12)
| ~ segmentP(esk13_0,X12) )
& ( nil = esk14_0
| neq(esk14_0,nil) )
& ( nil != esk13_0
| neq(esk14_0,nil) )
& ( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(distribute,[status(thm)],[243]) ).
cnf(245,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(246,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(250,negated_conjecture,
segmentP(esk16_0,esk15_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(251,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[244]) ).
cnf(252,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[244]) ).
cnf(253,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk15_0)
| ~ segmentP(esk16_0,X1)
| ~ neq(esk15_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(254,negated_conjecture,
( neq(esk14_0,nil)
| nil != esk13_0 ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(256,negated_conjecture,
( ~ segmentP(esk13_0,X1)
| ~ segmentP(esk14_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != esk13_0 ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(257,negated_conjecture,
( nil = esk14_0
| ~ segmentP(esk13_0,X1)
| ~ segmentP(esk14_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(263,negated_conjecture,
segmentP(esk14_0,esk13_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[250,252,theory(equality)]),251,theory(equality)]) ).
cnf(274,negated_conjecture,
( esk14_0 = nil
| X1 = nil
| ~ segmentP(esk13_0,X1)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[257,231,theory(equality)]) ).
cnf(279,negated_conjecture,
( esk14_0 = nil
| X1 = nil
| ~ segmentP(esk13_0,X1)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[274,191,theory(equality)]) ).
cnf(280,negated_conjecture,
( esk14_0 = nil
| X1 = nil
| ~ segmentP(esk13_0,X1)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[279,theory(equality)]) ).
cnf(299,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk15_0,X1)
| ~ segmentP(esk16_0,X1) ),
inference(rw,[status(thm)],[253,251,theory(equality)]) ).
cnf(300,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk13_0,X1)
| ~ segmentP(esk16_0,X1) ),
inference(rw,[status(thm)],[299,251,theory(equality)]) ).
cnf(301,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk13_0,X1)
| ~ segmentP(esk14_0,X1) ),
inference(rw,[status(thm)],[300,252,theory(equality)]) ).
cnf(302,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[301,231,theory(equality)]) ).
cnf(304,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1)
| $false ),
inference(rw,[status(thm)],[302,245,theory(equality)]) ).
cnf(305,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(cn,[status(thm)],[304,theory(equality)]) ).
cnf(307,negated_conjecture,
( esk13_0 != nil
| ~ segmentP(esk13_0,esk14_0)
| ~ segmentP(esk14_0,esk14_0)
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[256,254,theory(equality)]) ).
cnf(312,negated_conjecture,
( esk13_0 != nil
| ~ segmentP(esk13_0,esk14_0)
| ~ segmentP(esk14_0,esk14_0)
| $false ),
inference(rw,[status(thm)],[307,246,theory(equality)]) ).
cnf(313,negated_conjecture,
( esk13_0 != nil
| ~ segmentP(esk13_0,esk14_0)
| ~ segmentP(esk14_0,esk14_0) ),
inference(cn,[status(thm)],[312,theory(equality)]) ).
cnf(316,negated_conjecture,
( segmentP(X1,esk13_0)
| ~ segmentP(X1,esk14_0)
| ~ ssList(esk13_0)
| ~ ssList(esk14_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[212,263,theory(equality)]) ).
cnf(320,negated_conjecture,
( segmentP(X1,esk13_0)
| ~ segmentP(X1,esk14_0)
| $false
| ~ ssList(esk14_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[316,245,theory(equality)]) ).
cnf(321,negated_conjecture,
( segmentP(X1,esk13_0)
| ~ segmentP(X1,esk14_0)
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[320,246,theory(equality)]) ).
cnf(322,negated_conjecture,
( segmentP(X1,esk13_0)
| ~ segmentP(X1,esk14_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(394,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[139,93,theory(equality)]) ).
cnf(402,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[394,191,theory(equality)]) ).
cnf(403,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[402,theory(equality)]) ).
cnf(428,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[78,93,theory(equality)]) ).
cnf(450,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[428,191,theory(equality)]) ).
cnf(451,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[450,theory(equality)]) ).
cnf(482,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(app(X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[190,97,theory(equality)]) ).
cnf(558,negated_conjecture,
( nil = esk13_0
| ~ ssList(esk13_0)
| ~ segmentP(nil,esk14_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[182,322,theory(equality)]) ).
cnf(563,negated_conjecture,
( nil = esk13_0
| $false
| ~ segmentP(nil,esk14_0)
| ~ ssList(nil) ),
inference(rw,[status(thm)],[558,245,theory(equality)]) ).
cnf(564,negated_conjecture,
( nil = esk13_0
| $false
| ~ segmentP(nil,esk14_0)
| $false ),
inference(rw,[status(thm)],[563,191,theory(equality)]) ).
cnf(565,negated_conjecture,
( nil = esk13_0
| ~ segmentP(nil,esk14_0) ),
inference(cn,[status(thm)],[564,theory(equality)]) ).
cnf(575,negated_conjecture,
( esk13_0 = nil
| nil != esk14_0
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[565,181,theory(equality)]) ).
cnf(576,negated_conjecture,
( esk13_0 = nil
| nil != esk14_0
| $false ),
inference(rw,[status(thm)],[575,246,theory(equality)]) ).
cnf(577,negated_conjecture,
( esk13_0 = nil
| nil != esk14_0 ),
inference(cn,[status(thm)],[576,theory(equality)]) ).
cnf(578,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| ~ segmentP(esk14_0,esk13_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[280,219,theory(equality)]) ).
cnf(580,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[578,263,theory(equality)]) ).
cnf(581,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[580,245,theory(equality)]) ).
cnf(582,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil ),
inference(cn,[status(thm)],[581,theory(equality)]) ).
cnf(605,negated_conjecture,
esk13_0 = nil,
inference(csr,[status(thm)],[577,582]) ).
cnf(622,negated_conjecture,
( nil = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(rw,[status(thm)],[305,605,theory(equality)]) ).
cnf(623,negated_conjecture,
( nil = X1
| ~ segmentP(X1,nil)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(rw,[status(thm)],[622,605,theory(equality)]) ).
cnf(627,negated_conjecture,
( $false
| ~ segmentP(esk13_0,esk14_0)
| ~ segmentP(esk14_0,esk14_0) ),
inference(rw,[status(thm)],[313,605,theory(equality)]) ).
cnf(628,negated_conjecture,
( $false
| ~ segmentP(nil,esk14_0)
| ~ segmentP(esk14_0,esk14_0) ),
inference(rw,[status(thm)],[627,605,theory(equality)]) ).
cnf(629,negated_conjecture,
( ~ segmentP(nil,esk14_0)
| ~ segmentP(esk14_0,esk14_0) ),
inference(cn,[status(thm)],[628,theory(equality)]) ).
cnf(649,negated_conjecture,
( ~ segmentP(nil,esk14_0)
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[629,219,theory(equality)]) ).
cnf(650,negated_conjecture,
( ~ segmentP(nil,esk14_0)
| $false ),
inference(rw,[status(thm)],[649,246,theory(equality)]) ).
cnf(651,negated_conjecture,
~ segmentP(nil,esk14_0),
inference(cn,[status(thm)],[650,theory(equality)]) ).
cnf(652,negated_conjecture,
( nil != esk14_0
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[651,181,theory(equality)]) ).
cnf(653,negated_conjecture,
( nil != esk14_0
| $false ),
inference(rw,[status(thm)],[652,246,theory(equality)]) ).
cnf(654,negated_conjecture,
nil != esk14_0,
inference(cn,[status(thm)],[653,theory(equality)]) ).
cnf(660,negated_conjecture,
( nil = X1
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(csr,[status(thm)],[623,226]) ).
cnf(662,negated_conjecture,
( nil = cons(X1,X2)
| ~ segmentP(esk14_0,cons(X1,X2))
| ~ ssList(cons(X1,X2))
| nil != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[660,56,theory(equality)]) ).
cnf(759,negated_conjecture,
( cons(X1,X2) = nil
| nil != X2
| ~ segmentP(esk14_0,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[662,190]) ).
cnf(760,negated_conjecture,
( nil != X2
| ~ segmentP(esk14_0,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[759,105]) ).
cnf(995,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(er,[status(thm)],[403,theory(equality)]) ).
cnf(1024,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[995,101]) ).
cnf(1030,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[1024,82,theory(equality)]) ).
cnf(1152,plain,
( app(nil,nil) = nil
| ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1 ),
inference(spm,[status(thm)],[451,72,theory(equality)]) ).
cnf(1247,plain,
( app(nil,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[1152,191,theory(equality)]) ).
cnf(1257,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[1247,191,theory(equality)]) ).
cnf(1293,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssList(nil)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[97,1257,theory(equality)]) ).
cnf(1321,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| $false
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[1293,191,theory(equality)]) ).
cnf(1322,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[1321,theory(equality)]) ).
cnf(2404,plain,
( segmentP(X1,cons(esk2_1(X1),nil))
| nil = X1
| ~ ssList(cons(esk2_1(X1),nil))
| ~ ssList(esk1_1(X1))
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[1030,110,theory(equality)]) ).
cnf(6604,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[482,101]) ).
cnf(6612,plain,
( ssList(cons(X1,nil))
| ~ ssList(nil)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[6604,1322,theory(equality)]) ).
cnf(6625,plain,
( ssList(cons(X1,nil))
| $false
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[6612,191,theory(equality)]) ).
cnf(6626,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[6625,theory(equality)]) ).
cnf(62684,plain,
( nil = X1
| segmentP(X1,cons(esk2_1(X1),nil))
| ~ ssList(cons(esk2_1(X1),nil))
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2404,111]) ).
cnf(62685,plain,
( nil = X1
| segmentP(X1,cons(esk2_1(X1),nil))
| ~ ssList(cons(esk2_1(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[62684,112]) ).
cnf(62691,negated_conjecture,
( nil = esk14_0
| ~ ssList(nil)
| ~ ssItem(esk2_1(esk14_0))
| ~ ssList(cons(esk2_1(esk14_0),nil))
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[760,62685,theory(equality)]) ).
cnf(62750,negated_conjecture,
( nil = esk14_0
| $false
| ~ ssItem(esk2_1(esk14_0))
| ~ ssList(cons(esk2_1(esk14_0),nil))
| ~ ssList(esk14_0) ),
inference(rw,[status(thm)],[62691,191,theory(equality)]) ).
cnf(62751,negated_conjecture,
( nil = esk14_0
| $false
| ~ ssItem(esk2_1(esk14_0))
| ~ ssList(cons(esk2_1(esk14_0),nil))
| $false ),
inference(rw,[status(thm)],[62750,246,theory(equality)]) ).
cnf(62752,negated_conjecture,
( nil = esk14_0
| ~ ssItem(esk2_1(esk14_0))
| ~ ssList(cons(esk2_1(esk14_0),nil)) ),
inference(cn,[status(thm)],[62751,theory(equality)]) ).
cnf(62753,negated_conjecture,
( ~ ssItem(esk2_1(esk14_0))
| ~ ssList(cons(esk2_1(esk14_0),nil)) ),
inference(sr,[status(thm)],[62752,654,theory(equality)]) ).
cnf(63152,negated_conjecture,
~ ssItem(esk2_1(esk14_0)),
inference(csr,[status(thm)],[62753,6626]) ).
cnf(63153,negated_conjecture,
( nil = esk14_0
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[63152,111,theory(equality)]) ).
cnf(63155,negated_conjecture,
( nil = esk14_0
| $false ),
inference(rw,[status(thm)],[63153,246,theory(equality)]) ).
cnf(63156,negated_conjecture,
nil = esk14_0,
inference(cn,[status(thm)],[63155,theory(equality)]) ).
cnf(63157,negated_conjecture,
$false,
inference(sr,[status(thm)],[63156,654,theory(equality)]) ).
cnf(63158,negated_conjecture,
$false,
63157,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC066+1.p
% --creating new selector for [SWC001+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp9ZRrpy/sel_SWC066+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp9ZRrpy/sel_SWC066+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp9ZRrpy/sel_SWC066+1.p_3 with time limit 74
% -prover status Theorem
% Problem SWC066+1.p solved in phase 2.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC066+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC066+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
%
%------------------------------------------------------------------------------