TSTP Solution File: SWC367+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC367+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:39:12 EST 2010
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 109 ( 37 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 113 ( 32 ~; 28 |; 40 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 24 ( 0 sgn 15 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,axiom,
ssList(nil),
file('/tmp/tmpMpqOaG/sel_SWC367+1.p_1',ax17) ).
fof(22,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/tmp/tmpMpqOaG/sel_SWC367+1.p_1',ax51) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| rearsegP(X2,X1)
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpMpqOaG/sel_SWC367+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| rearsegP(X2,X1)
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| rearsegP(X2,X1)
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
cnf(117,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(122,plain,
! [X1] :
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(123,plain,
! [X2] :
( ~ ssList(X2)
| rearsegP(X2,nil) ),
inference(variable_rename,[status(thm)],[122]) ).
cnf(124,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
fof(140,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ~ rearsegP(X2,X1)
& ( ( nil = X4
& nil = X3 )
| ( neq(X3,nil)
& rearsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(141,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ~ rearsegP(X6,X5)
& ( ( nil = X8
& nil = X7 )
| ( neq(X7,nil)
& rearsegP(X8,X7) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ~ rearsegP(esk7_0,esk6_0)
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& rearsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ~ rearsegP(esk7_0,esk6_0)
& ( neq(esk8_0,nil)
| nil = esk9_0 )
& ( rearsegP(esk9_0,esk8_0)
| nil = esk9_0 )
& ( neq(esk8_0,nil)
| nil = esk8_0 )
& ( rearsegP(esk9_0,esk8_0)
| nil = esk8_0 ) ),
inference(distribute,[status(thm)],[142]) ).
cnf(144,negated_conjecture,
( nil = esk8_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(146,negated_conjecture,
( nil = esk9_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(148,negated_conjecture,
~ rearsegP(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(149,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(150,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(157,negated_conjecture,
~ rearsegP(esk9_0,esk8_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[148,150,theory(equality)]),149,theory(equality)]) ).
cnf(158,negated_conjecture,
esk8_0 = nil,
inference(sr,[status(thm)],[144,157,theory(equality)]) ).
cnf(163,negated_conjecture,
~ rearsegP(esk9_0,nil),
inference(rw,[status(thm)],[157,158,theory(equality)]) ).
cnf(166,negated_conjecture,
( esk9_0 = nil
| rearsegP(esk9_0,nil) ),
inference(rw,[status(thm)],[146,158,theory(equality)]) ).
cnf(310,negated_conjecture,
esk9_0 = nil,
inference(sr,[status(thm)],[166,163,theory(equality)]) ).
cnf(317,negated_conjecture,
~ rearsegP(nil,nil),
inference(rw,[status(thm)],[163,310,theory(equality)]) ).
cnf(319,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[317,124,theory(equality)]) ).
cnf(321,negated_conjecture,
$false,
inference(rw,[status(thm)],[319,117,theory(equality)]) ).
cnf(322,negated_conjecture,
$false,
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(323,negated_conjecture,
$false,
322,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC367+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpMpqOaG/sel_SWC367+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC367+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC367+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC367+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
%
%------------------------------------------------------------------------------