TSTP Solution File: SYN361+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN361+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:17:07 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 62 ( 24 ~; 11 |; 18 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 2 sgn 32 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ? [X1] :
! [X2] : big_p(X2,X1)
& ! [X2] :
( big_s(X2)
=> ? [X3] : big_q(X3,X2) )
& ! [X2,X3] :
( big_p(X2,X3)
=> ~ big_q(X2,X3) ) )
=> ? [X4] : ~ big_s(X4) ),
file('/tmp/tmpPFYA3u/sel_SYN361+1.p_1',x2112) ).
fof(2,negated_conjecture,
~ ( ( ? [X1] :
! [X2] : big_p(X2,X1)
& ! [X2] :
( big_s(X2)
=> ? [X3] : big_q(X3,X2) )
& ! [X2,X3] :
( big_p(X2,X3)
=> ~ big_q(X2,X3) ) )
=> ? [X4] : ~ big_s(X4) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ( ? [X1] :
! [X2] : big_p(X2,X1)
& ! [X2] :
( big_s(X2)
=> ? [X3] : big_q(X3,X2) )
& ! [X2,X3] :
( big_p(X2,X3)
=> ~ big_q(X2,X3) ) )
=> ? [X4] : ~ big_s(X4) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ? [X1] :
! [X2] : big_p(X2,X1)
& ! [X2] :
( ~ big_s(X2)
| ? [X3] : big_q(X3,X2) )
& ! [X2,X3] :
( ~ big_p(X2,X3)
| ~ big_q(X2,X3) )
& ! [X4] : big_s(X4) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ? [X5] :
! [X6] : big_p(X6,X5)
& ! [X7] :
( ~ big_s(X7)
| ? [X8] : big_q(X8,X7) )
& ! [X9,X10] :
( ~ big_p(X9,X10)
| ~ big_q(X9,X10) )
& ! [X11] : big_s(X11) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X6] : big_p(X6,esk1_0)
& ! [X7] :
( ~ big_s(X7)
| big_q(esk2_1(X7),X7) )
& ! [X9,X10] :
( ~ big_p(X9,X10)
| ~ big_q(X9,X10) )
& ! [X11] : big_s(X11) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X6,X7,X9,X10,X11] :
( big_s(X11)
& ( ~ big_p(X9,X10)
| ~ big_q(X9,X10) )
& ( ~ big_s(X7)
| big_q(esk2_1(X7),X7) )
& big_p(X6,esk1_0) ),
inference(shift_quantors,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
big_p(X1,esk1_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( big_q(esk2_1(X1),X1)
| ~ big_s(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( ~ big_q(X1,X2)
| ~ big_p(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
big_s(X1),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( big_q(esk2_1(X1),X1)
| $false ),
inference(rw,[status(thm)],[9,11,theory(equality)]),
[unfolding] ).
cnf(13,negated_conjecture,
~ big_p(esk2_1(X1),X1),
inference(spm,[status(thm)],[10,12,theory(equality)]) ).
cnf(14,negated_conjecture,
$false,
inference(spm,[status(thm)],[13,8,theory(equality)]) ).
cnf(15,negated_conjecture,
$false,
14,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN361+1.p
% --creating new selector for []
% -running prover on /tmp/tmpPFYA3u/sel_SYN361+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN361+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN361+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN361+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
%
%------------------------------------------------------------------------------