TSTP Solution File: SWC391+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC391+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:42:02 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 69 ( 22 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 72 ( 18 ~; 12 |; 27 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 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 : 25 ( 0 sgn 15 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) ) ) ) ) ) ),
file('/tmp/tmpoz2Lhu/sel_SWC391+1.p_1',co1) ).
fof(22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) ) ) ) ) ) ),
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
| X4 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) ) ) ) ) ) ),
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
& X4 = X3
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(X2,X5) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(120,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& X9 = X8
& ? [X10] :
( ssItem(X10)
& memberP(X6,X10)
& ~ memberP(X7,X10) ) ) ) ) ),
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
& esk10_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk7_0,esk11_0)
& ~ memberP(esk8_0,esk11_0) ),
inference(skolemize,[status(esa)],[120]) ).
cnf(122,negated_conjecture,
~ memberP(esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,negated_conjecture,
memberP(esk7_0,esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(125,negated_conjecture,
esk10_0 = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(126,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(127,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(135,negated_conjecture,
esk10_0 = esk7_0,
inference(rw,[status(thm)],[125,126,theory(equality)]) ).
cnf(140,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[122,127,theory(equality)]),135,theory(equality)]),123,theory(equality)]) ).
cnf(141,negated_conjecture,
$false,
inference(cn,[status(thm)],[140,theory(equality)]) ).
cnf(142,negated_conjecture,
$false,
141,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC391+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpoz2Lhu/sel_SWC391+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC391+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC391+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC391+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
%
%------------------------------------------------------------------------------