TSTP Solution File: SWC242+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC242+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:03:53 EST 2010
% Result : Theorem 0.40s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 41 ( 8 unt; 0 def)
% Number of atoms : 342 ( 86 equ)
% Maximal formula atoms : 46 ( 8 avg)
% Number of connectives : 466 ( 165 ~; 167 |; 116 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 102 ( 0 sgn 54 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(25,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/tmp/tmp9kEjIY/sel_SWC242+1.p_1',ax93) ).
fof(30,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X9,X12)
& memberP(X10,X12)
& memberP(X11,X12)
& lt(X9,X12) ) ) ) ) ) ) ) ) ),
file('/tmp/tmp9kEjIY/sel_SWC242+1.p_1',co1) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X9,X12)
& memberP(X10,X12)
& memberP(X11,X12)
& lt(X9,X12) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X9,X12)
& memberP(X10,X12)
& memberP(X11,X12)
& lt(X9,X12) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[31,theory(equality)]) ).
fof(143,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(144,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)],[143]) ).
fof(145,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)],[144]) ).
fof(146,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)],[145]) ).
cnf(148,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[146]) ).
fof(167,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& nil != X1
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& memberP(X7,X8)
& lt(X5,X8)
& ~ leq(X5,X8) ) ) ) )
& ( nil = X3
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(app(X10,cons(X9,nil)),X11) = X3
& ! [X12] :
( ~ ssItem(X12)
| leq(X9,X12)
| ~ memberP(X10,X12)
| ~ memberP(X11,X12)
| ~ lt(X9,X12) ) ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(168,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& nil != X13
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != X13
| ? [X20] :
( ssItem(X20)
& memberP(X18,X20)
& memberP(X19,X20)
& lt(X17,X20)
& ~ leq(X17,X20) ) ) ) )
& ( nil = X15
| ? [X21] :
( ssItem(X21)
& ? [X22] :
( ssList(X22)
& ? [X23] :
( ssList(X23)
& app(app(X22,cons(X21,nil)),X23) = X15
& ! [X24] :
( ~ ssItem(X24)
| leq(X21,X24)
| ~ memberP(X22,X24)
| ~ memberP(X23,X24)
| ~ lt(X21,X24) ) ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[167]) ).
fof(169,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ( ssItem(esk11_3(X17,X18,X19))
& memberP(X18,esk11_3(X17,X18,X19))
& memberP(X19,esk11_3(X17,X18,X19))
& lt(X17,esk11_3(X17,X18,X19))
& ~ leq(X17,esk11_3(X17,X18,X19)) ) ) ) )
& ( nil = esk9_0
| ( ssItem(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk9_0
& ! [X24] :
( ~ ssItem(X24)
| leq(esk12_0,X24)
| ~ memberP(esk13_0,X24)
| ~ memberP(esk14_0,X24)
| ~ lt(esk12_0,X24) ) ) ) ),
inference(skolemize,[status(esa)],[168]) ).
fof(170,negated_conjecture,
! [X17,X18,X19,X24] :
( ( ( ( ~ ssItem(X24)
| leq(esk12_0,X24)
| ~ memberP(esk13_0,X24)
| ~ memberP(esk14_0,X24)
| ~ lt(esk12_0,X24) )
& ssList(esk14_0)
& app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk9_0
& ssList(esk13_0)
& ssItem(esk12_0) )
| nil = esk9_0 )
& ( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ( ssItem(esk11_3(X17,X18,X19))
& memberP(X18,esk11_3(X17,X18,X19))
& memberP(X19,esk11_3(X17,X18,X19))
& lt(X17,esk11_3(X17,X18,X19))
& ~ leq(X17,esk11_3(X17,X18,X19)) )
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[169]) ).
fof(171,negated_conjecture,
! [X17,X18,X19,X24] :
( ( ~ ssItem(X24)
| leq(esk12_0,X24)
| ~ memberP(esk13_0,X24)
| ~ memberP(esk14_0,X24)
| ~ lt(esk12_0,X24)
| nil = esk9_0 )
& ( ssList(esk14_0)
| nil = esk9_0 )
& ( app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk9_0
| nil = esk9_0 )
& ( ssList(esk13_0)
| nil = esk9_0 )
& ( ssItem(esk12_0)
| nil = esk9_0 )
& ( ssItem(esk11_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk11_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk11_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( lt(X17,esk11_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(X17,esk11_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk7_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[170]) ).
cnf(175,negated_conjecture,
nil != esk7_0,
inference(split_conjunct,[status(thm)],[171]) ).
cnf(176,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[171]) ).
cnf(179,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3)
| ~ leq(X1,esk11_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(180,negated_conjecture,
( lt(X1,esk11_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(183,negated_conjecture,
( ssItem(esk11_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(184,negated_conjecture,
( nil = esk9_0
| ssItem(esk12_0) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(185,negated_conjecture,
( nil = esk9_0
| ssList(esk13_0) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(186,negated_conjecture,
( nil = esk9_0
| app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk9_0 ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(187,negated_conjecture,
( nil = esk9_0
| ssList(esk14_0) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(192,negated_conjecture,
( esk7_0 = nil
| ssList(esk13_0) ),
inference(rw,[status(thm)],[185,176,theory(equality)]) ).
cnf(193,negated_conjecture,
ssList(esk13_0),
inference(sr,[status(thm)],[192,175,theory(equality)]) ).
cnf(194,negated_conjecture,
( esk7_0 = nil
| ssList(esk14_0) ),
inference(rw,[status(thm)],[187,176,theory(equality)]) ).
cnf(195,negated_conjecture,
ssList(esk14_0),
inference(sr,[status(thm)],[194,175,theory(equality)]) ).
cnf(196,negated_conjecture,
( esk7_0 = nil
| ssItem(esk12_0) ),
inference(rw,[status(thm)],[184,176,theory(equality)]) ).
cnf(197,negated_conjecture,
ssItem(esk12_0),
inference(sr,[status(thm)],[196,175,theory(equality)]) ).
cnf(198,negated_conjecture,
( esk7_0 = nil
| app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk9_0 ),
inference(rw,[status(thm)],[186,176,theory(equality)]) ).
cnf(199,negated_conjecture,
( esk7_0 = nil
| app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk7_0 ),
inference(rw,[status(thm)],[198,176,theory(equality)]) ).
cnf(200,negated_conjecture,
app(app(esk13_0,cons(esk12_0,nil)),esk14_0) = esk7_0,
inference(sr,[status(thm)],[199,175,theory(equality)]) ).
cnf(339,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ lt(X2,esk11_3(X2,X1,X3))
| ~ ssItem(esk11_3(X2,X1,X3)) ),
inference(spm,[status(thm)],[179,148,theory(equality)]) ).
cnf(3407,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ lt(X2,esk11_3(X2,X1,X3))
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[339,183]) ).
cnf(3408,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[3407,180]) ).
cnf(3409,negated_conjecture,
( ~ ssItem(esk12_0)
| ~ ssList(esk14_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[3408,200,theory(equality)]) ).
cnf(3421,negated_conjecture,
( $false
| ~ ssList(esk14_0)
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[3409,197,theory(equality)]) ).
cnf(3422,negated_conjecture,
( $false
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[3421,195,theory(equality)]) ).
cnf(3423,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[3422,193,theory(equality)]) ).
cnf(3424,negated_conjecture,
$false,
inference(cn,[status(thm)],[3423,theory(equality)]) ).
cnf(3425,negated_conjecture,
$false,
3424,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC242+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp9kEjIY/sel_SWC242+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC242+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC242+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC242+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
%
%------------------------------------------------------------------------------