TSTP Solution File: SWC041+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC041+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:10 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 190 ( 102 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 245 ( 83 ~; 72 |; 72 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 37 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpwRYW4Z/sel_SWC041+1.p_1',ax83) ).
fof(20,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
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpwRYW4Z/sel_SWC041+1.p_1',co1) ).
fof(21,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
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[20]) ).
fof(22,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
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(47,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)],[8]) ).
fof(48,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)],[47]) ).
fof(49,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)],[48]) ).
fof(50,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)],[49]) ).
cnf(52,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(107,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
& equalelemsP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X3 ) ) ) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(108,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& nil = X10
& X10 = X12
& X9 = X11
& nil != X9
& ? [X13] :
( ssList(X13)
& app(X11,X13) = X12
& equalelemsP(X11)
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != X13
| ! [X16] :
( ~ ssList(X16)
| app(X16,cons(X14,nil)) != X11 ) ) ) )
& ( nil = X12
| nil != X11 ) ) ) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,negated_conjecture,
( ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& nil = esk10_0
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& nil != esk9_0
& ssList(esk13_0)
& app(esk11_0,esk13_0) = esk12_0
& equalelemsP(esk11_0)
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != esk13_0
| ! [X16] :
( ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk11_0 ) ) )
& ( nil = esk12_0
| nil != esk11_0 ) ),
inference(skolemize,[status(esa)],[108]) ).
fof(110,negated_conjecture,
! [X14,X15,X16] :
( ( ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk11_0
| ~ ssList(X15)
| app(cons(X14,nil),X15) != esk13_0
| ~ ssItem(X14) )
& app(esk11_0,esk13_0) = esk12_0
& equalelemsP(esk11_0)
& ssList(esk13_0)
& nil = esk10_0
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& nil != esk9_0
& ( nil = esk12_0
| nil != esk11_0 )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0)
& ssList(esk9_0) ),
inference(shift_quantors,[status(thm)],[109]) ).
cnf(113,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(116,negated_conjecture,
nil != esk9_0,
inference(split_conjunct,[status(thm)],[110]) ).
cnf(117,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[110]) ).
cnf(118,negated_conjecture,
esk10_0 = esk12_0,
inference(split_conjunct,[status(thm)],[110]) ).
cnf(119,negated_conjecture,
nil = esk10_0,
inference(split_conjunct,[status(thm)],[110]) ).
cnf(120,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(122,negated_conjecture,
app(esk11_0,esk13_0) = esk12_0,
inference(split_conjunct,[status(thm)],[110]) ).
cnf(127,negated_conjecture,
esk12_0 = nil,
inference(rw,[status(thm)],[118,119,theory(equality)]) ).
cnf(130,negated_conjecture,
esk11_0 != nil,
inference(rw,[status(thm)],[116,117,theory(equality)]) ).
cnf(132,negated_conjecture,
app(esk11_0,esk13_0) = nil,
inference(rw,[status(thm)],[122,127,theory(equality)]) ).
cnf(145,negated_conjecture,
( nil = esk11_0
| ~ ssList(esk13_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[52,132,theory(equality)]) ).
cnf(147,negated_conjecture,
( ~ ssList(esk13_0)
| ~ ssList(esk11_0) ),
inference(sr,[status(thm)],[145,130,theory(equality)]) ).
cnf(259,negated_conjecture,
~ ssList(esk11_0),
inference(spm,[status(thm)],[147,120,theory(equality)]) ).
cnf(260,negated_conjecture,
$false,
inference(sr,[status(thm)],[113,259,theory(equality)]) ).
cnf(261,negated_conjecture,
$false,
260,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC041+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpwRYW4Z/sel_SWC041+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC041+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC041+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC041+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
%
%------------------------------------------------------------------------------