TSTP Solution File: SWC026+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC026+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:06:52 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 112 ( 82 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 128 ( 37 ~; 36 |; 47 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X4
& nil = X3 )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/tmp/tmpTkUywt/sel_SWC026+1.p_1',co1) ).
fof(3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X4
& nil = X3 )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(5,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( nil = X4
| nil != X3 )
& ( nil = X3
| nil != X4 )
& ( ( nil = X2
& nil != X1 )
| ( nil = X1
& nil != X2 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(6,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ( nil = X8
| nil != X7 )
& ( nil = X7
| nil != X8 )
& ( ( nil = X6
& nil != X5 )
| ( nil = X5
& nil != X6 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[5]) ).
fof(7,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk4_0
| nil != esk3_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( ( nil = esk2_0
& nil != esk1_0 )
| ( nil = esk1_0
& nil != esk2_0 ) ) ),
inference(skolemize,[status(esa)],[6]) ).
fof(8,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk4_0
| nil != esk3_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( nil = esk1_0
| nil = esk2_0 )
& ( nil != esk2_0
| nil = esk2_0 )
& ( nil = esk1_0
| nil != esk1_0 )
& ( nil != esk2_0
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(12,negated_conjecture,
( nil = esk2_0
| nil = esk1_0 ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(13,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(14,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[8]) ).
cnf(16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[8]) ).
cnf(24,negated_conjecture,
( esk1_0 = nil
| esk4_0 = nil ),
inference(rw,[status(thm)],[12,16,theory(equality)]) ).
cnf(27,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[13,15,theory(equality)]) ).
cnf(28,negated_conjecture,
esk1_0 = nil,
inference(csr,[status(thm)],[27,24]) ).
cnf(34,negated_conjecture,
( esk4_0 = nil
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[14,15,theory(equality)]),28,theory(equality)]) ).
cnf(35,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[34,theory(equality)]) ).
cnf(40,negated_conjecture,
( $false
| esk2_0 != nil ),
inference(rw,[status(thm)],[9,28,theory(equality)]) ).
cnf(41,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[40,16,theory(equality)]),35,theory(equality)]) ).
cnf(42,negated_conjecture,
$false,
inference(cn,[status(thm)],[41,theory(equality)]) ).
cnf(43,negated_conjecture,
$false,
42,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC026+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpTkUywt/sel_SWC026+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC026+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC026+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC026+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
%
%------------------------------------------------------------------------------