TSTP Solution File: SEU229+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU229+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 05:58:23 EST 2010
% Result : Theorem 4.26s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of formulae : 52 ( 10 unt; 0 def)
% Number of atoms : 236 ( 116 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 306 ( 122 ~; 127 |; 55 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 152 ( 18 sgn 55 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X1
& X5 != X2
& X5 != X3 ) ) ),
file('/tmp/tmpiQAFnb/sel_SEU229+3.p_1',d1_enumset1) ).
fof(6,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& in(X4,X3) ) ) ),
file('/tmp/tmpiQAFnb/sel_SEU229+3.p_1',t7_tarski) ).
fof(16,conjecture,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/tmp/tmpiQAFnb/sel_SEU229+3.p_1',t3_ordinal1) ).
fof(27,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
inference(assume_negation,[status(cth)],[16]) ).
fof(45,plain,
! [X1,X2,X3,X4] :
( ( X4 != unordered_triple(X1,X2,X3)
| ! [X5] :
( ( ~ in(X5,X4)
| X5 = X1
| X5 = X2
| X5 = X3 )
& ( ( X5 != X1
& X5 != X2
& X5 != X3 )
| in(X5,X4) ) ) )
& ( ? [X5] :
( ( ~ in(X5,X4)
| ( X5 != X1
& X5 != X2
& X5 != X3 ) )
& ( in(X5,X4)
| X5 = X1
| X5 = X2
| X5 = X3 ) )
| X4 = unordered_triple(X1,X2,X3) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(46,plain,
! [X6,X7,X8,X9] :
( ( X9 != unordered_triple(X6,X7,X8)
| ! [X10] :
( ( ~ in(X10,X9)
| X10 = X6
| X10 = X7
| X10 = X8 )
& ( ( X10 != X6
& X10 != X7
& X10 != X8 )
| in(X10,X9) ) ) )
& ( ? [X11] :
( ( ~ in(X11,X9)
| ( X11 != X6
& X11 != X7
& X11 != X8 ) )
& ( in(X11,X9)
| X11 = X6
| X11 = X7
| X11 = X8 ) )
| X9 = unordered_triple(X6,X7,X8) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X6,X7,X8,X9] :
( ( X9 != unordered_triple(X6,X7,X8)
| ! [X10] :
( ( ~ in(X10,X9)
| X10 = X6
| X10 = X7
| X10 = X8 )
& ( ( X10 != X6
& X10 != X7
& X10 != X8 )
| in(X10,X9) ) ) )
& ( ( ( ~ in(esk4_4(X6,X7,X8,X9),X9)
| ( esk4_4(X6,X7,X8,X9) != X6
& esk4_4(X6,X7,X8,X9) != X7
& esk4_4(X6,X7,X8,X9) != X8 ) )
& ( in(esk4_4(X6,X7,X8,X9),X9)
| esk4_4(X6,X7,X8,X9) = X6
| esk4_4(X6,X7,X8,X9) = X7
| esk4_4(X6,X7,X8,X9) = X8 ) )
| X9 = unordered_triple(X6,X7,X8) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X6,X7,X8,X9,X10] :
( ( ( ( ~ in(X10,X9)
| X10 = X6
| X10 = X7
| X10 = X8 )
& ( ( X10 != X6
& X10 != X7
& X10 != X8 )
| in(X10,X9) ) )
| X9 != unordered_triple(X6,X7,X8) )
& ( ( ( ~ in(esk4_4(X6,X7,X8,X9),X9)
| ( esk4_4(X6,X7,X8,X9) != X6
& esk4_4(X6,X7,X8,X9) != X7
& esk4_4(X6,X7,X8,X9) != X8 ) )
& ( in(esk4_4(X6,X7,X8,X9),X9)
| esk4_4(X6,X7,X8,X9) = X6
| esk4_4(X6,X7,X8,X9) = X7
| esk4_4(X6,X7,X8,X9) = X8 ) )
| X9 = unordered_triple(X6,X7,X8) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
fof(49,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ in(X10,X9)
| X10 = X6
| X10 = X7
| X10 = X8
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X6
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X7
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X8
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( esk4_4(X6,X7,X8,X9) != X6
| ~ in(esk4_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( esk4_4(X6,X7,X8,X9) != X7
| ~ in(esk4_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( esk4_4(X6,X7,X8,X9) != X8
| ~ in(esk4_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( in(esk4_4(X6,X7,X8,X9),X9)
| esk4_4(X6,X7,X8,X9) = X6
| esk4_4(X6,X7,X8,X9) = X7
| esk4_4(X6,X7,X8,X9) = X8
| X9 = unordered_triple(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(54,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X4 ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(55,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X3 ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(56,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X2 ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(57,plain,
( X5 = X4
| X5 = X3
| X5 = X2
| X1 != unordered_triple(X2,X3,X4)
| ~ in(X5,X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(58,plain,
! [X1,X2] :
( ~ in(X1,X2)
| ? [X3] :
( in(X3,X2)
& ! [X4] :
( ~ in(X4,X2)
| ~ in(X4,X3) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(59,plain,
! [X5,X6] :
( ~ in(X5,X6)
| ? [X7] :
( in(X7,X6)
& ! [X8] :
( ~ in(X8,X6)
| ~ in(X8,X7) ) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X5,X6] :
( ~ in(X5,X6)
| ( in(esk5_2(X5,X6),X6)
& ! [X8] :
( ~ in(X8,X6)
| ~ in(X8,esk5_2(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[59]) ).
fof(61,plain,
! [X5,X6,X8] :
( ( ( ~ in(X8,X6)
| ~ in(X8,esk5_2(X5,X6)) )
& in(esk5_2(X5,X6),X6) )
| ~ in(X5,X6) ),
inference(shift_quantors,[status(thm)],[60]) ).
fof(62,plain,
! [X5,X6,X8] :
( ( ~ in(X8,X6)
| ~ in(X8,esk5_2(X5,X6))
| ~ in(X5,X6) )
& ( in(esk5_2(X5,X6),X6)
| ~ in(X5,X6) ) ),
inference(distribute,[status(thm)],[61]) ).
cnf(63,plain,
( in(esk5_2(X1,X2),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(64,plain,
( ~ in(X1,X2)
| ~ in(X3,esk5_2(X1,X2))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(101,negated_conjecture,
? [X1,X2,X3] :
( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(102,negated_conjecture,
? [X4,X5,X6] :
( in(X4,X5)
& in(X5,X6)
& in(X6,X4) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,negated_conjecture,
( in(esk10_0,esk11_0)
& in(esk11_0,esk12_0)
& in(esk12_0,esk10_0) ),
inference(skolemize,[status(esa)],[102]) ).
cnf(104,negated_conjecture,
in(esk12_0,esk10_0),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(105,negated_conjecture,
in(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(106,negated_conjecture,
in(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(158,plain,
( in(X1,X2)
| unordered_triple(X3,X4,X1) != X2 ),
inference(er,[status(thm)],[54,theory(equality)]) ).
cnf(159,plain,
( in(X1,X2)
| unordered_triple(X3,X1,X4) != X2 ),
inference(er,[status(thm)],[55,theory(equality)]) ).
cnf(162,plain,
( in(X1,X2)
| unordered_triple(X1,X3,X4) != X2 ),
inference(er,[status(thm)],[56,theory(equality)]) ).
cnf(164,plain,
( X1 = X2
| X3 = X2
| X4 = X2
| ~ in(X2,unordered_triple(X1,X3,X4)) ),
inference(er,[status(thm)],[57,theory(equality)]) ).
cnf(186,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[158,theory(equality)]) ).
cnf(189,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[159,theory(equality)]) ).
cnf(201,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[162,theory(equality)]) ).
cnf(206,plain,
( X1 = esk5_2(X2,unordered_triple(X3,X4,X1))
| X4 = esk5_2(X2,unordered_triple(X3,X4,X1))
| X3 = esk5_2(X2,unordered_triple(X3,X4,X1))
| ~ in(X2,unordered_triple(X3,X4,X1)) ),
inference(spm,[status(thm)],[164,63,theory(equality)]) ).
cnf(275,plain,
( esk5_2(X1,unordered_triple(X2,X3,X1)) = X2
| esk5_2(X1,unordered_triple(X2,X3,X1)) = X3
| esk5_2(X1,unordered_triple(X2,X3,X1)) = X1 ),
inference(spm,[status(thm)],[206,186,theory(equality)]) ).
cnf(630,plain,
( esk5_2(X2,unordered_triple(X3,X4,X2)) = X4
| esk5_2(X2,unordered_triple(X3,X4,X2)) = X3
| ~ in(X1,X2)
| ~ in(X1,unordered_triple(X3,X4,X2))
| ~ in(X2,unordered_triple(X3,X4,X2)) ),
inference(spm,[status(thm)],[64,275,theory(equality)]) ).
cnf(660,plain,
( esk5_2(X2,unordered_triple(X3,X4,X2)) = X4
| esk5_2(X2,unordered_triple(X3,X4,X2)) = X3
| ~ in(X1,X2)
| ~ in(X1,unordered_triple(X3,X4,X2))
| $false ),
inference(rw,[status(thm)],[630,186,theory(equality)]) ).
cnf(661,plain,
( esk5_2(X2,unordered_triple(X3,X4,X2)) = X4
| esk5_2(X2,unordered_triple(X3,X4,X2)) = X3
| ~ in(X1,X2)
| ~ in(X1,unordered_triple(X3,X4,X2)) ),
inference(cn,[status(thm)],[660,theory(equality)]) ).
cnf(6826,plain,
( esk5_2(X1,unordered_triple(X2,X3,X1)) = X2
| esk5_2(X1,unordered_triple(X2,X3,X1)) = X3
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[661,189,theory(equality)]) ).
cnf(64992,negated_conjecture,
( esk5_2(esk11_0,unordered_triple(X1,esk10_0,esk11_0)) = esk10_0
| esk5_2(esk11_0,unordered_triple(X1,esk10_0,esk11_0)) = X1 ),
inference(spm,[status(thm)],[6826,106,theory(equality)]) ).
cnf(65005,negated_conjecture,
( esk5_2(esk11_0,unordered_triple(X2,esk10_0,esk11_0)) = X2
| ~ in(X1,esk10_0)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0))
| ~ in(esk11_0,unordered_triple(X2,esk10_0,esk11_0)) ),
inference(spm,[status(thm)],[64,64992,theory(equality)]) ).
cnf(65174,negated_conjecture,
( esk5_2(esk11_0,unordered_triple(X2,esk10_0,esk11_0)) = X2
| ~ in(X1,esk10_0)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0))
| $false ),
inference(rw,[status(thm)],[65005,186,theory(equality)]) ).
cnf(65175,negated_conjecture,
( esk5_2(esk11_0,unordered_triple(X2,esk10_0,esk11_0)) = X2
| ~ in(X1,esk10_0)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0)) ),
inference(cn,[status(thm)],[65174,theory(equality)]) ).
cnf(74704,negated_conjecture,
( esk5_2(esk11_0,unordered_triple(X1,esk10_0,esk11_0)) = X1
| ~ in(X1,esk10_0) ),
inference(spm,[status(thm)],[65175,201,theory(equality)]) ).
cnf(75011,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0))
| ~ in(esk11_0,unordered_triple(X2,esk10_0,esk11_0))
| ~ in(X2,esk10_0) ),
inference(spm,[status(thm)],[64,74704,theory(equality)]) ).
cnf(75103,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0))
| $false
| ~ in(X2,esk10_0) ),
inference(rw,[status(thm)],[75011,186,theory(equality)]) ).
cnf(75104,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X1,unordered_triple(X2,esk10_0,esk11_0))
| ~ in(X2,esk10_0) ),
inference(cn,[status(thm)],[75103,theory(equality)]) ).
cnf(75932,negated_conjecture,
( ~ in(X1,esk10_0)
| ~ in(esk11_0,X1) ),
inference(spm,[status(thm)],[75104,186,theory(equality)]) ).
cnf(75939,negated_conjecture,
~ in(esk11_0,esk12_0),
inference(spm,[status(thm)],[75932,104,theory(equality)]) ).
cnf(75943,negated_conjecture,
$false,
inference(rw,[status(thm)],[75939,105,theory(equality)]) ).
cnf(75944,negated_conjecture,
$false,
inference(cn,[status(thm)],[75943,theory(equality)]) ).
cnf(75945,negated_conjecture,
$false,
75944,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU229+3.p
% --creating new selector for []
% -running prover on /tmp/tmpiQAFnb/sel_SEU229+3.p_1 with time limit 29
% -prover status Theorem
% Problem SEU229+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU229+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU229+3.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
%
%------------------------------------------------------------------------------