TSTP Solution File: SEU142+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU142+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 04:51:17 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 195 ( 136 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 236 ( 83 ~; 109 |; 40 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-3 aty)
% Number of variables : 99 ( 4 sgn 48 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/tmp/tmpYlyEK5/sel_SEU142+1.p_1',commutativity_k2_tarski) ).
fof(5,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/tmp/tmpYlyEK5/sel_SEU142+1.p_1',d1_tarski) ).
fof(6,conjecture,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmpYlyEK5/sel_SEU142+1.p_1',t69_enumset1) ).
fof(8,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/tmp/tmpYlyEK5/sel_SEU142+1.p_1',d2_tarski) ).
fof(9,negated_conjecture,
~ ! [X1] : unordered_pair(X1,X1) = singleton(X1),
inference(assume_negation,[status(cth)],[6]) ).
fof(19,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(20,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,plain,
! [X1,X2] :
( ( X2 != singleton(X1)
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1 )
& ( X3 != X1
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( ~ in(X3,X2)
| X3 != X1 )
& ( in(X3,X2)
| X3 = X1 ) )
| X2 = singleton(X1) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(22,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ? [X7] :
( ( ~ in(X7,X5)
| X7 != X4 )
& ( in(X7,X5)
| X7 = X4 ) )
| X5 = singleton(X4) ) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ( ( ~ in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) != X4 )
& ( in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(skolemize,[status(esa)],[22]) ).
fof(24,plain,
! [X4,X5,X6] :
( ( ( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) )
| X5 != singleton(X4) )
& ( ( ( ~ in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) != X4 )
& ( in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(shift_quantors,[status(thm)],[23]) ).
fof(25,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(26,plain,
( X1 = singleton(X2)
| esk2_2(X2,X1) = X2
| in(esk2_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,plain,
( X1 = singleton(X2)
| esk2_2(X2,X1) != X2
| ~ in(esk2_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(30,negated_conjecture,
? [X1] : unordered_pair(X1,X1) != singleton(X1),
inference(fof_nnf,[status(thm)],[9]) ).
fof(31,negated_conjecture,
? [X2] : unordered_pair(X2,X2) != singleton(X2),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,negated_conjecture,
unordered_pair(esk3_0,esk3_0) != singleton(esk3_0),
inference(skolemize,[status(esa)],[31]) ).
cnf(33,negated_conjecture,
unordered_pair(esk3_0,esk3_0) != singleton(esk3_0),
inference(split_conjunct,[status(thm)],[32]) ).
fof(37,plain,
! [X1,X2,X3] :
( ( X3 != unordered_pair(X1,X2)
| ! [X4] :
( ( ~ in(X4,X3)
| X4 = X1
| X4 = X2 )
& ( ( X4 != X1
& X4 != X2 )
| in(X4,X3) ) ) )
& ( ? [X4] :
( ( ~ in(X4,X3)
| ( X4 != X1
& X4 != X2 ) )
& ( in(X4,X3)
| X4 = X1
| X4 = X2 ) )
| X3 = unordered_pair(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(38,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ? [X9] :
( ( ~ in(X9,X7)
| ( X9 != X5
& X9 != X6 ) )
& ( in(X9,X7)
| X9 = X5
| X9 = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ( ( ~ in(esk4_3(X5,X6,X7),X7)
| ( esk4_3(X5,X6,X7) != X5
& esk4_3(X5,X6,X7) != X6 ) )
& ( in(esk4_3(X5,X6,X7),X7)
| esk4_3(X5,X6,X7) = X5
| esk4_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(skolemize,[status(esa)],[38]) ).
fof(40,plain,
! [X5,X6,X7,X8] :
( ( ( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) )
| X7 != unordered_pair(X5,X6) )
& ( ( ( ~ in(esk4_3(X5,X6,X7),X7)
| ( esk4_3(X5,X6,X7) != X5
& esk4_3(X5,X6,X7) != X6 ) )
& ( in(esk4_3(X5,X6,X7),X7)
| esk4_3(X5,X6,X7) = X5
| esk4_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[39]) ).
fof(41,plain,
! [X5,X6,X7,X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk4_3(X5,X6,X7) != X5
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk4_3(X5,X6,X7) != X6
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X7)
| esk4_3(X5,X6,X7) = X5
| esk4_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(45,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(47,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(49,plain,
( in(X1,X2)
| unordered_pair(X3,X1) != X2 ),
inference(er,[status(thm)],[45,theory(equality)]) ).
cnf(51,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X1,X3)) ),
inference(er,[status(thm)],[47,theory(equality)]) ).
cnf(71,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[49,theory(equality)]) ).
cnf(75,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[71,20,theory(equality)]) ).
cnf(100,plain,
( X1 = esk2_2(X2,unordered_pair(X3,X1))
| X3 = esk2_2(X2,unordered_pair(X3,X1))
| esk2_2(X2,unordered_pair(X3,X1)) = X2
| singleton(X2) = unordered_pair(X3,X1) ),
inference(spm,[status(thm)],[51,26,theory(equality)]) ).
cnf(226,plain,
( esk2_2(X4,unordered_pair(X5,X6)) = X5
| esk2_2(X4,unordered_pair(X5,X6)) = X6
| singleton(X4) = unordered_pair(X5,X6)
| X4 != X5 ),
inference(ef,[status(thm)],[100,theory(equality)]) ).
cnf(241,plain,
( esk2_2(X1,unordered_pair(X1,X2)) = X1
| esk2_2(X1,unordered_pair(X1,X2)) = X2
| singleton(X1) = unordered_pair(X1,X2) ),
inference(er,[status(thm)],[226,theory(equality)]) ).
cnf(309,plain,
( singleton(X1) = unordered_pair(X1,X2)
| esk2_2(X1,unordered_pair(X1,X2)) = X2
| ~ in(X1,unordered_pair(X1,X2)) ),
inference(spm,[status(thm)],[27,241,theory(equality)]) ).
cnf(317,plain,
( singleton(X1) = unordered_pair(X1,X2)
| esk2_2(X1,unordered_pair(X1,X2)) = X2
| $false ),
inference(rw,[status(thm)],[309,75,theory(equality)]) ).
cnf(318,plain,
( singleton(X1) = unordered_pair(X1,X2)
| esk2_2(X1,unordered_pair(X1,X2)) = X2 ),
inference(cn,[status(thm)],[317,theory(equality)]) ).
cnf(322,plain,
( singleton(X1) = unordered_pair(X1,X2)
| X2 != X1
| ~ in(X2,unordered_pair(X1,X2)) ),
inference(spm,[status(thm)],[27,318,theory(equality)]) ).
cnf(325,plain,
( singleton(X1) = unordered_pair(X1,X2)
| X2 != X1
| $false ),
inference(rw,[status(thm)],[322,71,theory(equality)]) ).
cnf(326,plain,
( singleton(X1) = unordered_pair(X1,X2)
| X2 != X1 ),
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(327,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(er,[status(thm)],[326,theory(equality)]) ).
cnf(374,negated_conjecture,
$false,
inference(rw,[status(thm)],[33,327,theory(equality)]) ).
cnf(375,negated_conjecture,
$false,
inference(cn,[status(thm)],[374,theory(equality)]) ).
cnf(376,negated_conjecture,
$false,
375,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU142+1.p
% --creating new selector for []
% -running prover on /tmp/tmpYlyEK5/sel_SEU142+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU142+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU142+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU142+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
%
%------------------------------------------------------------------------------