TSTP Solution File: SWC205+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC205+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 10:51:18 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 133 ( 56 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 156 ( 55 ~; 49 |; 37 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpBeJhXy/sel_SWC205+1.p_1',ax15) ).
fof(3,axiom,
ssList(nil),
file('/tmp/tmpBeJhXy/sel_SWC205+1.p_1',ax17) ).
fof(5,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X4
& nil = X3 )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
file('/tmp/tmpBeJhXy/sel_SWC205+1.p_1',co1) ).
fof(6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X4
& nil = X3 )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X4
& nil = X3 )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(13,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(14,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[14]) ).
fof(16,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(17,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[3]) ).
fof(26,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ~ neq(X1,nil)
& ( nil = X4
| nil != X3 )
& ( nil = X3
| nil != X4 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(27,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& neq(X6,nil)
& ~ neq(X5,nil)
& ( nil = X8
| nil != X7 )
& ( nil = X7
| nil != X8 ) ) ) ) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( ssList(esk3_0)
& ssList(esk4_0)
& ssList(esk5_0)
& ssList(esk6_0)
& esk4_0 = esk6_0
& esk3_0 = esk5_0
& neq(esk4_0,nil)
& ~ neq(esk3_0,nil)
& ( nil = esk6_0
| nil != esk5_0 )
& ( nil = esk5_0
| nil != esk6_0 ) ),
inference(skolemize,[status(esa)],[27]) ).
cnf(30,negated_conjecture,
( nil = esk6_0
| nil != esk5_0 ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(31,negated_conjecture,
~ neq(esk3_0,nil),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(32,negated_conjecture,
neq(esk4_0,nil),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(33,negated_conjecture,
esk3_0 = esk5_0,
inference(split_conjunct,[status(thm)],[28]) ).
cnf(34,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[28]) ).
cnf(36,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(41,negated_conjecture,
neq(esk6_0,nil),
inference(rw,[status(thm)],[32,34,theory(equality)]) ).
cnf(42,negated_conjecture,
~ neq(esk5_0,nil),
inference(rw,[status(thm)],[31,33,theory(equality)]) ).
cnf(47,negated_conjecture,
( esk5_0 = nil
| ~ ssList(nil)
| ~ ssList(esk5_0) ),
inference(spm,[status(thm)],[42,17,theory(equality)]) ).
cnf(48,negated_conjecture,
( esk5_0 = nil
| $false
| ~ ssList(esk5_0) ),
inference(rw,[status(thm)],[47,19,theory(equality)]) ).
cnf(49,negated_conjecture,
( esk5_0 = nil
| ~ ssList(esk5_0) ),
inference(cn,[status(thm)],[48,theory(equality)]) ).
cnf(53,negated_conjecture,
esk5_0 = nil,
inference(spm,[status(thm)],[49,36,theory(equality)]) ).
cnf(58,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[42,53,theory(equality)]) ).
cnf(62,negated_conjecture,
( esk6_0 = nil
| $false ),
inference(rw,[status(thm)],[30,53,theory(equality)]) ).
cnf(63,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[62,theory(equality)]) ).
cnf(65,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[41,63,theory(equality)]) ).
cnf(76,negated_conjecture,
$false,
inference(sr,[status(thm)],[65,58,theory(equality)]) ).
cnf(77,negated_conjecture,
$false,
76,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC205+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpBeJhXy/sel_SWC205+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC205+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC205+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC205+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
%
%------------------------------------------------------------------------------