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