%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET044+1 : TPTP v5.0.0. Released v2.0.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 02:39:24 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 71 ( 29 ~; 21 |; 12 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 38 ( 0 sgn 21 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ? [X1] :
! [X2] :
( element(X2,X1)
<=> element(X2,X2) )
=> ~ ! [X3] :
? [X4] :
! [X5] :
( element(X5,X4)
<=> ~ element(X5,X3) ) ),
file('/tmp/tmpCS-LY6/sel_SET044+1.p_1',pel40) ).
fof(2,negated_conjecture,
~ ( ? [X1] :
! [X2] :
( element(X2,X1)
<=> element(X2,X2) )
=> ~ ! [X3] :
? [X4] :
! [X5] :
( element(X5,X4)
<=> ~ element(X5,X3) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ? [X1] :
! [X2] :
( element(X2,X1)
<=> element(X2,X2) )
=> ~ ! [X3] :
? [X4] :
! [X5] :
( element(X5,X4)
<=> ~ element(X5,X3) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ? [X1] :
! [X2] :
( ( ~ element(X2,X1)
| element(X2,X2) )
& ( ~ element(X2,X2)
| element(X2,X1) ) )
& ! [X3] :
? [X4] :
! [X5] :
( ( ~ element(X5,X4)
| ~ element(X5,X3) )
& ( element(X5,X3)
| element(X5,X4) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ? [X6] :
! [X7] :
( ( ~ element(X7,X6)
| element(X7,X7) )
& ( ~ element(X7,X7)
| element(X7,X6) ) )
& ! [X8] :
? [X9] :
! [X10] :
( ( ~ element(X10,X9)
| ~ element(X10,X8) )
& ( element(X10,X8)
| element(X10,X9) ) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X7] :
( ( ~ element(X7,esk1_0)
| element(X7,X7) )
& ( ~ element(X7,X7)
| element(X7,esk1_0) ) )
& ! [X8,X10] :
( ( ~ element(X10,esk2_1(X8))
| ~ element(X10,X8) )
& ( element(X10,X8)
| element(X10,esk2_1(X8)) ) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X7,X8,X10] :
( ( ~ element(X10,esk2_1(X8))
| ~ element(X10,X8) )
& ( element(X10,X8)
| element(X10,esk2_1(X8)) )
& ( ~ element(X7,esk1_0)
| element(X7,X7) )
& ( ~ element(X7,X7)
| element(X7,esk1_0) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( element(X1,esk1_0)
| ~ element(X1,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( element(X1,X1)
| ~ element(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( element(X1,esk2_1(X2))
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( element(esk2_1(X1),esk1_0)
| element(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[8,10,theory(equality)]) ).
cnf(14,negated_conjecture,
element(esk2_1(esk1_0),esk1_0),
inference(ef,[status(thm)],[12,theory(equality)]) ).
cnf(18,negated_conjecture,
element(esk2_1(esk1_0),esk2_1(esk1_0)),
inference(spm,[status(thm)],[9,14,theory(equality)]) ).
cnf(20,negated_conjecture,
~ element(esk2_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[11,18,theory(equality)]) ).
cnf(22,negated_conjecture,
$false,
inference(rw,[status(thm)],[20,14,theory(equality)]) ).
cnf(23,negated_conjecture,
$false,
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(24,negated_conjecture,
$false,
23,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET044+1.p
% --creating new selector for []
% -running prover on /tmp/tmpCS-LY6/sel_SET044+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET044+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET044+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET044+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
%
%------------------------------------------------------------------------------