TSTP Solution File: SYN075+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN075+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 13:12:41 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 7 unt; 0 def)
% Number of atoms : 125 ( 78 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 147 ( 55 ~; 63 |; 24 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 2 sgn 29 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
? [X1,X2] :
! [X3,X4] :
( big_f(X3,X4)
<=> ( X3 = X1
& X4 = X2 ) ),
file('/tmp/tmpxK6CGp/sel_SYN075+1.p_1',pel52_1) ).
fof(2,conjecture,
? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
file('/tmp/tmpxK6CGp/sel_SYN075+1.p_1',pel52) ).
fof(3,negated_conjecture,
~ ? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
inference(assume_negation,[status(cth)],[2]) ).
fof(4,plain,
? [X1,X2] :
! [X3,X4] :
( ( ~ big_f(X3,X4)
| ( X3 = X1
& X4 = X2 ) )
& ( X3 != X1
| X4 != X2
| big_f(X3,X4) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(5,plain,
? [X5,X6] :
! [X7,X8] :
( ( ~ big_f(X7,X8)
| ( X7 = X5
& X8 = X6 ) )
& ( X7 != X5
| X8 != X6
| big_f(X7,X8) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,plain,
! [X7,X8] :
( ( ~ big_f(X7,X8)
| ( X7 = esk1_0
& X8 = esk2_0 ) )
& ( X7 != esk1_0
| X8 != esk2_0
| big_f(X7,X8) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,plain,
! [X7,X8] :
( ( X7 = esk1_0
| ~ big_f(X7,X8) )
& ( X8 = esk2_0
| ~ big_f(X7,X8) )
& ( X7 != esk1_0
| X8 != esk2_0
| big_f(X7,X8) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,plain,
( big_f(X1,X2)
| X2 != esk2_0
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,plain,
( X2 = esk2_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,plain,
( X1 = esk1_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
fof(11,negated_conjecture,
! [X2] :
? [X4] :
( ( ! [X1] :
? [X3] :
( ( ~ big_f(X3,X4)
| X3 != X1 )
& ( big_f(X3,X4)
| X3 = X1 ) )
| X4 != X2 )
& ( ? [X1] :
! [X3] :
( ( ~ big_f(X3,X4)
| X3 = X1 )
& ( X3 != X1
| big_f(X3,X4) ) )
| X4 = X2 ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(12,negated_conjecture,
! [X5] :
? [X6] :
( ( ! [X7] :
? [X8] :
( ( ~ big_f(X8,X6)
| X8 != X7 )
& ( big_f(X8,X6)
| X8 = X7 ) )
| X6 != X5 )
& ( ? [X9] :
! [X10] :
( ( ~ big_f(X10,X6)
| X10 = X9 )
& ( X10 != X9
| big_f(X10,X6) ) )
| X6 = X5 ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,negated_conjecture,
! [X5] :
( ( ! [X7] :
( ( ~ big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) != X7 )
& ( big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) = X7 ) )
| esk3_1(X5) != X5 )
& ( ! [X10] :
( ( ~ big_f(X10,esk3_1(X5))
| X10 = esk5_1(X5) )
& ( X10 != esk5_1(X5)
| big_f(X10,esk3_1(X5)) ) )
| esk3_1(X5) = X5 ) ),
inference(skolemize,[status(esa)],[12]) ).
fof(14,negated_conjecture,
! [X5,X7,X10] :
( ( ( ( ~ big_f(X10,esk3_1(X5))
| X10 = esk5_1(X5) )
& ( X10 != esk5_1(X5)
| big_f(X10,esk3_1(X5)) ) )
| esk3_1(X5) = X5 )
& ( ( ( ~ big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) != X7 )
& ( big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) = X7 ) )
| esk3_1(X5) != X5 ) ),
inference(shift_quantors,[status(thm)],[13]) ).
fof(15,negated_conjecture,
! [X5,X7,X10] :
( ( ~ big_f(X10,esk3_1(X5))
| X10 = esk5_1(X5)
| esk3_1(X5) = X5 )
& ( X10 != esk5_1(X5)
| big_f(X10,esk3_1(X5))
| esk3_1(X5) = X5 )
& ( ~ big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) != X7
| esk3_1(X5) != X5 )
& ( big_f(esk4_2(X5,X7),esk3_1(X5))
| esk4_2(X5,X7) = X7
| esk3_1(X5) != X5 ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
( esk4_2(X1,X2) = X2
| big_f(esk4_2(X1,X2),esk3_1(X1))
| esk3_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
( esk3_1(X1) != X1
| esk4_2(X1,X2) != X2
| ~ big_f(esk4_2(X1,X2),esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(18,negated_conjecture,
( esk3_1(X1) = X1
| big_f(X2,esk3_1(X1))
| X2 != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(20,plain,
( big_f(esk1_0,X1)
| esk2_0 != X1 ),
inference(er,[status(thm)],[8,theory(equality)]) ).
cnf(21,negated_conjecture,
( esk3_1(X1) = X1
| big_f(esk5_1(X1),esk3_1(X1)) ),
inference(er,[status(thm)],[18,theory(equality)]) ).
cnf(23,negated_conjecture,
( esk2_0 = esk3_1(X1)
| esk3_1(X1) = X1 ),
inference(spm,[status(thm)],[9,21,theory(equality)]) ).
cnf(28,plain,
big_f(esk1_0,esk2_0),
inference(er,[status(thm)],[20,theory(equality)]) ).
cnf(30,negated_conjecture,
( esk3_1(X2) = X2
| esk2_0 != X2 ),
inference(ef,[status(thm)],[23,theory(equality)]) ).
cnf(40,negated_conjecture,
esk3_1(esk2_0) = esk2_0,
inference(er,[status(thm)],[30,theory(equality)]) ).
cnf(44,negated_conjecture,
( esk4_2(esk2_0,X1) != X1
| ~ big_f(esk4_2(esk2_0,X1),esk2_0) ),
inference(spm,[status(thm)],[17,40,theory(equality)]) ).
cnf(45,negated_conjecture,
( esk4_2(esk2_0,X1) = X1
| big_f(esk4_2(esk2_0,X1),esk2_0) ),
inference(spm,[status(thm)],[16,40,theory(equality)]) ).
cnf(47,negated_conjecture,
( esk1_0 = esk4_2(esk2_0,X1)
| esk4_2(esk2_0,X1) = X1 ),
inference(spm,[status(thm)],[10,45,theory(equality)]) ).
cnf(54,negated_conjecture,
( esk4_2(esk2_0,X2) = X2
| esk1_0 != X2 ),
inference(ef,[status(thm)],[47,theory(equality)]) ).
cnf(78,negated_conjecture,
esk4_2(esk2_0,esk1_0) = esk1_0,
inference(er,[status(thm)],[54,theory(equality)]) ).
cnf(80,negated_conjecture,
~ big_f(esk1_0,esk2_0),
inference(spm,[status(thm)],[44,78,theory(equality)]) ).
cnf(84,negated_conjecture,
$false,
inference(rw,[status(thm)],[80,28,theory(equality)]) ).
cnf(85,negated_conjecture,
$false,
inference(cn,[status(thm)],[84,theory(equality)]) ).
cnf(86,negated_conjecture,
$false,
85,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN075+1.p
% --creating new selector for []
% -running prover on /tmp/tmpxK6CGp/sel_SYN075+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN075+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN075+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN075+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
%
%------------------------------------------------------------------------------