%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN371+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:17:49 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 28 ( 10 ~; 4 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 24 ( 0 sgn 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ? [X1] : big_r(X1,X1)
=> ! [X2] : big_r(X2,X2) )
=> ? [X3] :
! [X4] :
( big_r(X3,X3)
=> big_r(X4,X4) ) ),
file('/tmp/tmpawTH2h/sel_SYN371+1.p_1',x2122) ).
fof(2,negated_conjecture,
~ ( ( ? [X1] : big_r(X1,X1)
=> ! [X2] : big_r(X2,X2) )
=> ? [X3] :
! [X4] :
( big_r(X3,X3)
=> big_r(X4,X4) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ! [X1] : ~ big_r(X1,X1)
| ! [X2] : big_r(X2,X2) )
& ! [X3] :
? [X4] :
( big_r(X3,X3)
& ~ big_r(X4,X4) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ! [X5] : ~ big_r(X5,X5)
| ! [X6] : big_r(X6,X6) )
& ! [X7] :
? [X8] :
( big_r(X7,X7)
& ~ big_r(X8,X8) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ! [X5] : ~ big_r(X5,X5)
| ! [X6] : big_r(X6,X6) )
& ! [X7] :
( big_r(X7,X7)
& ~ big_r(esk1_1(X7),esk1_1(X7)) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X5,X6,X7] :
( big_r(X7,X7)
& ~ big_r(esk1_1(X7),esk1_1(X7))
& ( big_r(X6,X6)
| ~ big_r(X5,X5) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(8,negated_conjecture,
~ big_r(esk1_1(X1),esk1_1(X1)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
big_r(X1,X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
$false,
inference(rw,[status(thm)],[8,9,theory(equality)]) ).
cnf(11,negated_conjecture,
$false,
inference(cn,[status(thm)],[10,theory(equality)]) ).
cnf(12,negated_conjecture,
$false,
11,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN371+1.p
% --creating new selector for []
% -running prover on /tmp/tmpawTH2h/sel_SYN371+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN371+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN371+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN371+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
%
%------------------------------------------------------------------------------