TSTP Solution File: SET055+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET055+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : merrimac.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 08:04:11 EDT 2012
% Result : Theorem 0.05s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 7 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 2 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1] : equal(X1,X1),
file('/tmp/tmpPsTIuE/sel_SET055+1.p_1',reflexivity) ).
fof(2,negated_conjecture,
~ ! [X1] : equal(X1,X1),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1] : ~ equal(X1,X1),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X2] : ~ equal(X2,X2),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
~ equal(esk1_0,esk1_0),
inference(skolemize,[status(esa)],[4]) ).
cnf(6,negated_conjecture,
$false,
inference(split_conjunct,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
$false,
6,
[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/SET/SET055+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpPsTIuE/sel_SET055+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpPsTIuE/sel_SET055+1.p_1']
% -prover status Theorem
% Problem SET055+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET055+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET055+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
%
%------------------------------------------------------------------------------