TSTP Solution File: SWC279+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC279+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:11:53 EST 2010
% Result : Theorem 0.32s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 1
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 306 ( 38 equ)
% Maximal formula atoms : 33 ( 6 avg)
% Number of connectives : 390 ( 132 ~; 134 |; 100 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 44 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmp56h2bp/sel_SWC279+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X3
| ! [X8] :
( ~ ssItem(X8)
| ( ( leq(X5,X8)
| ~ memberP(X7,X8) )
& ( leq(X8,X5)
| ~ memberP(X6,X8) ) ) ) ) ) )
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(app(X10,cons(X9,nil)),X11) = X1
& ? [X12] :
( ssItem(X12)
& ( ( memberP(X10,X12)
& ~ leq(X12,X9) )
| ( memberP(X11,X12)
& ~ leq(X9,X12) ) ) ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(134,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != X15
| ! [X20] :
( ~ ssItem(X20)
| ( ( leq(X17,X20)
| ~ memberP(X19,X20) )
& ( leq(X20,X17)
| ~ memberP(X18,X20) ) ) ) ) ) )
& ? [X21] :
( ssItem(X21)
& ? [X22] :
( ssList(X22)
& ? [X23] :
( ssList(X23)
& app(app(X22,cons(X21,nil)),X23) = X13
& ? [X24] :
( ssItem(X24)
& ( ( memberP(X22,X24)
& ~ leq(X24,X21) )
| ( memberP(X23,X24)
& ~ leq(X21,X24) ) ) ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk9_0
| ! [X20] :
( ~ ssItem(X20)
| ( ( leq(X17,X20)
| ~ memberP(X19,X20) )
& ( leq(X20,X17)
| ~ memberP(X18,X20) ) ) ) ) ) )
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ssItem(esk14_0)
& ( ( memberP(esk12_0,esk14_0)
& ~ leq(esk14_0,esk11_0) )
| ( memberP(esk13_0,esk14_0)
& ~ leq(esk11_0,esk14_0) ) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
! [X17,X18,X19,X20] :
( ( ~ ssItem(X20)
| ( ( leq(X17,X20)
| ~ memberP(X19,X20) )
& ( leq(X20,X17)
| ~ memberP(X18,X20) ) )
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk9_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ssItem(esk14_0)
& ( ( memberP(esk12_0,esk14_0)
& ~ leq(esk14_0,esk11_0) )
| ( memberP(esk13_0,esk14_0)
& ~ leq(esk11_0,esk14_0) ) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[135]) ).
fof(137,negated_conjecture,
! [X17,X18,X19,X20] :
( ( leq(X17,X20)
| ~ memberP(X19,X20)
| ~ ssItem(X20)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk9_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X20,X17)
| ~ memberP(X18,X20)
| ~ ssItem(X20)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk9_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ssItem(esk14_0)
& ( memberP(esk13_0,esk14_0)
| memberP(esk12_0,esk14_0) )
& ( ~ leq(esk11_0,esk14_0)
| memberP(esk12_0,esk14_0) )
& ( memberP(esk13_0,esk14_0)
| ~ leq(esk14_0,esk11_0) )
& ( ~ leq(esk11_0,esk14_0)
| ~ leq(esk14_0,esk11_0) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
( ~ leq(esk14_0,esk11_0)
| ~ leq(esk11_0,esk14_0) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(143,negated_conjecture,
( memberP(esk13_0,esk14_0)
| ~ leq(esk14_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(144,negated_conjecture,
( memberP(esk12_0,esk14_0)
| ~ leq(esk11_0,esk14_0) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(145,negated_conjecture,
( memberP(esk12_0,esk14_0)
| memberP(esk13_0,esk14_0) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(146,negated_conjecture,
ssItem(esk14_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(147,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(148,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(149,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(150,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(151,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(153,negated_conjecture,
( leq(X4,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk9_0
| ~ ssList(X3)
| ~ ssItem(X4)
| ~ memberP(X2,X4) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(154,negated_conjecture,
( leq(X1,X4)
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk9_0
| ~ ssList(X3)
| ~ ssItem(X4)
| ~ memberP(X3,X4) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(157,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk9_0,
inference(rw,[status(thm)],[147,151,theory(equality)]) ).
cnf(295,negated_conjecture,
( leq(X1,esk11_0)
| ~ memberP(esk12_0,X1)
| ~ ssItem(X1)
| ~ ssItem(esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[153,157,theory(equality)]) ).
cnf(301,negated_conjecture,
( leq(X1,esk11_0)
| ~ memberP(esk12_0,X1)
| ~ ssItem(X1)
| $false
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[295,150,theory(equality)]) ).
cnf(302,negated_conjecture,
( leq(X1,esk11_0)
| ~ memberP(esk12_0,X1)
| ~ ssItem(X1)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[301,theory(equality)]) ).
cnf(310,negated_conjecture,
( leq(esk11_0,X1)
| ~ memberP(esk13_0,X1)
| ~ ssItem(X1)
| ~ ssItem(esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[154,157,theory(equality)]) ).
cnf(316,negated_conjecture,
( leq(esk11_0,X1)
| ~ memberP(esk13_0,X1)
| ~ ssItem(X1)
| $false
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[310,150,theory(equality)]) ).
cnf(317,negated_conjecture,
( leq(esk11_0,X1)
| ~ memberP(esk13_0,X1)
| ~ ssItem(X1)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[316,theory(equality)]) ).
cnf(382,negated_conjecture,
( leq(X1,esk11_0)
| ~ memberP(esk12_0,X1)
| ~ ssItem(X1)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[302,148,theory(equality)]) ).
cnf(383,negated_conjecture,
( leq(X1,esk11_0)
| ~ memberP(esk12_0,X1)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[382,149,theory(equality)]) ).
cnf(393,negated_conjecture,
( leq(esk11_0,X1)
| ~ memberP(esk13_0,X1)
| ~ ssItem(X1)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[317,148,theory(equality)]) ).
cnf(416,negated_conjecture,
( leq(esk11_0,X1)
| ~ memberP(esk13_0,X1)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[393,149,theory(equality)]) ).
cnf(417,negated_conjecture,
( leq(esk11_0,esk14_0)
| memberP(esk12_0,esk14_0)
| ~ ssItem(esk14_0) ),
inference(spm,[status(thm)],[416,145,theory(equality)]) ).
cnf(418,negated_conjecture,
( leq(esk11_0,esk14_0)
| memberP(esk12_0,esk14_0)
| $false ),
inference(rw,[status(thm)],[417,146,theory(equality)]) ).
cnf(419,negated_conjecture,
( leq(esk11_0,esk14_0)
| memberP(esk12_0,esk14_0) ),
inference(cn,[status(thm)],[418,theory(equality)]) ).
cnf(420,negated_conjecture,
memberP(esk12_0,esk14_0),
inference(csr,[status(thm)],[419,144]) ).
cnf(427,negated_conjecture,
( leq(esk14_0,esk11_0)
| ~ ssItem(esk14_0) ),
inference(spm,[status(thm)],[383,420,theory(equality)]) ).
cnf(444,negated_conjecture,
( leq(esk14_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[427,146,theory(equality)]) ).
cnf(445,negated_conjecture,
leq(esk14_0,esk11_0),
inference(cn,[status(thm)],[444,theory(equality)]) ).
cnf(468,negated_conjecture,
( ~ leq(esk11_0,esk14_0)
| $false ),
inference(rw,[status(thm)],[142,445,theory(equality)]) ).
cnf(469,negated_conjecture,
~ leq(esk11_0,esk14_0),
inference(cn,[status(thm)],[468,theory(equality)]) ).
cnf(470,negated_conjecture,
( memberP(esk13_0,esk14_0)
| $false ),
inference(rw,[status(thm)],[143,445,theory(equality)]) ).
cnf(471,negated_conjecture,
memberP(esk13_0,esk14_0),
inference(cn,[status(thm)],[470,theory(equality)]) ).
cnf(484,negated_conjecture,
( leq(esk11_0,esk14_0)
| ~ ssItem(esk14_0) ),
inference(spm,[status(thm)],[416,471,theory(equality)]) ).
cnf(497,negated_conjecture,
( leq(esk11_0,esk14_0)
| $false ),
inference(rw,[status(thm)],[484,146,theory(equality)]) ).
cnf(498,negated_conjecture,
leq(esk11_0,esk14_0),
inference(cn,[status(thm)],[497,theory(equality)]) ).
cnf(508,negated_conjecture,
$false,
inference(rw,[status(thm)],[469,498,theory(equality)]) ).
cnf(509,negated_conjecture,
$false,
inference(cn,[status(thm)],[508,theory(equality)]) ).
cnf(510,negated_conjecture,
$false,
509,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC279+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp56h2bp/sel_SWC279+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC279+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC279+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC279+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
%
%------------------------------------------------------------------------------