TSTP Solution File: SWC381+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC381+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 11:40:47 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 177 ( 43 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 212 ( 65 ~; 64 |; 68 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 20 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(23,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmp5-ahx_/sel_SWC381+1.p_1',co1) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X1
| ~ memberP(X2,X5) )
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X3
& memberP(X4,X6) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(134,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ( ( neq(X8,nil)
& ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X7
| ~ memberP(X8,X11) )
& ? [X12] :
( ssItem(X12)
& cons(X12,nil) = X9
& memberP(X10,X12) ) )
| ( neq(X8,nil)
& ~ neq(X10,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( neq(esk8_0,nil)
& ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
! [X11] :
( ( ( ( ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& neq(esk8_0,nil)
& ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[135]) ).
fof(137,negated_conjecture,
! [X11] :
( ( neq(esk8_0,nil)
| ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& ( ~ neq(esk10_0,nil)
| ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& ( neq(esk8_0,nil)
| neq(esk8_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk8_0,nil) )
& ( neq(esk8_0,nil)
| ssItem(esk11_0) )
& ( ~ neq(esk10_0,nil)
| ssItem(esk11_0) )
& ( neq(esk8_0,nil)
| cons(esk11_0,nil) = esk9_0 )
& ( ~ neq(esk10_0,nil)
| cons(esk11_0,nil) = esk9_0 )
& ( neq(esk8_0,nil)
| memberP(esk10_0,esk11_0) )
& ( ~ neq(esk10_0,nil)
| memberP(esk10_0,esk11_0) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(143,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(144,negated_conjecture,
( memberP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(146,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(148,negated_conjecture,
( ssItem(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(151,negated_conjecture,
( neq(esk8_0,nil)
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(152,negated_conjecture,
( ~ memberP(esk8_0,X1)
| cons(X1,nil) != esk7_0
| ~ ssItem(X1)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(159,negated_conjecture,
( ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[148,143,theory(equality)]),151,theory(equality)]) ).
cnf(160,negated_conjecture,
ssItem(esk11_0),
inference(cn,[status(thm)],[159,theory(equality)]) ).
cnf(163,negated_conjecture,
( memberP(esk8_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[144,143,theory(equality)]) ).
cnf(164,negated_conjecture,
( memberP(esk8_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[163,143,theory(equality)]),151,theory(equality)]) ).
cnf(165,negated_conjecture,
memberP(esk8_0,esk11_0),
inference(cn,[status(thm)],[164,theory(equality)]) ).
cnf(171,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[146,142,theory(equality)]) ).
cnf(172,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[171,143,theory(equality)]),151,theory(equality)]) ).
cnf(173,negated_conjecture,
cons(esk11_0,nil) = esk7_0,
inference(cn,[status(thm)],[172,theory(equality)]) ).
cnf(213,negated_conjecture,
( cons(X1,nil) != esk7_0
| ~ ssItem(X1)
| ~ memberP(esk8_0,X1)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[152,143,theory(equality)]),151,theory(equality)]) ).
cnf(214,negated_conjecture,
( cons(X1,nil) != esk7_0
| ~ ssItem(X1)
| ~ memberP(esk8_0,X1) ),
inference(cn,[status(thm)],[213,theory(equality)]) ).
cnf(215,negated_conjecture,
( ~ memberP(esk8_0,esk11_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[214,173,theory(equality)]) ).
cnf(216,negated_conjecture,
( $false
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[215,165,theory(equality)]) ).
cnf(217,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[216,160,theory(equality)]) ).
cnf(218,negated_conjecture,
$false,
inference(cn,[status(thm)],[217,theory(equality)]) ).
cnf(219,negated_conjecture,
$false,
218,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC381+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp5-ahx_/sel_SWC381+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC381+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC381+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC381+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
%
%------------------------------------------------------------------------------