%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN397+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:19:39 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 27 ~; 17 |; 4 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 4 sgn 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ~ ? [X1] : f(X1)
<=> ! [X2] : ~ f(X2) ),
file('/tmp/tmpwMOS8w/sel_SYN397+1.p_1',kalish204) ).
fof(2,negated_conjecture,
~ ( ~ ? [X1] : f(X1)
<=> ! [X2] : ~ f(X2) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ~ ? [X1] : f(X1)
<=> ! [X2] : ~ f(X2) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ( ? [X1] : f(X1)
| ? [X2] : f(X2) )
& ( ! [X1] : ~ f(X1)
| ! [X2] : ~ f(X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ? [X3] : f(X3)
| ? [X4] : f(X4) )
& ( ! [X5] : ~ f(X5)
| ! [X6] : ~ f(X6) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ( f(esk1_0)
| f(esk2_0) )
& ( ! [X5] : ~ f(X5)
| ! [X6] : ~ f(X6) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X5,X6] :
( ( ~ f(X6)
| ~ f(X5) )
& ( f(esk1_0)
| f(esk2_0) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( f(esk2_0)
| f(esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
fof(10,plain,
( ~ epred1_0
<=> ! [X2] : ~ f(X2) ),
introduced(definition),
[split] ).
cnf(11,plain,
( epred1_0
| ~ f(X2) ),
inference(split_equiv,[status(thm)],[10]) ).
fof(12,plain,
( ~ epred2_0
<=> ! [X1] : ~ f(X1) ),
introduced(definition),
[split] ).
cnf(13,plain,
( epred2_0
| ~ f(X1) ),
inference(split_equiv,[status(thm)],[12]) ).
cnf(14,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,10,theory(equality)]),12,theory(equality)]),
[split] ).
cnf(15,negated_conjecture,
( epred1_0
| f(esk1_0) ),
inference(spm,[status(thm)],[11,8,theory(equality)]) ).
cnf(16,negated_conjecture,
epred1_0,
inference(csr,[status(thm)],[15,11]) ).
cnf(18,negated_conjecture,
( epred2_0
| f(esk1_0) ),
inference(spm,[status(thm)],[13,8,theory(equality)]) ).
cnf(19,negated_conjecture,
epred2_0,
inference(csr,[status(thm)],[18,13]) ).
cnf(21,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[14,19,theory(equality)]) ).
cnf(22,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[21,16,theory(equality)]) ).
cnf(23,negated_conjecture,
$false,
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(24,negated_conjecture,
$false,
23,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN397+1.p
% --creating new selector for []
% -running prover on /tmp/tmpwMOS8w/sel_SYN397+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN397+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN397+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN397+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
%
%------------------------------------------------------------------------------