TSTP Solution File: SET788+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET788+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 03:38:58 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 137 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 160 ( 56 ~; 71 |; 25 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 48 ( 0 sgn 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1,X2] :
( equalish(X1,X2)
<=> ! [X3] :
( a_member_of(X3,X1)
<=> a_member_of(X3,X2) ) )
=> ! [X1,X2] :
( equalish(X1,X2)
<=> equalish(X2,X1) ) ),
file('/tmp/tmpKQuG58/sel_SET788+1.p_1',prove_this) ).
fof(2,negated_conjecture,
~ ( ! [X1,X2] :
( equalish(X1,X2)
<=> ! [X3] :
( a_member_of(X3,X1)
<=> a_member_of(X3,X2) ) )
=> ! [X1,X2] :
( equalish(X1,X2)
<=> equalish(X2,X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ! [X1,X2] :
( ( ~ equalish(X1,X2)
| ! [X3] :
( ( ~ a_member_of(X3,X1)
| a_member_of(X3,X2) )
& ( ~ a_member_of(X3,X2)
| a_member_of(X3,X1) ) ) )
& ( ? [X3] :
( ( ~ a_member_of(X3,X1)
| ~ a_member_of(X3,X2) )
& ( a_member_of(X3,X1)
| a_member_of(X3,X2) ) )
| equalish(X1,X2) ) )
& ? [X1,X2] :
( ( ~ equalish(X1,X2)
| ~ equalish(X2,X1) )
& ( equalish(X1,X2)
| equalish(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ! [X4,X5] :
( ( ~ equalish(X4,X5)
| ! [X6] :
( ( ~ a_member_of(X6,X4)
| a_member_of(X6,X5) )
& ( ~ a_member_of(X6,X5)
| a_member_of(X6,X4) ) ) )
& ( ? [X7] :
( ( ~ a_member_of(X7,X4)
| ~ a_member_of(X7,X5) )
& ( a_member_of(X7,X4)
| a_member_of(X7,X5) ) )
| equalish(X4,X5) ) )
& ? [X8,X9] :
( ( ~ equalish(X8,X9)
| ~ equalish(X9,X8) )
& ( equalish(X8,X9)
| equalish(X9,X8) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X4,X5] :
( ( ~ equalish(X4,X5)
| ! [X6] :
( ( ~ a_member_of(X6,X4)
| a_member_of(X6,X5) )
& ( ~ a_member_of(X6,X5)
| a_member_of(X6,X4) ) ) )
& ( ( ( ~ a_member_of(esk1_2(X4,X5),X4)
| ~ a_member_of(esk1_2(X4,X5),X5) )
& ( a_member_of(esk1_2(X4,X5),X4)
| a_member_of(esk1_2(X4,X5),X5) ) )
| equalish(X4,X5) ) )
& ( ~ equalish(esk2_0,esk3_0)
| ~ equalish(esk3_0,esk2_0) )
& ( equalish(esk2_0,esk3_0)
| equalish(esk3_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4,X5,X6] :
( ( ( ( ~ a_member_of(X6,X4)
| a_member_of(X6,X5) )
& ( ~ a_member_of(X6,X5)
| a_member_of(X6,X4) ) )
| ~ equalish(X4,X5) )
& ( ( ( ~ a_member_of(esk1_2(X4,X5),X4)
| ~ a_member_of(esk1_2(X4,X5),X5) )
& ( a_member_of(esk1_2(X4,X5),X4)
| a_member_of(esk1_2(X4,X5),X5) ) )
| equalish(X4,X5) )
& ( ~ equalish(esk2_0,esk3_0)
| ~ equalish(esk3_0,esk2_0) )
& ( equalish(esk2_0,esk3_0)
| equalish(esk3_0,esk2_0) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X4,X5,X6] :
( ( ~ a_member_of(X6,X4)
| a_member_of(X6,X5)
| ~ equalish(X4,X5) )
& ( ~ a_member_of(X6,X5)
| a_member_of(X6,X4)
| ~ equalish(X4,X5) )
& ( ~ a_member_of(esk1_2(X4,X5),X4)
| ~ a_member_of(esk1_2(X4,X5),X5)
| equalish(X4,X5) )
& ( a_member_of(esk1_2(X4,X5),X4)
| a_member_of(esk1_2(X4,X5),X5)
| equalish(X4,X5) )
& ( ~ equalish(esk2_0,esk3_0)
| ~ equalish(esk3_0,esk2_0) )
& ( equalish(esk2_0,esk3_0)
| equalish(esk3_0,esk2_0) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( equalish(esk3_0,esk2_0)
| equalish(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( ~ equalish(esk3_0,esk2_0)
| ~ equalish(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( equalish(X1,X2)
| a_member_of(esk1_2(X1,X2),X2)
| a_member_of(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( equalish(X1,X2)
| ~ a_member_of(esk1_2(X1,X2),X2)
| ~ a_member_of(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( a_member_of(X3,X1)
| ~ equalish(X1,X2)
| ~ a_member_of(X3,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
( a_member_of(X3,X2)
| ~ equalish(X1,X2)
| ~ a_member_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(15,negated_conjecture,
( a_member_of(X1,esk3_0)
| equalish(esk3_0,esk2_0)
| ~ a_member_of(X1,esk2_0) ),
inference(spm,[status(thm)],[13,8,theory(equality)]) ).
cnf(16,negated_conjecture,
( a_member_of(X1,esk2_0)
| equalish(esk3_0,esk2_0)
| ~ a_member_of(X1,esk3_0) ),
inference(spm,[status(thm)],[12,8,theory(equality)]) ).
cnf(20,negated_conjecture,
( a_member_of(X1,esk3_0)
| ~ a_member_of(X1,esk2_0) ),
inference(csr,[status(thm)],[15,12]) ).
cnf(21,negated_conjecture,
( a_member_of(esk1_2(esk2_0,X1),esk3_0)
| a_member_of(esk1_2(esk2_0,X1),X1)
| equalish(esk2_0,X1) ),
inference(spm,[status(thm)],[20,10,theory(equality)]) ).
cnf(22,negated_conjecture,
( a_member_of(esk1_2(X1,esk2_0),esk3_0)
| a_member_of(esk1_2(X1,esk2_0),X1)
| equalish(X1,esk2_0) ),
inference(spm,[status(thm)],[20,10,theory(equality)]) ).
cnf(25,negated_conjecture,
( a_member_of(X1,esk2_0)
| ~ a_member_of(X1,esk3_0) ),
inference(csr,[status(thm)],[16,13]) ).
cnf(26,negated_conjecture,
( equalish(X1,esk2_0)
| ~ a_member_of(esk1_2(X1,esk2_0),X1)
| ~ a_member_of(esk1_2(X1,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[11,25,theory(equality)]) ).
cnf(33,negated_conjecture,
( a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)
| equalish(esk2_0,esk3_0) ),
inference(ef,[status(thm)],[21,theory(equality)]) ).
cnf(38,negated_conjecture,
( equalish(esk2_0,esk3_0)
| ~ a_member_of(esk1_2(esk2_0,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[11,33,theory(equality)]) ).
cnf(40,negated_conjecture,
( equalish(esk2_0,esk3_0)
| ~ a_member_of(esk1_2(esk2_0,esk3_0),esk3_0) ),
inference(spm,[status(thm)],[38,25,theory(equality)]) ).
cnf(41,negated_conjecture,
( a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)
| equalish(esk3_0,esk2_0) ),
inference(ef,[status(thm)],[22,theory(equality)]) ).
cnf(47,negated_conjecture,
equalish(esk2_0,esk3_0),
inference(csr,[status(thm)],[40,33]) ).
cnf(52,negated_conjecture,
( $false
| ~ equalish(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[9,47,theory(equality)]) ).
cnf(53,negated_conjecture,
~ equalish(esk3_0,esk2_0),
inference(cn,[status(thm)],[52,theory(equality)]) ).
cnf(55,negated_conjecture,
a_member_of(esk1_2(esk3_0,esk2_0),esk3_0),
inference(sr,[status(thm)],[41,53,theory(equality)]) ).
cnf(58,negated_conjecture,
( equalish(esk3_0,esk2_0)
| ~ a_member_of(esk1_2(esk3_0,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[26,55,theory(equality)]) ).
cnf(60,negated_conjecture,
( equalish(esk3_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[58,55,theory(equality)]) ).
cnf(61,negated_conjecture,
equalish(esk3_0,esk2_0),
inference(cn,[status(thm)],[60,theory(equality)]) ).
cnf(62,negated_conjecture,
$false,
inference(sr,[status(thm)],[61,53,theory(equality)]) ).
cnf(63,negated_conjecture,
$false,
62,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET788+1.p
% --creating new selector for []
% -running prover on /tmp/tmpKQuG58/sel_SET788+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET788+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET788+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET788+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
%
%------------------------------------------------------------------------------