TSTP Solution File: SET047+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET047+1 : TPTP v5.0.0. Released v2.0.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 02:39:40 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 141 ( 52 ~; 67 |; 18 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
file('/tmp/tmpinibAa/sel_SET047+1.p_1',pel43) ).
fof(2,axiom,
! [X1,X2] :
( set_equal(X1,X2)
<=> ! [X3] :
( element(X3,X1)
<=> element(X3,X2) ) ),
file('/tmp/tmpinibAa/sel_SET047+1.p_1',pel43_1) ).
fof(3,negated_conjecture,
~ ! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(4,negated_conjecture,
? [X1,X2] :
( ( ~ set_equal(X1,X2)
| ~ set_equal(X2,X1) )
& ( set_equal(X1,X2)
| set_equal(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3,X4] :
( ( ~ set_equal(X3,X4)
| ~ set_equal(X4,X3) )
& ( set_equal(X3,X4)
| set_equal(X4,X3) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ( ~ set_equal(esk1_0,esk2_0)
| ~ set_equal(esk2_0,esk1_0) )
& ( set_equal(esk1_0,esk2_0)
| set_equal(esk2_0,esk1_0) ) ),
inference(skolemize,[status(esa)],[5]) ).
cnf(7,negated_conjecture,
( set_equal(esk2_0,esk1_0)
| set_equal(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ set_equal(esk2_0,esk1_0)
| ~ set_equal(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
fof(9,plain,
! [X1,X2] :
( ( ~ set_equal(X1,X2)
| ! [X3] :
( ( ~ element(X3,X1)
| element(X3,X2) )
& ( ~ element(X3,X2)
| element(X3,X1) ) ) )
& ( ? [X3] :
( ( ~ element(X3,X1)
| ~ element(X3,X2) )
& ( element(X3,X1)
| element(X3,X2) ) )
| set_equal(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(10,plain,
! [X4,X5] :
( ( ~ set_equal(X4,X5)
| ! [X6] :
( ( ~ element(X6,X4)
| element(X6,X5) )
& ( ~ element(X6,X5)
| element(X6,X4) ) ) )
& ( ? [X7] :
( ( ~ element(X7,X4)
| ~ element(X7,X5) )
& ( element(X7,X4)
| element(X7,X5) ) )
| set_equal(X4,X5) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(11,plain,
! [X4,X5] :
( ( ~ set_equal(X4,X5)
| ! [X6] :
( ( ~ element(X6,X4)
| element(X6,X5) )
& ( ~ element(X6,X5)
| element(X6,X4) ) ) )
& ( ( ( ~ element(esk3_2(X4,X5),X4)
| ~ element(esk3_2(X4,X5),X5) )
& ( element(esk3_2(X4,X5),X4)
| element(esk3_2(X4,X5),X5) ) )
| set_equal(X4,X5) ) ),
inference(skolemize,[status(esa)],[10]) ).
fof(12,plain,
! [X4,X5,X6] :
( ( ( ( ~ element(X6,X4)
| element(X6,X5) )
& ( ~ element(X6,X5)
| element(X6,X4) ) )
| ~ set_equal(X4,X5) )
& ( ( ( ~ element(esk3_2(X4,X5),X4)
| ~ element(esk3_2(X4,X5),X5) )
& ( element(esk3_2(X4,X5),X4)
| element(esk3_2(X4,X5),X5) ) )
| set_equal(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[11]) ).
fof(13,plain,
! [X4,X5,X6] :
( ( ~ element(X6,X4)
| element(X6,X5)
| ~ set_equal(X4,X5) )
& ( ~ element(X6,X5)
| element(X6,X4)
| ~ set_equal(X4,X5) )
& ( ~ element(esk3_2(X4,X5),X4)
| ~ element(esk3_2(X4,X5),X5)
| set_equal(X4,X5) )
& ( element(esk3_2(X4,X5),X4)
| element(esk3_2(X4,X5),X5)
| set_equal(X4,X5) ) ),
inference(distribute,[status(thm)],[12]) ).
cnf(14,plain,
( set_equal(X1,X2)
| element(esk3_2(X1,X2),X2)
| element(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(15,plain,
( set_equal(X1,X2)
| ~ element(esk3_2(X1,X2),X2)
| ~ element(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(16,plain,
( element(X3,X1)
| ~ set_equal(X1,X2)
| ~ element(X3,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(17,plain,
( element(X3,X2)
| ~ set_equal(X1,X2)
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(19,negated_conjecture,
( element(X1,esk2_0)
| set_equal(esk2_0,esk1_0)
| ~ element(X1,esk1_0) ),
inference(spm,[status(thm)],[17,7,theory(equality)]) ).
cnf(20,negated_conjecture,
( element(X1,esk1_0)
| set_equal(esk2_0,esk1_0)
| ~ element(X1,esk2_0) ),
inference(spm,[status(thm)],[16,7,theory(equality)]) ).
cnf(24,negated_conjecture,
( element(X1,esk2_0)
| ~ element(X1,esk1_0) ),
inference(csr,[status(thm)],[19,16]) ).
cnf(25,negated_conjecture,
( element(esk3_2(esk1_0,X1),esk2_0)
| element(esk3_2(esk1_0,X1),X1)
| set_equal(esk1_0,X1) ),
inference(spm,[status(thm)],[24,14,theory(equality)]) ).
cnf(26,negated_conjecture,
( element(esk3_2(X1,esk1_0),esk2_0)
| element(esk3_2(X1,esk1_0),X1)
| set_equal(X1,esk1_0) ),
inference(spm,[status(thm)],[24,14,theory(equality)]) ).
cnf(29,negated_conjecture,
( element(X1,esk1_0)
| ~ element(X1,esk2_0) ),
inference(csr,[status(thm)],[20,17]) ).
cnf(30,negated_conjecture,
( set_equal(X1,esk1_0)
| ~ element(esk3_2(X1,esk1_0),X1)
| ~ element(esk3_2(X1,esk1_0),esk2_0) ),
inference(spm,[status(thm)],[15,29,theory(equality)]) ).
cnf(37,negated_conjecture,
( element(esk3_2(esk1_0,esk2_0),esk2_0)
| set_equal(esk1_0,esk2_0) ),
inference(ef,[status(thm)],[25,theory(equality)]) ).
cnf(42,negated_conjecture,
( set_equal(esk1_0,esk2_0)
| ~ element(esk3_2(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[15,37,theory(equality)]) ).
cnf(44,negated_conjecture,
( set_equal(esk1_0,esk2_0)
| ~ element(esk3_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[42,29,theory(equality)]) ).
cnf(45,negated_conjecture,
( element(esk3_2(esk2_0,esk1_0),esk2_0)
| set_equal(esk2_0,esk1_0) ),
inference(ef,[status(thm)],[26,theory(equality)]) ).
cnf(51,negated_conjecture,
set_equal(esk1_0,esk2_0),
inference(csr,[status(thm)],[44,37]) ).
cnf(56,negated_conjecture,
( $false
| ~ set_equal(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[8,51,theory(equality)]) ).
cnf(57,negated_conjecture,
~ set_equal(esk2_0,esk1_0),
inference(cn,[status(thm)],[56,theory(equality)]) ).
cnf(59,negated_conjecture,
element(esk3_2(esk2_0,esk1_0),esk2_0),
inference(sr,[status(thm)],[45,57,theory(equality)]) ).
cnf(62,negated_conjecture,
( set_equal(esk2_0,esk1_0)
| ~ element(esk3_2(esk2_0,esk1_0),esk2_0) ),
inference(spm,[status(thm)],[30,59,theory(equality)]) ).
cnf(64,negated_conjecture,
( set_equal(esk2_0,esk1_0)
| $false ),
inference(rw,[status(thm)],[62,59,theory(equality)]) ).
cnf(65,negated_conjecture,
set_equal(esk2_0,esk1_0),
inference(cn,[status(thm)],[64,theory(equality)]) ).
cnf(66,negated_conjecture,
$false,
inference(sr,[status(thm)],[65,57,theory(equality)]) ).
cnf(67,negated_conjecture,
$false,
66,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET047+1.p
% --creating new selector for []
% -running prover on /tmp/tmpinibAa/sel_SET047+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET047+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET047+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET047+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
%
%------------------------------------------------------------------------------