TSTP Solution File: SWC213+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC213+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 10:52:24 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 232 ( 84 equ)
% Maximal formula atoms : 24 ( 6 avg)
% Number of connectives : 294 ( 97 ~; 89 |; 87 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 52 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpOSjfeP/sel_SWC213+1.p_1',ax15) ).
fof(15,axiom,
ssList(nil),
file('/tmp/tmpOSjfeP/sel_SWC213+1.p_1',ax17) ).
fof(22,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) ) )
| neq(X1,nil)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpOSjfeP/sel_SWC213+1.p_1',co1) ).
fof(23,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) ) )
| neq(X1,nil)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[22]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) ) )
| neq(X1,nil)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[23,theory(equality)]) ).
fof(83,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(84,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[83]) ).
fof(85,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[84]) ).
fof(86,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)],[85]) ).
cnf(87,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(93,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[15]) ).
fof(121,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X3),X6) = X4
& equalelemsP(X3)
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X5
| ! [X9] :
( ~ ssList(X9)
| app(cons(X7,nil),X9) != X3 ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X6
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X10,nil)) != X3 ) ) ) ) )
& ~ neq(X1,nil)
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(122,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& neq(X14,nil)
& ? [X17] :
( ssList(X17)
& ? [X18] :
( ssList(X18)
& app(app(X17,X15),X18) = X16
& equalelemsP(X15)
& ! [X19] :
( ~ ssItem(X19)
| ! [X20] :
( ~ ssList(X20)
| app(X20,cons(X19,nil)) != X17
| ! [X21] :
( ~ ssList(X21)
| app(cons(X19,nil),X21) != X15 ) ) )
& ! [X22] :
( ~ ssItem(X22)
| ! [X23] :
( ~ ssList(X23)
| app(cons(X22,nil),X23) != X18
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X22,nil)) != X15 ) ) ) ) )
& ~ neq(X13,nil)
& ( nil = X16
| nil != X15 ) ) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,negated_conjecture,
( ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& neq(esk10_0,nil)
& ssList(esk13_0)
& ssList(esk14_0)
& app(app(esk13_0,esk11_0),esk14_0) = esk12_0
& equalelemsP(esk11_0)
& ! [X19] :
( ~ ssItem(X19)
| ! [X20] :
( ~ ssList(X20)
| app(X20,cons(X19,nil)) != esk13_0
| ! [X21] :
( ~ ssList(X21)
| app(cons(X19,nil),X21) != esk11_0 ) ) )
& ! [X22] :
( ~ ssItem(X22)
| ! [X23] :
( ~ ssList(X23)
| app(cons(X22,nil),X23) != esk14_0
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk11_0 ) ) )
& ~ neq(esk9_0,nil)
& ( nil = esk12_0
| nil != esk11_0 ) ),
inference(skolemize,[status(esa)],[122]) ).
fof(124,negated_conjecture,
! [X19,X20,X21,X22,X23,X24] :
( ( ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk11_0
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk14_0
| ~ ssItem(X22) )
& ( ~ ssList(X21)
| app(cons(X19,nil),X21) != esk11_0
| ~ ssList(X20)
| app(X20,cons(X19,nil)) != esk13_0
| ~ ssItem(X19) )
& app(app(esk13_0,esk11_0),esk14_0) = esk12_0
& equalelemsP(esk11_0)
& ssList(esk14_0)
& ssList(esk13_0)
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& neq(esk10_0,nil)
& ~ neq(esk9_0,nil)
& ( nil = esk12_0
| nil != esk11_0 )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0)
& ssList(esk9_0) ),
inference(shift_quantors,[status(thm)],[123]) ).
cnf(125,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(129,negated_conjecture,
( nil = esk12_0
| nil != esk11_0 ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(130,negated_conjecture,
~ neq(esk9_0,nil),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(131,negated_conjecture,
neq(esk10_0,nil),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(132,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[124]) ).
cnf(133,negated_conjecture,
esk10_0 = esk12_0,
inference(split_conjunct,[status(thm)],[124]) ).
cnf(140,negated_conjecture,
ssList(esk11_0),
inference(rw,[status(thm)],[125,132,theory(equality)]) ).
cnf(142,negated_conjecture,
neq(esk12_0,nil),
inference(rw,[status(thm)],[131,133,theory(equality)]) ).
cnf(143,negated_conjecture,
~ neq(esk11_0,nil),
inference(rw,[status(thm)],[130,132,theory(equality)]) ).
cnf(152,negated_conjecture,
( esk11_0 = nil
| ~ ssList(nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[143,87,theory(equality)]) ).
cnf(153,negated_conjecture,
( esk11_0 = nil
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[152,93,theory(equality)]) ).
cnf(154,negated_conjecture,
( esk11_0 = nil
| ~ ssList(esk11_0) ),
inference(cn,[status(thm)],[153,theory(equality)]) ).
cnf(283,negated_conjecture,
( esk11_0 = nil
| $false ),
inference(rw,[status(thm)],[154,140,theory(equality)]) ).
cnf(284,negated_conjecture,
esk11_0 = nil,
inference(cn,[status(thm)],[283,theory(equality)]) ).
cnf(292,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[143,284,theory(equality)]) ).
cnf(295,negated_conjecture,
( esk12_0 = nil
| $false ),
inference(rw,[status(thm)],[129,284,theory(equality)]) ).
cnf(296,negated_conjecture,
esk12_0 = nil,
inference(cn,[status(thm)],[295,theory(equality)]) ).
cnf(299,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[142,296,theory(equality)]) ).
cnf(306,negated_conjecture,
$false,
inference(sr,[status(thm)],[299,292,theory(equality)]) ).
cnf(307,negated_conjecture,
$false,
306,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC213+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpOSjfeP/sel_SWC213+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC213+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC213+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC213+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
%
%------------------------------------------------------------------------------