%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC273+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 11:15:19 EST 2010
% Result : Theorem 0.95s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 7 unt; 0 def)
% Number of atoms : 466 ( 49 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 654 ( 242 ~; 257 |; 127 &)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 156 ( 0 sgn 98 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(25,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/tmp/tmpTLfARn/sel_SWC273+1.p_1',ax93) ).
fof(37,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/tmp/tmpTLfARn/sel_SWC273+1.p_1',ax11) ).
fof(38,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/tmp/tmpTLfARn/sel_SWC273+1.p_1',ax12) ).
fof(47,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| totalorderedP(X1) ) ) ) ),
file('/tmp/tmpTLfARn/sel_SWC273+1.p_1',co1) ).
fof(48,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| totalorderedP(X1) ) ) ) ),
inference(assume_negation,[status(cth)],[47]) ).
fof(51,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| totalorderedP(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[48,theory(equality)]) ).
fof(156,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ( ( ~ lt(X1,X2)
| ( X1 != X2
& leq(X1,X2) ) )
& ( X1 = X2
| ~ leq(X1,X2)
| lt(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(157,plain,
! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[156]) ).
fof(158,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) )
| ~ ssItem(X3) ),
inference(shift_quantors,[status(thm)],[157]) ).
fof(159,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[158]) ).
cnf(161,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[159]) ).
fof(213,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ totalorderedP(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| leq(X2,X3) ) ) ) ) ) )
& ( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssItem(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
& ~ leq(X2,X3) ) ) ) ) )
| totalorderedP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(214,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ totalorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9) ) ) ) ) ) )
& ( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& app(app(X15,cons(X13,X16)),cons(X14,X17)) = X7
& ~ leq(X13,X14) ) ) ) ) )
| totalorderedP(X7) ) ) ),
inference(variable_rename,[status(thm)],[213]) ).
fof(215,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ totalorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9) ) ) ) ) ) )
& ( ( ssItem(esk8_1(X7))
& ssItem(esk9_1(X7))
& ssList(esk10_1(X7))
& ssList(esk11_1(X7))
& ssList(esk12_1(X7))
& app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7))) = X7
& ~ leq(esk8_1(X7),esk9_1(X7)) )
| totalorderedP(X7) ) ) ),
inference(skolemize,[status(esa)],[214]) ).
fof(216,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ totalorderedP(X7) )
& ( ( ssItem(esk8_1(X7))
& ssItem(esk9_1(X7))
& ssList(esk10_1(X7))
& ssList(esk11_1(X7))
& ssList(esk12_1(X7))
& app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7))) = X7
& ~ leq(esk8_1(X7),esk9_1(X7)) )
| totalorderedP(X7) ) )
| ~ ssList(X7) ),
inference(shift_quantors,[status(thm)],[215]) ).
fof(217,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk8_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk9_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk10_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk11_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk12_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7))) = X7
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ~ leq(esk8_1(X7),esk9_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[216]) ).
cnf(218,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk8_1(X1),esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(219,plain,
( totalorderedP(X1)
| app(app(esk10_1(X1),cons(esk8_1(X1),esk11_1(X1))),cons(esk9_1(X1),esk12_1(X1))) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(220,plain,
( totalorderedP(X1)
| ssList(esk12_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(221,plain,
( totalorderedP(X1)
| ssList(esk11_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(222,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(223,plain,
( totalorderedP(X1)
| ssItem(esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(224,plain,
( totalorderedP(X1)
| ssItem(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
fof(226,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ strictorderedP(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| lt(X2,X3) ) ) ) ) ) )
& ( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssItem(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
& ~ lt(X2,X3) ) ) ) ) )
| strictorderedP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(227,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ strictorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9) ) ) ) ) ) )
& ( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& app(app(X15,cons(X13,X16)),cons(X14,X17)) = X7
& ~ lt(X13,X14) ) ) ) ) )
| strictorderedP(X7) ) ) ),
inference(variable_rename,[status(thm)],[226]) ).
fof(228,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ strictorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9) ) ) ) ) ) )
& ( ( ssItem(esk13_1(X7))
& ssItem(esk14_1(X7))
& ssList(esk15_1(X7))
& ssList(esk16_1(X7))
& ssList(esk17_1(X7))
& app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7))) = X7
& ~ lt(esk13_1(X7),esk14_1(X7)) )
| strictorderedP(X7) ) ) ),
inference(skolemize,[status(esa)],[227]) ).
fof(229,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ strictorderedP(X7) )
& ( ( ssItem(esk13_1(X7))
& ssItem(esk14_1(X7))
& ssList(esk15_1(X7))
& ssList(esk16_1(X7))
& ssList(esk17_1(X7))
& app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7))) = X7
& ~ lt(esk13_1(X7),esk14_1(X7)) )
| strictorderedP(X7) ) )
| ~ ssList(X7) ),
inference(shift_quantors,[status(thm)],[228]) ).
fof(230,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk13_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk14_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk15_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk16_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk17_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7))) = X7
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ~ lt(esk13_1(X7),esk14_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[229]) ).
cnf(238,plain,
( lt(X2,X3)
| ~ ssList(X1)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6) ),
inference(split_conjunct,[status(thm)],[230]) ).
fof(270,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& segmentP(X4,X3)
& strictorderedP(X3)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X3,X5)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X3)
| ~ strictorderedP(X5) )
& ~ totalorderedP(X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(271,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& segmentP(X9,X8)
& strictorderedP(X8)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X8,X10)
| ~ segmentP(X9,X10)
| ~ segmentP(X10,X8)
| ~ strictorderedP(X10) )
& ~ totalorderedP(X6) ) ) ) ),
inference(variable_rename,[status(thm)],[270]) ).
fof(272,negated_conjecture,
( ssList(esk18_0)
& ssList(esk19_0)
& ssList(esk20_0)
& ssList(esk21_0)
& esk19_0 = esk21_0
& esk18_0 = esk20_0
& segmentP(esk21_0,esk20_0)
& strictorderedP(esk20_0)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(esk20_0,X10)
| ~ segmentP(esk21_0,X10)
| ~ segmentP(X10,esk20_0)
| ~ strictorderedP(X10) )
& ~ totalorderedP(esk18_0) ),
inference(skolemize,[status(esa)],[271]) ).
fof(273,negated_conjecture,
! [X10] :
( ( ~ ssList(X10)
| ~ neq(esk20_0,X10)
| ~ segmentP(esk21_0,X10)
| ~ segmentP(X10,esk20_0)
| ~ strictorderedP(X10) )
& ssList(esk21_0)
& esk19_0 = esk21_0
& esk18_0 = esk20_0
& segmentP(esk21_0,esk20_0)
& strictorderedP(esk20_0)
& ~ totalorderedP(esk18_0)
& ssList(esk20_0)
& ssList(esk19_0)
& ssList(esk18_0) ),
inference(shift_quantors,[status(thm)],[272]) ).
cnf(276,negated_conjecture,
ssList(esk20_0),
inference(split_conjunct,[status(thm)],[273]) ).
cnf(277,negated_conjecture,
~ totalorderedP(esk18_0),
inference(split_conjunct,[status(thm)],[273]) ).
cnf(278,negated_conjecture,
strictorderedP(esk20_0),
inference(split_conjunct,[status(thm)],[273]) ).
cnf(280,negated_conjecture,
esk18_0 = esk20_0,
inference(split_conjunct,[status(thm)],[273]) ).
cnf(286,negated_conjecture,
~ totalorderedP(esk20_0),
inference(rw,[status(thm)],[277,280,theory(equality)]) ).
cnf(382,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk8_1(X1),esk9_1(X1))
| ~ ssItem(esk9_1(X1))
| ~ ssItem(esk8_1(X1)) ),
inference(spm,[status(thm)],[218,161,theory(equality)]) ).
cnf(568,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| X1 != X2
| ~ strictorderedP(X2)
| ~ ssList(esk12_1(X1))
| ~ ssList(esk11_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(X2)
| ~ ssItem(esk9_1(X1))
| ~ ssItem(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[238,219,theory(equality)]) ).
cnf(573,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk12_1(X1))
| ~ ssList(esk11_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(X1)
| ~ ssItem(esk9_1(X1))
| ~ ssItem(esk8_1(X1)) ),
inference(er,[status(thm)],[568,theory(equality)]) ).
cnf(1074,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk8_1(X1),esk9_1(X1))
| ~ ssItem(esk9_1(X1)) ),
inference(csr,[status(thm)],[382,224]) ).
cnf(1075,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk8_1(X1),esk9_1(X1)) ),
inference(csr,[status(thm)],[1074,223]) ).
cnf(14229,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk12_1(X1))
| ~ ssList(esk11_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(X1)
| ~ ssItem(esk9_1(X1)) ),
inference(csr,[status(thm)],[573,224]) ).
cnf(14230,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk12_1(X1))
| ~ ssList(esk11_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[14229,223]) ).
cnf(14231,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk12_1(X1))
| ~ ssList(esk11_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[14230,222]) ).
cnf(14232,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk12_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[14231,221]) ).
cnf(14233,plain,
( lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[14232,220]) ).
cnf(14234,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[14233,1075]) ).
cnf(14235,negated_conjecture,
( ~ strictorderedP(esk20_0)
| ~ ssList(esk20_0) ),
inference(spm,[status(thm)],[286,14234,theory(equality)]) ).
cnf(14242,negated_conjecture,
( $false
| ~ ssList(esk20_0) ),
inference(rw,[status(thm)],[14235,278,theory(equality)]) ).
cnf(14243,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[14242,276,theory(equality)]) ).
cnf(14244,negated_conjecture,
$false,
inference(cn,[status(thm)],[14243,theory(equality)]) ).
cnf(14245,negated_conjecture,
$false,
14244,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC273+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpTLfARn/sel_SWC273+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC273+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC273+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC273+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
%
%------------------------------------------------------------------------------