TSTP Solution File: SWC043+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC043+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 10:12:51 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 223 ( 108 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 284 ( 99 ~; 89 |; 78 &)
% ( 1 <=>; 17 =>; 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 : 67 ( 0 sgn 41 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmp4RtVR0/sel_SWC043+1.p_1',ax83) ).
fof(33,axiom,
ssList(nil),
file('/tmp/tmp4RtVR0/sel_SWC043+1.p_1',ax17) ).
fof(34,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
| ~ strictorderedP(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
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmp4RtVR0/sel_SWC043+1.p_1',co1) ).
fof(35,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
| ~ strictorderedP(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
& lt(X8,X6) ) ) ) ) ) )
| ( 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)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(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
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(54,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(55,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)],[54]) ).
fof(56,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)],[55]) ).
fof(57,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)],[56]) ).
cnf(59,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(60,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
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)
& nil = X2
& X2 = X4
& X1 = X3
& nil != X1
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& strictorderedP(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
| ~ lt(X8,X6) ) ) ) ) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(188,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
& strictorderedP(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
| ~ lt(X17,X15) ) ) ) ) )
& ( nil = X13
| nil != X12 ) ) ) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,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
& strictorderedP(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
| ~ lt(X17,X15) ) ) ) )
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk13_0
| ~ lt(X17,X15)
| ~ ssItem(X17)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ~ ssItem(X15) )
& app(esk13_0,esk15_0) = esk14_0
& strictorderedP(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)],[189]) ).
cnf(191,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(196,negated_conjecture,
nil != esk11_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(197,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(198,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(199,negated_conjecture,
nil = esk12_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(200,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(202,negated_conjecture,
app(esk13_0,esk15_0) = esk14_0,
inference(split_conjunct,[status(thm)],[190]) ).
cnf(206,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[191,197,theory(equality)]) ).
cnf(207,negated_conjecture,
esk14_0 = nil,
inference(rw,[status(thm)],[198,199,theory(equality)]) ).
cnf(210,negated_conjecture,
esk13_0 != nil,
inference(rw,[status(thm)],[196,197,theory(equality)]) ).
cnf(212,negated_conjecture,
app(esk13_0,esk15_0) = nil,
inference(rw,[status(thm)],[202,207,theory(equality)]) ).
cnf(231,negated_conjecture,
( nil = esk15_0
| ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[60,212,theory(equality)]) ).
cnf(236,negated_conjecture,
( nil = esk13_0
| ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[59,212,theory(equality)]) ).
cnf(239,negated_conjecture,
( ~ ssList(esk15_0)
| ~ ssList(esk13_0) ),
inference(sr,[status(thm)],[236,210,theory(equality)]) ).
cnf(398,negated_conjecture,
( ~ ssList(esk15_0)
| $false ),
inference(rw,[status(thm)],[239,206,theory(equality)]) ).
cnf(399,negated_conjecture,
~ ssList(esk15_0),
inference(cn,[status(thm)],[398,theory(equality)]) ).
cnf(400,negated_conjecture,
( esk15_0 = nil
| ~ ssList(esk15_0)
| $false ),
inference(rw,[status(thm)],[231,206,theory(equality)]) ).
cnf(401,negated_conjecture,
( esk15_0 = nil
| ~ ssList(esk15_0) ),
inference(cn,[status(thm)],[400,theory(equality)]) ).
cnf(402,negated_conjecture,
esk15_0 = nil,
inference(spm,[status(thm)],[401,200,theory(equality)]) ).
cnf(410,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[399,402,theory(equality)]),186,theory(equality)]) ).
cnf(411,negated_conjecture,
$false,
inference(cn,[status(thm)],[410,theory(equality)]) ).
cnf(412,negated_conjecture,
$false,
411,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC043+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp4RtVR0/sel_SWC043+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC043+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC043+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC043+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
%
%------------------------------------------------------------------------------