%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN325+1 : TPTP v5.0.0. Released v2.0.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 13:14:25 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 43 ( 12 ~; 10 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 15 ( 2 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
! [X2] :
( ( ( big_f(X1,X1)
=> big_f(X2,X2) )
=> ( big_f(X1,X2)
& big_g(X1) ) )
=> big_g(X2) ),
file('/tmp/tmpOQsE94/sel_SYN325+1.p_1',church_46_9_2) ).
fof(2,negated_conjecture,
~ ? [X1] :
! [X2] :
( ( ( big_f(X1,X1)
=> big_f(X2,X2) )
=> ( big_f(X1,X2)
& big_g(X1) ) )
=> big_g(X2) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1] :
? [X2] :
( ( ( big_f(X1,X1)
& ~ big_f(X2,X2) )
| ( big_f(X1,X2)
& big_g(X1) ) )
& ~ big_g(X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X3] :
? [X4] :
( ( ( big_f(X3,X3)
& ~ big_f(X4,X4) )
| ( big_f(X3,X4)
& big_g(X3) ) )
& ~ big_g(X4) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X3] :
( ( ( big_f(X3,X3)
& ~ big_f(esk1_1(X3),esk1_1(X3)) )
| ( big_f(X3,esk1_1(X3))
& big_g(X3) ) )
& ~ big_g(esk1_1(X3)) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X3] :
( ( big_f(X3,esk1_1(X3))
| big_f(X3,X3) )
& ( big_g(X3)
| big_f(X3,X3) )
& ( big_f(X3,esk1_1(X3))
| ~ big_f(esk1_1(X3),esk1_1(X3)) )
& ( big_g(X3)
| ~ big_f(esk1_1(X3),esk1_1(X3)) )
& ~ big_g(esk1_1(X3)) ),
inference(distribute,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
~ big_g(esk1_1(X1)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_g(X1)
| ~ big_f(esk1_1(X1),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_f(X1,X1)
| big_g(X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( big_g(X1)
| big_g(esk1_1(X1)) ),
inference(spm,[status(thm)],[8,10,theory(equality)]) ).
cnf(13,negated_conjecture,
big_g(X1),
inference(sr,[status(thm)],[12,7,theory(equality)]) ).
cnf(16,negated_conjecture,
$false,
inference(rw,[status(thm)],[7,13,theory(equality)]) ).
cnf(17,negated_conjecture,
$false,
inference(cn,[status(thm)],[16,theory(equality)]) ).
cnf(18,negated_conjecture,
$false,
17,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN325+1.p
% --creating new selector for []
% -running prover on /tmp/tmpOQsE94/sel_SYN325+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN325+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN325+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN325+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
%
%------------------------------------------------------------------------------