%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN055+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:10:43 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 44 ( 20 ~; 12 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( big_f(X1)
=> ( ~ big_g(X1)
& big_r(X1) ) ),
file('/tmp/tmpc35ihy/sel_SYN055+1.p_1',pel25_2) ).
fof(4,axiom,
! [X1] :
( big_p(X1)
=> ( big_g(X1)
& big_f(X1) ) ),
file('/tmp/tmpc35ihy/sel_SYN055+1.p_1',pel25_3) ).
fof(5,axiom,
? [X1] : big_p(X1),
file('/tmp/tmpc35ihy/sel_SYN055+1.p_1',pel25_1) ).
fof(7,plain,
! [X1] :
( big_f(X1)
=> ( ~ big_g(X1)
& big_r(X1) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(18,plain,
! [X1] :
( ~ big_f(X1)
| ( ~ big_g(X1)
& big_r(X1) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(19,plain,
! [X2] :
( ~ big_f(X2)
| ( ~ big_g(X2)
& big_r(X2) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
! [X2] :
( ( ~ big_g(X2)
| ~ big_f(X2) )
& ( big_r(X2)
| ~ big_f(X2) ) ),
inference(distribute,[status(thm)],[19]) ).
cnf(22,plain,
( ~ big_f(X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(23,plain,
! [X1] :
( ~ big_p(X1)
| ( big_g(X1)
& big_f(X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(24,plain,
! [X2] :
( ~ big_p(X2)
| ( big_g(X2)
& big_f(X2) ) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X2] :
( ( big_g(X2)
| ~ big_p(X2) )
& ( big_f(X2)
| ~ big_p(X2) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(26,plain,
( big_f(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,plain,
( big_g(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(28,plain,
? [X2] : big_p(X2),
inference(variable_rename,[status(thm)],[5]) ).
fof(29,plain,
big_p(esk2_0),
inference(skolemize,[status(esa)],[28]) ).
cnf(30,plain,
big_p(esk2_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(35,plain,
( ~ big_f(X1)
| ~ big_p(X1) ),
inference(spm,[status(thm)],[22,27,theory(equality)]) ).
cnf(39,plain,
~ big_p(X1),
inference(csr,[status(thm)],[35,26]) ).
cnf(40,plain,
$false,
inference(sr,[status(thm)],[30,39,theory(equality)]) ).
cnf(41,plain,
$false,
40,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN055+1.p
% --creating new selector for []
% -running prover on /tmp/tmpc35ihy/sel_SYN055+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN055+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN055+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN055+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
%
%------------------------------------------------------------------------------