%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN412+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:20:42 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 18 ~; 12 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 19 ( 8 sgn 6 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
! [X2] :
( f(X1,X2)
<=> ~ f(X1,X1) ),
file('/tmp/tmpUaZpiP/sel_SYN412+1.p_1',kalish255) ).
fof(2,negated_conjecture,
~ ~ ? [X1] :
! [X2] :
( f(X1,X2)
<=> ~ f(X1,X1) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ~ ? [X1] :
! [X2] :
( f(X1,X2)
<=> ~ f(X1,X1) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
? [X1] :
! [X2] :
( ( ~ f(X1,X2)
| ~ f(X1,X1) )
& ( f(X1,X1)
| f(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3] :
! [X4] :
( ( ~ f(X3,X4)
| ~ f(X3,X3) )
& ( f(X3,X3)
| f(X3,X4) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
! [X4] :
( ( ~ f(esk1_0,X4)
| ~ f(esk1_0,esk1_0) )
& ( f(esk1_0,esk1_0)
| f(esk1_0,X4) ) ),
inference(skolemize,[status(esa)],[5]) ).
cnf(7,negated_conjecture,
( f(esk1_0,X1)
| f(esk1_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ f(esk1_0,esk1_0)
| ~ f(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( f(esk1_0,X2)
| ~ f(esk1_0,X1) ),
inference(spm,[status(thm)],[8,7,theory(equality)]) ).
cnf(12,negated_conjecture,
( f(esk1_0,X1)
| f(esk1_0,X2) ),
inference(spm,[status(thm)],[11,7,theory(equality)]) ).
cnf(14,negated_conjecture,
f(esk1_0,X1),
inference(csr,[status(thm)],[12,11]) ).
cnf(18,negated_conjecture,
( $false
| ~ f(esk1_0,X1) ),
inference(rw,[status(thm)],[8,14,theory(equality)]) ).
cnf(19,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[18,14,theory(equality)]) ).
cnf(20,negated_conjecture,
$false,
inference(cn,[status(thm)],[19,theory(equality)]) ).
cnf(21,negated_conjecture,
$false,
20,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN412+1.p
% --creating new selector for []
% -running prover on /tmp/tmpUaZpiP/sel_SYN412+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN412+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN412+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN412+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
%
%------------------------------------------------------------------------------