TSTP Solution File: SWC131+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC131+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:55 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 98 ( 26 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 108 ( 39 ~; 33 |; 25 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 28 ( 0 sgn 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
cyclefreeP(nil),
file('/tmp/tmpbtTaCa/sel_SWC131+1.p_1',ax60) ).
fof(19,axiom,
ssList(nil),
file('/tmp/tmpbtTaCa/sel_SWC131+1.p_1',ax17) ).
fof(22,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpbtTaCa/sel_SWC131+1.p_1',ax15) ).
fof(25,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| neq(X4,nil)
| cyclefreeP(X2) ) ) ) ) ),
file('/tmp/tmpbtTaCa/sel_SWC131+1.p_1',co1) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| neq(X4,nil)
| cyclefreeP(X2) ) ) ) ) ),
inference(assume_negation,[status(cth)],[25]) ).
cnf(27,plain,
cyclefreeP(nil),
inference(split_conjunct,[status(thm)],[1]) ).
cnf(112,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[19]) ).
fof(123,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(124,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[123]) ).
fof(125,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[124]) ).
fof(126,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)],[125]) ).
cnf(127,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[126]) ).
fof(136,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ~ neq(X4,nil)
& ~ cyclefreeP(X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(137,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ~ neq(X8,nil)
& ~ cyclefreeP(X6) ) ) ) ),
inference(variable_rename,[status(thm)],[136]) ).
fof(138,negated_conjecture,
( ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ~ neq(esk13_0,nil)
& ~ cyclefreeP(esk11_0) ),
inference(skolemize,[status(esa)],[137]) ).
cnf(139,negated_conjecture,
~ cyclefreeP(esk11_0),
inference(split_conjunct,[status(thm)],[138]) ).
cnf(140,negated_conjecture,
~ neq(esk13_0,nil),
inference(split_conjunct,[status(thm)],[138]) ).
cnf(142,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[138]) ).
cnf(145,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[138]) ).
cnf(149,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[145,142,theory(equality)]) ).
cnf(150,negated_conjecture,
~ cyclefreeP(esk13_0),
inference(rw,[status(thm)],[139,142,theory(equality)]) ).
cnf(151,negated_conjecture,
( esk13_0 = nil
| ~ ssList(nil)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[140,127,theory(equality)]) ).
cnf(152,negated_conjecture,
( esk13_0 = nil
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[151,112,theory(equality)]) ).
cnf(153,negated_conjecture,
( esk13_0 = nil
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[152,theory(equality)]) ).
cnf(278,negated_conjecture,
( esk13_0 = nil
| $false ),
inference(rw,[status(thm)],[153,149,theory(equality)]) ).
cnf(279,negated_conjecture,
esk13_0 = nil,
inference(cn,[status(thm)],[278,theory(equality)]) ).
cnf(285,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[150,279,theory(equality)]),27,theory(equality)]) ).
cnf(286,negated_conjecture,
$false,
inference(cn,[status(thm)],[285,theory(equality)]) ).
cnf(287,negated_conjecture,
$false,
286,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC131+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpbtTaCa/sel_SWC131+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC131+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC131+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC131+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
%
%------------------------------------------------------------------------------