%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN077+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:53 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 135 ( 10 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 160 ( 63 ~; 65 |; 27 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 32 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( big_f(X3,X2)
<=> X3 = X1 ),
file('/tmp/tmpAMlZH_/sel_SYN077+1.p_1',pel54_1) ).
fof(2,conjecture,
~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
file('/tmp/tmpAMlZH_/sel_SYN077+1.p_1',pel54) ).
fof(3,negated_conjecture,
~ ~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(4,plain,
! [X1] :
? [X2] :
! [X3] :
( ( ~ big_f(X3,X2)
| X3 = X1 )
& ( X3 != X1
| big_f(X3,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(5,plain,
! [X4] :
? [X5] :
! [X6] :
( ( ~ big_f(X6,X5)
| X6 = X4 )
& ( X6 != X4
| big_f(X6,X5) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,plain,
! [X4,X6] :
( ( ~ big_f(X6,esk1_1(X4))
| X6 = X4 )
& ( X6 != X4
| big_f(X6,esk1_1(X4)) ) ),
inference(skolemize,[status(esa)],[5]) ).
cnf(7,plain,
( big_f(X1,esk1_1(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,plain,
( X1 = X2
| ~ big_f(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
fof(9,negated_conjecture,
? [X4] :
! [X3] :
( ( ~ big_f(X3,X4)
| ! [X5] :
( ~ big_f(X3,X5)
| ? [X1] :
( big_f(X1,X5)
& ! [X2] :
( ~ big_f(X2,X5)
| ~ big_f(X2,X1) ) ) ) )
& ( ? [X5] :
( big_f(X3,X5)
& ! [X1] :
( ~ big_f(X1,X5)
| ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) )
| big_f(X3,X4) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(10,negated_conjecture,
? [X6] :
! [X7] :
( ( ~ big_f(X7,X6)
| ! [X8] :
( ~ big_f(X7,X8)
| ? [X9] :
( big_f(X9,X8)
& ! [X10] :
( ~ big_f(X10,X8)
| ~ big_f(X10,X9) ) ) ) )
& ( ? [X11] :
( big_f(X7,X11)
& ! [X12] :
( ~ big_f(X12,X11)
| ? [X13] :
( big_f(X13,X11)
& big_f(X13,X12) ) ) )
| big_f(X7,X6) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(11,negated_conjecture,
! [X7] :
( ( ~ big_f(X7,esk2_0)
| ! [X8] :
( ~ big_f(X7,X8)
| ( big_f(esk3_2(X7,X8),X8)
& ! [X10] :
( ~ big_f(X10,X8)
| ~ big_f(X10,esk3_2(X7,X8)) ) ) ) )
& ( ( big_f(X7,esk4_1(X7))
& ! [X12] :
( ~ big_f(X12,esk4_1(X7))
| ( big_f(esk5_2(X7,X12),esk4_1(X7))
& big_f(esk5_2(X7,X12),X12) ) ) )
| big_f(X7,esk2_0) ) ),
inference(skolemize,[status(esa)],[10]) ).
fof(12,negated_conjecture,
! [X7,X8,X10,X12] :
( ( ( ( ~ big_f(X12,esk4_1(X7))
| ( big_f(esk5_2(X7,X12),esk4_1(X7))
& big_f(esk5_2(X7,X12),X12) ) )
& big_f(X7,esk4_1(X7)) )
| big_f(X7,esk2_0) )
& ( ( ( ~ big_f(X10,X8)
| ~ big_f(X10,esk3_2(X7,X8)) )
& big_f(esk3_2(X7,X8),X8) )
| ~ big_f(X7,X8)
| ~ big_f(X7,esk2_0) ) ),
inference(shift_quantors,[status(thm)],[11]) ).
fof(13,negated_conjecture,
! [X7,X8,X10,X12] :
( ( big_f(esk5_2(X7,X12),esk4_1(X7))
| ~ big_f(X12,esk4_1(X7))
| big_f(X7,esk2_0) )
& ( big_f(esk5_2(X7,X12),X12)
| ~ big_f(X12,esk4_1(X7))
| big_f(X7,esk2_0) )
& ( big_f(X7,esk4_1(X7))
| big_f(X7,esk2_0) )
& ( ~ big_f(X10,X8)
| ~ big_f(X10,esk3_2(X7,X8))
| ~ big_f(X7,X8)
| ~ big_f(X7,esk2_0) )
& ( big_f(esk3_2(X7,X8),X8)
| ~ big_f(X7,X8)
| ~ big_f(X7,esk2_0) ) ),
inference(distribute,[status(thm)],[12]) ).
cnf(14,negated_conjecture,
( big_f(esk3_2(X1,X2),X2)
| ~ big_f(X1,esk2_0)
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(15,negated_conjecture,
( ~ big_f(X1,esk2_0)
| ~ big_f(X1,X2)
| ~ big_f(X3,esk3_2(X1,X2))
| ~ big_f(X3,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(16,negated_conjecture,
( big_f(X1,esk2_0)
| big_f(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(17,negated_conjecture,
( big_f(X1,esk2_0)
| big_f(esk5_2(X1,X2),X2)
| ~ big_f(X2,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(18,negated_conjecture,
( big_f(X1,esk2_0)
| big_f(esk5_2(X1,X2),esk4_1(X1))
| ~ big_f(X2,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(19,plain,
big_f(X1,esk1_1(X1)),
inference(er,[status(thm)],[7,theory(equality)]) ).
cnf(20,negated_conjecture,
( big_f(esk5_2(X1,X1),X1)
| big_f(X1,esk2_0) ),
inference(spm,[status(thm)],[17,16,theory(equality)]) ).
cnf(21,negated_conjecture,
( big_f(esk5_2(X1,X1),esk4_1(X1))
| big_f(X1,esk2_0) ),
inference(spm,[status(thm)],[18,16,theory(equality)]) ).
cnf(22,negated_conjecture,
( big_f(esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(esk5_2(esk2_0,esk2_0),X2))
| ~ big_f(X1,X2)
| ~ big_f(esk5_2(esk2_0,esk2_0),X2) ),
inference(spm,[status(thm)],[15,20,theory(equality)]) ).
cnf(26,negated_conjecture,
( big_f(esk3_2(esk5_2(esk2_0,esk2_0),X1),X1)
| big_f(esk2_0,esk2_0)
| ~ big_f(esk5_2(esk2_0,esk2_0),X1) ),
inference(spm,[status(thm)],[14,20,theory(equality)]) ).
cnf(32,negated_conjecture,
( big_f(esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0)))
| ~ big_f(X1,esk4_1(esk2_0)) ),
inference(spm,[status(thm)],[22,21,theory(equality)]) ).
cnf(42,negated_conjecture,
( big_f(esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0)),esk4_1(esk2_0))
| big_f(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[26,21,theory(equality)]) ).
cnf(49,negated_conjecture,
( big_f(esk5_2(esk2_0,esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0))),esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0)))
| big_f(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[17,42,theory(equality)]) ).
cnf(50,negated_conjecture,
( big_f(esk5_2(esk2_0,esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0))),esk4_1(esk2_0))
| big_f(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[18,42,theory(equality)]) ).
cnf(58,negated_conjecture,
( big_f(esk2_0,esk2_0)
| ~ big_f(esk5_2(esk2_0,esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0))),esk3_2(esk5_2(esk2_0,esk2_0),esk4_1(esk2_0))) ),
inference(spm,[status(thm)],[32,50,theory(equality)]) ).
cnf(190,negated_conjecture,
big_f(esk2_0,esk2_0),
inference(csr,[status(thm)],[49,58]) ).
cnf(191,negated_conjecture,
( ~ big_f(X1,esk3_2(esk2_0,X2))
| ~ big_f(X1,X2)
| ~ big_f(esk2_0,X2) ),
inference(spm,[status(thm)],[15,190,theory(equality)]) ).
cnf(192,negated_conjecture,
( big_f(esk3_2(esk2_0,X1),X1)
| ~ big_f(esk2_0,X1) ),
inference(spm,[status(thm)],[14,190,theory(equality)]) ).
cnf(224,negated_conjecture,
( ~ big_f(X1,esk3_2(esk2_0,esk1_1(esk2_0)))
| ~ big_f(X1,esk1_1(esk2_0)) ),
inference(spm,[status(thm)],[191,19,theory(equality)]) ).
cnf(237,negated_conjecture,
~ big_f(esk2_0,esk3_2(esk2_0,esk1_1(esk2_0))),
inference(spm,[status(thm)],[224,19,theory(equality)]) ).
cnf(242,negated_conjecture,
big_f(esk3_2(esk2_0,esk1_1(esk2_0)),esk1_1(esk2_0)),
inference(spm,[status(thm)],[192,19,theory(equality)]) ).
cnf(289,negated_conjecture,
esk3_2(esk2_0,esk1_1(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[8,242,theory(equality)]) ).
cnf(292,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[237,289,theory(equality)]),190,theory(equality)]) ).
cnf(293,negated_conjecture,
$false,
inference(cn,[status(thm)],[292,theory(equality)]) ).
cnf(294,negated_conjecture,
$false,
293,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN077+1.p
% --creating new selector for []
% -running prover on /tmp/tmpAMlZH_/sel_SYN077+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN077+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN077+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN077+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
%
%------------------------------------------------------------------------------