TSTP Solution File: SYN731+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN731+1 : TPTP v5.0.0. Released v2.5.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:55:58 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 26 ( 1 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
( ! [X2] :
? [X3] : p(X1,X2,X3)
=> ? [X4] : p(X4,X4,X1) ),
file('/tmp/tmps6lnwM/sel_SYN731+1.p_1',x2150) ).
fof(2,negated_conjecture,
~ ? [X1] :
( ! [X2] :
? [X3] : p(X1,X2,X3)
=> ? [X4] : p(X4,X4,X1) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1] :
( ! [X2] :
? [X3] : p(X1,X2,X3)
& ! [X4] : ~ p(X4,X4,X1) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X5] :
( ! [X6] :
? [X7] : p(X5,X6,X7)
& ! [X8] : ~ p(X8,X8,X5) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X5] :
( ! [X6] : p(X5,X6,esk1_2(X5,X6))
& ! [X8] : ~ p(X8,X8,X5) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X5,X6,X8] :
( ~ p(X8,X8,X5)
& p(X5,X6,esk1_2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
p(X1,X2,esk1_2(X1,X2)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
~ p(X1,X1,X2),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
$false,
inference(spm,[status(thm)],[8,7,theory(equality)]) ).
cnf(10,negated_conjecture,
$false,
9,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN731+1.p
% --creating new selector for []
% -running prover on /tmp/tmps6lnwM/sel_SYN731+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN731+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN731+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN731+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
%
%------------------------------------------------------------------------------