%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN050+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:10:18 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 : 15 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 71 ( 22 ~; 17 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 55 ( 6 sgn 36 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1,X2] :
? [X3] :
! [X4] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_r(X3)
& big_s(X4) ) )
=> ? [X5,X6] :
( ( big_p(X5)
& big_q(X6) )
=> ? [X7] : big_r(X7) ) ),
file('/tmp/tmpEPSZg9/sel_SYN050+1.p_1',pel20) ).
fof(2,negated_conjecture,
~ ( ! [X1,X2] :
? [X3] :
! [X4] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_r(X3)
& big_s(X4) ) )
=> ? [X5,X6] :
( ( big_p(X5)
& big_q(X6) )
=> ? [X7] : big_r(X7) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ! [X1,X2] :
? [X3] :
! [X4] :
( ~ big_p(X1)
| ~ big_q(X2)
| ( big_r(X3)
& big_s(X4) ) )
& ! [X5,X6] :
( big_p(X5)
& big_q(X6)
& ! [X7] : ~ big_r(X7) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ! [X8,X9] :
? [X10] :
! [X11] :
( ~ big_p(X8)
| ~ big_q(X9)
| ( big_r(X10)
& big_s(X11) ) )
& ! [X12,X13] :
( big_p(X12)
& big_q(X13)
& ! [X14] : ~ big_r(X14) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X8,X9,X11] :
( ~ big_p(X8)
| ~ big_q(X9)
| ( big_r(esk1_2(X8,X9))
& big_s(X11) ) )
& ! [X12,X13] :
( big_p(X12)
& big_q(X13)
& ! [X14] : ~ big_r(X14) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X8,X9,X11,X12,X13,X14] :
( ~ big_r(X14)
& big_p(X12)
& big_q(X13)
& ( ~ big_p(X8)
| ~ big_q(X9)
| ( big_r(esk1_2(X8,X9))
& big_s(X11) ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X8,X9,X11,X12,X13,X14] :
( ~ big_r(X14)
& big_p(X12)
& big_q(X13)
& ( big_r(esk1_2(X8,X9))
| ~ big_p(X8)
| ~ big_q(X9) )
& ( big_s(X11)
| ~ big_p(X8)
| ~ big_q(X9) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( big_r(esk1_2(X2,X1))
| ~ big_q(X1)
| ~ big_p(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
big_q(X1),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
big_p(X1),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
~ big_r(X1),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(14,negated_conjecture,
( big_r(esk1_2(X2,X1))
| $false
| ~ big_q(X1) ),
inference(rw,[status(thm)],[9,11,theory(equality)]),
[unfolding] ).
cnf(16,negated_conjecture,
( big_r(esk1_2(X2,X1))
| $false ),
inference(rw,[status(thm)],[14,10,theory(equality)]),
[unfolding] ).
cnf(17,negated_conjecture,
$false,
inference(sr,[status(thm)],[16,12,theory(equality)]) ).
cnf(18,negated_conjecture,
$false,
17,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN050+1.p
% --creating new selector for []
% -running prover on /tmp/tmpEPSZg9/sel_SYN050+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN050+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN050+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN050+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
%
%------------------------------------------------------------------------------