TSTP Solution File: SYN372+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN372+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:22:19 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 11 ~; 6 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 2 sgn 6 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1] :
( ? [X2] :
( big_p(X2)
=> big_q(X1) )
=> ? [X2] :
( big_p(X2)
=> big_q(X2) ) ),
file('/tmp/tmpz58Opj/sel_SYN372+1.p_1',x2123) ).
fof(2,negated_conjecture,
~ ! [X1] :
( ? [X2] :
( big_p(X2)
=> big_q(X1) )
=> ? [X2] :
( big_p(X2)
=> big_q(X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1] :
( ? [X2] :
( ~ big_p(X2)
| big_q(X1) )
& ! [X2] :
( big_p(X2)
& ~ big_q(X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X3] :
( ? [X4] :
( ~ big_p(X4)
| big_q(X3) )
& ! [X5] :
( big_p(X5)
& ~ big_q(X5) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ~ big_p(esk2_0)
| big_q(esk1_0) )
& ! [X5] :
( big_p(X5)
& ~ big_q(X5) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X5] :
( big_p(X5)
& ~ big_q(X5)
& ( ~ big_p(esk2_0)
| big_q(esk1_0) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
( big_q(esk1_0)
| ~ big_p(esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
~ big_q(X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
big_p(X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_q(esk1_0)
| $false ),
inference(rw,[status(thm)],[7,9,theory(equality)]),
[unfolding] ).
cnf(11,negated_conjecture,
$false,
inference(sr,[status(thm)],[10,8,theory(equality)]) ).
cnf(12,negated_conjecture,
$false,
11,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN372+1.p
% --creating new selector for []
% -running prover on /tmp/tmpz58Opj/sel_SYN372+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN372+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN372+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN372+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
%
%------------------------------------------------------------------------------