TSTP Solution File: SWC044+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC044+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:08:31 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 92 ( 39 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 99 ( 33 ~; 25 |; 27 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 25 ( 0 sgn 16 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(21,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpIF-M_6/sel_SWC044+1.p_1',ax52) ).
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| nil = X1 ) ) ) ) ),
file('/tmp/tmpIF-M_6/sel_SWC044+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| nil = X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| nil = X1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(111,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(nil,X1)
| nil = X1 )
& ( nil != X1
| rearsegP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(112,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ rearsegP(nil,X2)
| nil = X2 )
& ( nil != X2
| rearsegP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [X2] :
( ( ~ rearsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| rearsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[112]) ).
cnf(115,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(126,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& nil = X2
& X2 = X4
& X1 = X3
& rearsegP(X4,X3)
& nil != X1 ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(127,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& nil = X6
& X6 = X8
& X5 = X7
& rearsegP(X8,X7)
& nil != X5 ) ) ) ),
inference(variable_rename,[status(thm)],[126]) ).
fof(128,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& nil = esk7_0
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& rearsegP(esk9_0,esk8_0)
& nil != esk6_0 ),
inference(skolemize,[status(esa)],[127]) ).
cnf(129,negated_conjecture,
nil != esk6_0,
inference(split_conjunct,[status(thm)],[128]) ).
cnf(130,negated_conjecture,
rearsegP(esk9_0,esk8_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(131,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[128]) ).
cnf(132,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[128]) ).
cnf(133,negated_conjecture,
nil = esk7_0,
inference(split_conjunct,[status(thm)],[128]) ).
cnf(137,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(140,negated_conjecture,
ssList(esk8_0),
inference(rw,[status(thm)],[137,131,theory(equality)]) ).
cnf(141,negated_conjecture,
esk9_0 = nil,
inference(rw,[status(thm)],[132,133,theory(equality)]) ).
cnf(144,negated_conjecture,
esk8_0 != nil,
inference(rw,[status(thm)],[129,131,theory(equality)]) ).
cnf(145,negated_conjecture,
rearsegP(nil,esk8_0),
inference(rw,[status(thm)],[130,141,theory(equality)]) ).
cnf(149,negated_conjecture,
( nil = esk8_0
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[115,145,theory(equality)]) ).
cnf(150,negated_conjecture,
~ ssList(esk8_0),
inference(sr,[status(thm)],[149,144,theory(equality)]) ).
cnf(289,negated_conjecture,
$false,
inference(rw,[status(thm)],[150,140,theory(equality)]) ).
cnf(290,negated_conjecture,
$false,
inference(cn,[status(thm)],[289,theory(equality)]) ).
cnf(291,negated_conjecture,
$false,
290,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC044+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpIF-M_6/sel_SWC044+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC044+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC044+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC044+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
%
%------------------------------------------------------------------------------