TSTP Solution File: SWC411+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC411+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 11:45:29 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 103 ( 16 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 115 ( 32 ~; 26 |; 42 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn 19 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ~ memberP(X3,X5)
& memberP(X4,X5) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| memberP(X1,X6) ) ) ) ) ) ) ),
file('/tmp/tmpr4TTU5/sel_SWC411+1.p_1',co1) ).
fof(22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ~ memberP(X3,X5)
& memberP(X4,X5) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| memberP(X1,X6) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ~ memberP(X3,X5)
& memberP(X4,X5) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| memberP(X1,X6) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(119,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| memberP(X3,X5)
| ~ memberP(X4,X5) )
& ? [X6] :
( ssItem(X6)
& memberP(X2,X6)
& ~ memberP(X1,X6) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(120,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ! [X11] :
( ~ ssItem(X11)
| memberP(X9,X11)
| ~ memberP(X10,X11) )
& ? [X12] :
( ssItem(X12)
& memberP(X8,X12)
& ~ memberP(X7,X12) ) ) ) ) ),
inference(variable_rename,[status(thm)],[119]) ).
fof(121,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X11] :
( ~ ssItem(X11)
| memberP(esk9_0,X11)
| ~ memberP(esk10_0,X11) )
& ssItem(esk11_0)
& memberP(esk8_0,esk11_0)
& ~ memberP(esk7_0,esk11_0) ),
inference(skolemize,[status(esa)],[120]) ).
fof(122,negated_conjecture,
! [X11] :
( ( ~ ssItem(X11)
| memberP(esk9_0,X11)
| ~ memberP(esk10_0,X11) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk8_0,esk11_0)
& ~ memberP(esk7_0,esk11_0)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[121]) ).
cnf(127,negated_conjecture,
~ memberP(esk7_0,esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(128,negated_conjecture,
memberP(esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(129,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(130,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[122]) ).
cnf(131,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[122]) ).
cnf(132,negated_conjecture,
( memberP(esk9_0,X1)
| ~ memberP(esk10_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(136,negated_conjecture,
memberP(esk10_0,esk11_0),
inference(rw,[status(thm)],[128,131,theory(equality)]) ).
cnf(137,negated_conjecture,
( memberP(esk7_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk10_0,X1) ),
inference(rw,[status(thm)],[132,130,theory(equality)]) ).
cnf(138,negated_conjecture,
( memberP(esk7_0,esk11_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[137,136,theory(equality)]) ).
cnf(139,negated_conjecture,
( memberP(esk7_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[138,129,theory(equality)]) ).
cnf(140,negated_conjecture,
memberP(esk7_0,esk11_0),
inference(cn,[status(thm)],[139,theory(equality)]) ).
cnf(141,negated_conjecture,
$false,
inference(sr,[status(thm)],[140,127,theory(equality)]) ).
cnf(142,negated_conjecture,
$false,
141,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC411+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpr4TTU5/sel_SWC411+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC411+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC411+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC411+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
%
%------------------------------------------------------------------------------