TSTP Solution File: SWC247+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC247+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 11:04:34 EST 2010
% Result : Theorem 0.35s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 7 unt; 0 def)
% Number of atoms : 359 ( 82 equ)
% Maximal formula atoms : 39 ( 6 avg)
% Number of connectives : 490 ( 189 ~; 174 |; 104 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 131 ( 0 sgn 63 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax81) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax28) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax20) ).
fof(39,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax16) ).
fof(40,axiom,
ssList(nil),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax17) ).
fof(44,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',ax38) ).
fof(55,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmpmHjDoQ/sel_SWC247+1.p_1',co1) ).
fof(56,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[55]) ).
fof(59,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).
fof(60,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[56,theory(equality)]) ).
fof(92,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(93,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[93]) ).
cnf(95,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(109,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(110,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[109]) ).
cnf(111,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[110]) ).
fof(131,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(132,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssItem(X6)
& cons(X6,X5) = X4 ) ) ),
inference(variable_rename,[status(thm)],[131]) ).
fof(133,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)],[132]) ).
fof(134,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)],[133]) ).
cnf(135,plain,
( nil = X1
| cons(esk2_1(X1),esk1_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[134]) ).
cnf(136,plain,
( nil = X1
| ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[134]) ).
cnf(137,plain,
( nil = X1
| ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[134]) ).
fof(241,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(242,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[241]) ).
fof(243,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[242]) ).
cnf(244,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[243]) ).
cnf(245,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[40]) ).
fof(270,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(271,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[270]) ).
cnf(272,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[271]) ).
fof(317,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& frontsegP(X4,X3)
& totalorderedP(X3)
& nil != X1
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X3,X5)
| ~ frontsegP(X4,X5)
| ~ segmentP(X5,X3)
| ~ totalorderedP(X5) )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(X7,cons(X6,nil)),X8) != X1
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& memberP(X8,X9)
& lt(X6,X9)
& ~ leq(X6,X9) ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(318,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& frontsegP(X13,X12)
& totalorderedP(X12)
& nil != X10
& ! [X14] :
( ~ ssList(X14)
| ~ neq(X12,X14)
| ~ frontsegP(X13,X14)
| ~ segmentP(X14,X12)
| ~ totalorderedP(X14) )
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != X10
| ? [X18] :
( ssItem(X18)
& memberP(X16,X18)
& memberP(X17,X18)
& lt(X15,X18)
& ~ leq(X15,X18) ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[317]) ).
fof(319,negated_conjecture,
( ssList(esk16_0)
& ssList(esk17_0)
& ssList(esk18_0)
& ssList(esk19_0)
& esk17_0 = esk19_0
& esk16_0 = esk18_0
& frontsegP(esk19_0,esk18_0)
& totalorderedP(esk18_0)
& nil != esk16_0
& ! [X14] :
( ~ ssList(X14)
| ~ neq(esk18_0,X14)
| ~ frontsegP(esk19_0,X14)
| ~ segmentP(X14,esk18_0)
| ~ totalorderedP(X14) )
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ( ssItem(esk20_3(X15,X16,X17))
& memberP(X16,esk20_3(X15,X16,X17))
& memberP(X17,esk20_3(X15,X16,X17))
& lt(X15,esk20_3(X15,X16,X17))
& ~ leq(X15,esk20_3(X15,X16,X17)) ) ) ) ) ),
inference(skolemize,[status(esa)],[318]) ).
fof(320,negated_conjecture,
! [X14,X15,X16,X17] :
( ( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ( ssItem(esk20_3(X15,X16,X17))
& memberP(X16,esk20_3(X15,X16,X17))
& memberP(X17,esk20_3(X15,X16,X17))
& lt(X15,esk20_3(X15,X16,X17))
& ~ leq(X15,esk20_3(X15,X16,X17)) )
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ ssList(X14)
| ~ neq(esk18_0,X14)
| ~ frontsegP(esk19_0,X14)
| ~ segmentP(X14,esk18_0)
| ~ totalorderedP(X14) )
& esk17_0 = esk19_0
& esk16_0 = esk18_0
& frontsegP(esk19_0,esk18_0)
& totalorderedP(esk18_0)
& nil != esk16_0
& ssList(esk19_0)
& ssList(esk18_0)
& ssList(esk17_0)
& ssList(esk16_0) ),
inference(shift_quantors,[status(thm)],[319]) ).
fof(321,negated_conjecture,
! [X14,X15,X16,X17] :
( ( ssItem(esk20_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X16,esk20_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X17,esk20_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( lt(X15,esk20_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ leq(X15,esk20_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk16_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ ssList(X14)
| ~ neq(esk18_0,X14)
| ~ frontsegP(esk19_0,X14)
| ~ segmentP(X14,esk18_0)
| ~ totalorderedP(X14) )
& esk17_0 = esk19_0
& esk16_0 = esk18_0
& frontsegP(esk19_0,esk18_0)
& totalorderedP(esk18_0)
& nil != esk16_0
& ssList(esk19_0)
& ssList(esk18_0)
& ssList(esk17_0)
& ssList(esk16_0) ),
inference(distribute,[status(thm)],[320]) ).
cnf(322,negated_conjecture,
ssList(esk16_0),
inference(split_conjunct,[status(thm)],[321]) ).
cnf(326,negated_conjecture,
nil != esk16_0,
inference(split_conjunct,[status(thm)],[321]) ).
cnf(335,negated_conjecture,
( memberP(X2,esk20_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk16_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[321]) ).
cnf(336,negated_conjecture,
( ssItem(esk20_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk16_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[321]) ).
cnf(644,negated_conjecture,
( ~ ssItem(esk20_3(X1,nil,X2))
| app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| ~ ssList(nil)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[272,335,theory(equality)]) ).
cnf(647,negated_conjecture,
( ~ ssItem(esk20_3(X1,nil,X2))
| app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| $false
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[644,245,theory(equality)]) ).
cnf(648,negated_conjecture,
( ~ ssItem(esk20_3(X1,nil,X2))
| app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[647,theory(equality)]) ).
cnf(1099,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[648,336,theory(equality)]) ).
cnf(1100,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[1099,245,theory(equality)]) ).
cnf(1101,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[1100,theory(equality)]) ).
cnf(1103,negated_conjecture,
( app(cons(X1,nil),X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[1101,111,theory(equality)]) ).
cnf(1513,negated_conjecture,
( cons(X1,X2) != esk16_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[1103,95,theory(equality)]) ).
cnf(1614,negated_conjecture,
( cons(X1,X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[1513,244,theory(equality)]) ).
cnf(1615,negated_conjecture,
( cons(X1,X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[1614,245,theory(equality)]) ).
cnf(1616,negated_conjecture,
( cons(X1,X2) != esk16_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[1615,theory(equality)]) ).
cnf(1617,negated_conjecture,
( nil = X1
| X1 != esk16_0
| ~ ssList(esk1_1(X1))
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[1616,135,theory(equality)]) ).
cnf(2173,negated_conjecture,
( nil = X1
| X1 != esk16_0
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[1617,136]) ).
cnf(2174,negated_conjecture,
( nil = X1
| X1 != esk16_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2173,137]) ).
cnf(2175,negated_conjecture,
nil = esk16_0,
inference(spm,[status(thm)],[2174,322,theory(equality)]) ).
cnf(2188,negated_conjecture,
$false,
inference(sr,[status(thm)],[2175,326,theory(equality)]) ).
cnf(2189,negated_conjecture,
$false,
2188,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC247+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpmHjDoQ/sel_SWC247+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC247+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC247+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC247+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
%
%------------------------------------------------------------------------------