TSTP Solution File: SWC009+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC009+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:04:42 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 229 ( 86 equ)
% Maximal formula atoms : 23 ( 6 avg)
% Number of connectives : 308 ( 115 ~; 100 |; 77 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 46 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpa0nmAn/sel_SWC009+1.p_1',ax84) ).
fof(33,axiom,
ssList(nil),
file('/tmp/tmpa0nmAn/sel_SWC009+1.p_1',ax17) ).
fof(34,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X3,X8) != X4
| ~ strictorderedP(X3)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X3
& lt(X11,X9) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpa0nmAn/sel_SWC009+1.p_1',co1) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X3,X8) != X4
| ~ strictorderedP(X3)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X3
& lt(X11,X9) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(38,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X3,X8) != X4
| ~ strictorderedP(X3)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X3
& lt(X11,X9) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(51,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(52,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(186,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[33]) ).
fof(187,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X1 ) ) )
& ? [X8] :
( ssList(X8)
& app(X3,X8) = X4
& strictorderedP(X3)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X8
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X11,nil)) != X3
| ~ lt(X11,X9) ) ) ) ) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(188,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& ! [X17] :
( ~ ssList(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X17,X18),X19) != X14
| app(X17,X19) != X13 ) ) )
& ? [X20] :
( ssList(X20)
& app(X15,X20) = X16
& strictorderedP(X15)
& ! [X21] :
( ~ ssItem(X21)
| ! [X22] :
( ~ ssList(X22)
| app(cons(X21,nil),X22) != X20
| ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X23,nil)) != X15
| ~ lt(X23,X21) ) ) ) ) )
& ( nil = X16
| nil != X15 ) ) ) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ! [X17] :
( ~ ssList(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X17,X18),X19) != esk12_0
| app(X17,X19) != esk11_0 ) ) )
& ssList(esk15_0)
& app(esk13_0,esk15_0) = esk14_0
& strictorderedP(esk13_0)
& ! [X21] :
( ~ ssItem(X21)
| ! [X22] :
( ~ ssList(X22)
| app(cons(X21,nil),X22) != esk15_0
| ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X23,nil)) != esk13_0
| ~ lt(X23,X21) ) ) ) )
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X17,X18,X19,X21,X22,X23,X24] :
( ( ~ ssList(X24)
| app(X24,cons(X23,nil)) != esk13_0
| ~ lt(X23,X21)
| ~ ssItem(X23)
| ~ ssList(X22)
| app(cons(X21,nil),X22) != esk15_0
| ~ ssItem(X21) )
& app(esk13_0,esk15_0) = esk14_0
& strictorderedP(esk13_0)
& ssList(esk15_0)
& ( ~ ssList(X19)
| app(app(X17,X18),X19) != esk12_0
| app(X17,X19) != esk11_0
| ~ ssList(X18)
| ~ ssList(X17) )
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[189]) ).
cnf(191,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(192,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(196,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(197,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(198,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X3) != esk11_0
| app(app(X1,X2),X3) != esk12_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(199,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(201,negated_conjecture,
app(esk13_0,esk15_0) = esk14_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(203,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[191,196,theory(equality)]) ).
cnf(204,negated_conjecture,
ssList(esk14_0),
inference(rw,[status(thm)],[192,197,theory(equality)]) ).
cnf(353,negated_conjecture,
( app(X1,X3) != esk13_0
| app(app(X1,X2),X3) != esk12_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[198,196,theory(equality)]) ).
cnf(354,negated_conjecture,
( app(X1,X3) != esk13_0
| app(app(X1,X2),X3) != esk14_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[353,197,theory(equality)]) ).
cnf(355,negated_conjecture,
( app(esk14_0,X1) != esk14_0
| app(esk13_0,X1) != esk13_0
| ~ ssList(X1)
| ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[354,201,theory(equality)]) ).
cnf(610,negated_conjecture,
( app(esk14_0,X1) != esk14_0
| app(esk13_0,X1) != esk13_0
| ~ ssList(X1)
| ~ ssList(esk15_0)
| $false ),
inference(rw,[status(thm)],[355,203,theory(equality)]) ).
cnf(611,negated_conjecture,
( app(esk14_0,X1) != esk14_0
| app(esk13_0,X1) != esk13_0
| ~ ssList(X1)
| ~ ssList(esk15_0) ),
inference(cn,[status(thm)],[610,theory(equality)]) ).
cnf(613,negated_conjecture,
( app(esk13_0,nil) != esk13_0
| ~ ssList(esk15_0)
| ~ ssList(nil)
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[611,53,theory(equality)]) ).
cnf(615,negated_conjecture,
( app(esk13_0,nil) != esk13_0
| ~ ssList(esk15_0)
| $false
| ~ ssList(esk14_0) ),
inference(rw,[status(thm)],[613,186,theory(equality)]) ).
cnf(616,negated_conjecture,
( app(esk13_0,nil) != esk13_0
| ~ ssList(esk15_0)
| $false
| $false ),
inference(rw,[status(thm)],[615,204,theory(equality)]) ).
cnf(617,negated_conjecture,
( app(esk13_0,nil) != esk13_0
| ~ ssList(esk15_0) ),
inference(cn,[status(thm)],[616,theory(equality)]) ).
cnf(643,negated_conjecture,
( ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[617,53,theory(equality)]) ).
cnf(645,negated_conjecture,
( ~ ssList(esk15_0)
| $false ),
inference(rw,[status(thm)],[643,203,theory(equality)]) ).
cnf(646,negated_conjecture,
~ ssList(esk15_0),
inference(cn,[status(thm)],[645,theory(equality)]) ).
cnf(653,negated_conjecture,
$false,
inference(sr,[status(thm)],[199,646,theory(equality)]) ).
cnf(654,negated_conjecture,
$false,
653,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC009+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpa0nmAn/sel_SWC009+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC009+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC009+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC009+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
%
%------------------------------------------------------------------------------