%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC127+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:21:25 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 143 ( 28 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 164 ( 59 ~; 53 |; 37 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 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(12,axiom,
~ singletonP(nil),
file('/tmp/tmpukAjwI/sel_SWC127+1.p_1',ax39) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpukAjwI/sel_SWC127+1.p_1',ax15) ).
fof(21,axiom,
ssList(nil),
file('/tmp/tmpukAjwI/sel_SWC127+1.p_1',ax17) ).
fof(28,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ segmentP(X4,X3)
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/tmp/tmpukAjwI/sel_SWC127+1.p_1',co1) ).
fof(29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ segmentP(X4,X3)
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(30,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ segmentP(X4,X3)
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[29,theory(equality)]) ).
cnf(81,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[30]) ).
fof(118,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(119,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[119]) ).
fof(121,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)],[120]) ).
cnf(122,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(128,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[21]) ).
fof(153,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& segmentP(X4,X3)
& ( singletonP(X3)
| ~ neq(X4,nil) )
& ( ~ neq(X1,nil)
| ~ segmentP(X2,X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(154,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& neq(X6,nil)
& segmentP(X8,X7)
& ( singletonP(X7)
| ~ neq(X8,nil) )
& ( ~ neq(X5,nil)
| ~ segmentP(X6,X5) ) ) ) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& neq(esk9_0,nil)
& segmentP(esk11_0,esk10_0)
& ( singletonP(esk10_0)
| ~ neq(esk11_0,nil) )
& ( ~ neq(esk8_0,nil)
| ~ segmentP(esk9_0,esk8_0) ) ),
inference(skolemize,[status(esa)],[154]) ).
cnf(156,negated_conjecture,
( ~ segmentP(esk9_0,esk8_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(157,negated_conjecture,
( singletonP(esk10_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(158,negated_conjecture,
segmentP(esk11_0,esk10_0),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(159,negated_conjecture,
neq(esk9_0,nil),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(160,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[155]) ).
cnf(161,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[155]) ).
cnf(165,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(169,negated_conjecture,
segmentP(esk11_0,esk8_0),
inference(rw,[status(thm)],[158,160,theory(equality)]) ).
cnf(170,negated_conjecture,
neq(esk11_0,nil),
inference(rw,[status(thm)],[159,161,theory(equality)]) ).
cnf(171,negated_conjecture,
( singletonP(esk8_0)
| ~ neq(esk11_0,nil) ),
inference(rw,[status(thm)],[157,160,theory(equality)]) ).
cnf(172,negated_conjecture,
( singletonP(esk8_0)
| $false ),
inference(rw,[status(thm)],[171,170,theory(equality)]) ).
cnf(173,negated_conjecture,
singletonP(esk8_0),
inference(cn,[status(thm)],[172,theory(equality)]) ).
cnf(174,negated_conjecture,
( $false
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[156,161,theory(equality)]),169,theory(equality)]) ).
cnf(175,negated_conjecture,
~ neq(esk8_0,nil),
inference(cn,[status(thm)],[174,theory(equality)]) ).
cnf(179,negated_conjecture,
( esk8_0 = nil
| ~ ssList(nil)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[175,122,theory(equality)]) ).
cnf(180,negated_conjecture,
( esk8_0 = nil
| $false
| ~ ssList(esk8_0) ),
inference(rw,[status(thm)],[179,128,theory(equality)]) ).
cnf(181,negated_conjecture,
( esk8_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[180,165,theory(equality)]) ).
cnf(182,negated_conjecture,
esk8_0 = nil,
inference(cn,[status(thm)],[181,theory(equality)]) ).
cnf(372,negated_conjecture,
singletonP(nil),
inference(rw,[status(thm)],[173,182,theory(equality)]) ).
cnf(373,negated_conjecture,
$false,
inference(sr,[status(thm)],[372,81,theory(equality)]) ).
cnf(374,negated_conjecture,
$false,
373,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC127+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpukAjwI/sel_SWC127+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC127+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC127+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC127+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
%
%------------------------------------------------------------------------------