TSTP Solution File: SWC407+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC407+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 11:48:59 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 15 unt; 0 def)
% Number of atoms : 230 ( 74 equ)
% Maximal formula atoms : 21 ( 5 avg)
% Number of connectives : 273 ( 88 ~; 100 |; 61 &)
% ( 1 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 37 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpgX0c4Q/sel_SWC407+1.p_1',ax38) ).
fof(13,axiom,
ssList(nil),
file('/tmp/tmpgX0c4Q/sel_SWC407+1.p_1',ax17) ).
fof(20,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpgX0c4Q/sel_SWC407+1.p_1',ax37) ).
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmpgX0c4Q/sel_SWC407+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(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(23,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(76,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(77,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[76]) ).
cnf(78,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(83,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[13]) ).
fof(112,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(cons(X2,X3),X1)
| X1 = X2
| memberP(X3,X1) )
& ( ( X1 != X2
& ~ memberP(X3,X1) )
| memberP(cons(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(113,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) )
| ~ ssItem(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[113]) ).
fof(115,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[114]) ).
cnf(118,plain,
( memberP(X3,X1)
| X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[115]) ).
fof(119,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(X2,X5) )
& ( ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X3
& memberP(X4,X6) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
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(X7,X11)
& ~ memberP(X8,X11) )
& ( ? [X12] :
( ssItem(X12)
& cons(X12,nil) = X9
& memberP(X10,X12) )
| ( nil = X10
& nil = X9 ) ) ) ) ) ),
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
& ssItem(esk11_0)
& memberP(esk7_0,esk11_0)
& ~ memberP(esk8_0,esk11_0)
& ( ( ssItem(esk12_0)
& cons(esk12_0,nil) = esk9_0
& memberP(esk10_0,esk12_0) )
| ( nil = esk10_0
& nil = esk9_0 ) ) ),
inference(skolemize,[status(esa)],[120]) ).
fof(122,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk7_0,esk11_0)
& ~ memberP(esk8_0,esk11_0)
& ( nil = esk10_0
| ssItem(esk12_0) )
& ( nil = esk9_0
| ssItem(esk12_0) )
& ( nil = esk10_0
| cons(esk12_0,nil) = esk9_0 )
& ( nil = esk9_0
| cons(esk12_0,nil) = esk9_0 )
& ( nil = esk10_0
| memberP(esk10_0,esk12_0) )
& ( nil = esk9_0
| memberP(esk10_0,esk12_0) ) ),
inference(distribute,[status(thm)],[121]) ).
cnf(123,negated_conjecture,
( memberP(esk10_0,esk12_0)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(125,negated_conjecture,
( cons(esk12_0,nil) = esk9_0
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(127,negated_conjecture,
( ssItem(esk12_0)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(129,negated_conjecture,
~ memberP(esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(130,negated_conjecture,
memberP(esk7_0,esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(131,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(132,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[122]) ).
cnf(133,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[122]) ).
cnf(140,negated_conjecture,
memberP(esk9_0,esk11_0),
inference(rw,[status(thm)],[130,132,theory(equality)]) ).
cnf(141,negated_conjecture,
~ memberP(esk10_0,esk11_0),
inference(rw,[status(thm)],[129,133,theory(equality)]) ).
cnf(209,negated_conjecture,
( X1 = esk12_0
| memberP(nil,X1)
| esk9_0 = nil
| ~ memberP(esk9_0,X1)
| ~ ssList(nil)
| ~ ssItem(esk12_0)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[118,125,theory(equality)]) ).
cnf(212,negated_conjecture,
( X1 = esk12_0
| memberP(nil,X1)
| esk9_0 = nil
| ~ memberP(esk9_0,X1)
| $false
| ~ ssItem(esk12_0)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[209,83,theory(equality)]) ).
cnf(213,negated_conjecture,
( X1 = esk12_0
| memberP(nil,X1)
| esk9_0 = nil
| ~ memberP(esk9_0,X1)
| ~ ssItem(esk12_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[212,theory(equality)]) ).
cnf(1364,negated_conjecture,
( esk9_0 = nil
| X1 = esk12_0
| memberP(nil,X1)
| ~ memberP(esk9_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[213,127]) ).
cnf(1365,negated_conjecture,
( esk9_0 = nil
| X1 = esk12_0
| ~ memberP(esk9_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[1364,78]) ).
cnf(1366,negated_conjecture,
( esk9_0 = nil
| esk11_0 = esk12_0
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[1365,140,theory(equality)]) ).
cnf(1367,negated_conjecture,
( esk9_0 = nil
| esk11_0 = esk12_0
| $false ),
inference(rw,[status(thm)],[1366,131,theory(equality)]) ).
cnf(1368,negated_conjecture,
( esk9_0 = nil
| esk11_0 = esk12_0 ),
inference(cn,[status(thm)],[1367,theory(equality)]) ).
cnf(1373,negated_conjecture,
( esk9_0 = nil
| ~ memberP(esk10_0,esk12_0) ),
inference(spm,[status(thm)],[141,1368,theory(equality)]) ).
cnf(1379,negated_conjecture,
esk9_0 = nil,
inference(csr,[status(thm)],[1373,123]) ).
cnf(1384,negated_conjecture,
memberP(nil,esk11_0),
inference(rw,[status(thm)],[140,1379,theory(equality)]) ).
cnf(1491,negated_conjecture,
~ ssItem(esk11_0),
inference(spm,[status(thm)],[78,1384,theory(equality)]) ).
cnf(1498,negated_conjecture,
$false,
inference(rw,[status(thm)],[1491,131,theory(equality)]) ).
cnf(1499,negated_conjecture,
$false,
inference(cn,[status(thm)],[1498,theory(equality)]) ).
cnf(1500,negated_conjecture,
$false,
1499,
[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/SWC407+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpgX0c4Q/sel_SWC407+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC407+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC407+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC407+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
%
%------------------------------------------------------------------------------