%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC042+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:08:20 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 222 ( 113 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 278 ( 94 ~; 87 |; 78 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 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 : 69 ( 0 sgn 44 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpTX1Q8r/sel_SWC042+1.p_1',ax84) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpTX1Q8r/sel_SWC042+1.p_1',ax83) ).
fof(28,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpTX1Q8r/sel_SWC042+1.p_1',co1) ).
fof(29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[29,theory(equality)]) ).
fof(48,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(49,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[48]) ).
cnf(50,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( nil != app(X1,X2)
| ( nil = X2
& nil = X1 ) )
& ( nil != X2
| nil != X1
| nil = app(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(52,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[52]) ).
fof(54,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(57,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(153,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& nil = X2
& X2 = X4
& X1 = X3
& nil != X1
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& totalorderedP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X3
| ~ leq(X8,X6) ) ) ) ) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(154,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& nil = X11
& X11 = X13
& X10 = X12
& nil != X10
& ? [X14] :
( ssList(X14)
& app(X12,X14) = X13
& totalorderedP(X12)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != X14
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != X12
| ~ leq(X17,X15) ) ) ) ) )
& ( nil = X13
| nil != X12 ) ) ) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& nil = esk12_0
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& nil != esk11_0
& ssList(esk15_0)
& app(esk13_0,esk15_0) = esk14_0
& totalorderedP(esk13_0)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk13_0
| ~ leq(X17,X15) ) ) ) )
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk13_0
| ~ leq(X17,X15)
| ~ ssItem(X17)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ~ ssItem(X15) )
& app(esk13_0,esk15_0) = esk14_0
& totalorderedP(esk13_0)
& ssList(esk15_0)
& nil = esk12_0
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& nil != esk11_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[155]) ).
cnf(157,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(162,negated_conjecture,
nil != esk11_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(163,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(164,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(165,negated_conjecture,
nil = esk12_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(166,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(168,negated_conjecture,
app(esk13_0,esk15_0) = esk14_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(172,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[157,163,theory(equality)]) ).
cnf(173,negated_conjecture,
esk14_0 = nil,
inference(rw,[status(thm)],[164,165,theory(equality)]) ).
cnf(176,negated_conjecture,
esk13_0 != nil,
inference(rw,[status(thm)],[162,163,theory(equality)]) ).
cnf(178,negated_conjecture,
app(esk13_0,esk15_0) = nil,
inference(rw,[status(thm)],[168,173,theory(equality)]) ).
cnf(194,negated_conjecture,
( nil = esk15_0
| ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[57,178,theory(equality)]) ).
cnf(333,negated_conjecture,
( esk15_0 = nil
| ~ ssList(esk15_0)
| $false ),
inference(rw,[status(thm)],[194,172,theory(equality)]) ).
cnf(334,negated_conjecture,
( esk15_0 = nil
| ~ ssList(esk15_0) ),
inference(cn,[status(thm)],[333,theory(equality)]) ).
cnf(335,negated_conjecture,
esk15_0 = nil,
inference(spm,[status(thm)],[334,166,theory(equality)]) ).
cnf(336,negated_conjecture,
app(esk13_0,nil) = nil,
inference(rw,[status(thm)],[178,335,theory(equality)]) ).
cnf(343,negated_conjecture,
( nil = esk13_0
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[50,336,theory(equality)]) ).
cnf(353,negated_conjecture,
( nil = esk13_0
| $false ),
inference(rw,[status(thm)],[343,172,theory(equality)]) ).
cnf(354,negated_conjecture,
nil = esk13_0,
inference(cn,[status(thm)],[353,theory(equality)]) ).
cnf(355,negated_conjecture,
$false,
inference(sr,[status(thm)],[354,176,theory(equality)]) ).
cnf(356,negated_conjecture,
$false,
355,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC042+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpTX1Q8r/sel_SWC042+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC042+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC042+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC042+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
%
%------------------------------------------------------------------------------