TSTP Solution File: SYN049+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN049+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:07 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 9 ~; 5 |; 6 &)
% ( 0 <=>; 6 =>; 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 : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 17 ( 3 sgn 7 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
! [X2,X3] :
( ( big_p(X2)
=> big_q(X3) )
=> ( big_p(X1)
=> big_q(X1) ) ),
file('/tmp/tmpkYFKDn/sel_SYN049+1.p_1',pel19) ).
fof(2,negated_conjecture,
~ ? [X1] :
! [X2,X3] :
( ( big_p(X2)
=> big_q(X3) )
=> ( big_p(X1)
=> big_q(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1] :
? [X2,X3] :
( ( ~ big_p(X2)
| big_q(X3) )
& big_p(X1)
& ~ big_q(X1) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X4] :
? [X5,X6] :
( ( ~ big_p(X5)
| big_q(X6) )
& big_p(X4)
& ~ big_q(X4) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X4] :
( ( ~ big_p(esk1_1(X4))
| big_q(esk2_1(X4)) )
& big_p(X4)
& ~ big_q(X4) ),
inference(skolemize,[status(esa)],[4]) ).
cnf(6,negated_conjecture,
~ big_q(X1),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
big_p(X1),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(8,negated_conjecture,
( big_q(esk2_1(X1))
| ~ big_p(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(9,negated_conjecture,
( big_q(esk2_1(X1))
| $false ),
inference(rw,[status(thm)],[8,7,theory(equality)]),
[unfolding] ).
cnf(10,negated_conjecture,
$false,
inference(sr,[status(thm)],[9,6,theory(equality)]) ).
cnf(11,negated_conjecture,
$false,
10,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN049+1.p
% --creating new selector for []
% -running prover on /tmp/tmpkYFKDn/sel_SYN049+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN049+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN049+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN049+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
%
%------------------------------------------------------------------------------