TSTP Solution File: SEU151+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU151+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:53:26 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 19 unt; 0 def)
% Number of atoms : 132 ( 97 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 155 ( 60 ~; 58 |; 35 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 67 ( 4 sgn 36 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/tmp/tmps9LHGu/sel_SEU151+1.p_1',commutativity_k2_tarski) ).
fof(3,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/tmp/tmps9LHGu/sel_SEU151+1.p_1',d2_tarski) ).
fof(4,conjecture,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/tmp/tmps9LHGu/sel_SEU151+1.p_1',t10_zfmisc_1) ).
fof(6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
inference(assume_negation,[status(cth)],[4]) ).
fof(11,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[2]) ).
cnf(12,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[11]) ).
fof(13,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)],[3]) ).
fof(14,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)],[13]) ).
fof(15,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(esk1_3(X5,X6,X7),X7)
| ( esk1_3(X5,X6,X7) != X5
& esk1_3(X5,X6,X7) != X6 ) )
& ( in(esk1_3(X5,X6,X7),X7)
| esk1_3(X5,X6,X7) = X5
| esk1_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(skolemize,[status(esa)],[14]) ).
fof(16,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(esk1_3(X5,X6,X7),X7)
| ( esk1_3(X5,X6,X7) != X5
& esk1_3(X5,X6,X7) != X6 ) )
& ( in(esk1_3(X5,X6,X7),X7)
| esk1_3(X5,X6,X7) = X5
| esk1_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[15]) ).
fof(17,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) )
& ( esk1_3(X5,X6,X7) != X5
| ~ in(esk1_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk1_3(X5,X6,X7) != X6
| ~ in(esk1_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk1_3(X5,X6,X7),X7)
| esk1_3(X5,X6,X7) = X5
| esk1_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[16]) ).
cnf(21,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(23,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(24,negated_conjecture,
? [X1,X2,X3,X4] :
( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(25,negated_conjecture,
? [X5,X6,X7,X8] :
( unordered_pair(X5,X6) = unordered_pair(X7,X8)
& X5 != X7
& X5 != X8 ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk2_0 != esk4_0
& esk2_0 != esk5_0 ),
inference(skolemize,[status(esa)],[25]) ).
cnf(27,negated_conjecture,
esk2_0 != esk5_0,
inference(split_conjunct,[status(thm)],[26]) ).
cnf(28,negated_conjecture,
esk2_0 != esk4_0,
inference(split_conjunct,[status(thm)],[26]) ).
cnf(29,negated_conjecture,
unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(31,plain,
( in(X1,X2)
| unordered_pair(X3,X1) != X2 ),
inference(er,[status(thm)],[21,theory(equality)]) ).
cnf(33,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X1,X3)) ),
inference(er,[status(thm)],[23,theory(equality)]) ).
cnf(38,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[31,theory(equality)]) ).
cnf(42,negated_conjecture,
in(esk5_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[38,29,theory(equality)]) ).
cnf(43,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[38,12,theory(equality)]) ).
cnf(49,negated_conjecture,
in(esk4_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[43,29,theory(equality)]) ).
cnf(71,negated_conjecture,
( esk3_0 = esk5_0
| esk2_0 = esk5_0 ),
inference(spm,[status(thm)],[33,42,theory(equality)]) ).
cnf(76,negated_conjecture,
esk3_0 = esk5_0,
inference(sr,[status(thm)],[71,27,theory(equality)]) ).
cnf(78,negated_conjecture,
in(esk4_0,unordered_pair(esk2_0,esk5_0)),
inference(rw,[status(thm)],[49,76,theory(equality)]) ).
cnf(80,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = unordered_pair(esk2_0,esk5_0),
inference(rw,[status(thm)],[29,76,theory(equality)]) ).
cnf(94,negated_conjecture,
( esk5_0 = esk4_0
| esk2_0 = esk4_0 ),
inference(spm,[status(thm)],[33,78,theory(equality)]) ).
cnf(95,negated_conjecture,
esk5_0 = esk4_0,
inference(sr,[status(thm)],[94,28,theory(equality)]) ).
cnf(97,negated_conjecture,
unordered_pair(esk4_0,esk4_0) = unordered_pair(esk2_0,esk5_0),
inference(rw,[status(thm)],[80,95,theory(equality)]) ).
cnf(98,negated_conjecture,
unordered_pair(esk4_0,esk4_0) = unordered_pair(esk2_0,esk4_0),
inference(rw,[status(thm)],[97,95,theory(equality)]) ).
cnf(111,negated_conjecture,
( esk4_0 = X1
| ~ in(X1,unordered_pair(esk2_0,esk4_0)) ),
inference(spm,[status(thm)],[33,98,theory(equality)]) ).
cnf(120,negated_conjecture,
esk4_0 = esk2_0,
inference(spm,[status(thm)],[111,43,theory(equality)]) ).
cnf(122,negated_conjecture,
$false,
inference(sr,[status(thm)],[120,28,theory(equality)]) ).
cnf(123,negated_conjecture,
$false,
122,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU151+1.p
% --creating new selector for []
% -running prover on /tmp/tmps9LHGu/sel_SEU151+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU151+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU151+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU151+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
%
%------------------------------------------------------------------------------