%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWW469+1 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 27 14:41:05 EST 2011
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 88 ( 7 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 97 ( 38 ~; 33 |; 21 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
( hoare_165779456gleton
<=> ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& ~ equal(X1,X2) ) ),
file('/tmp/tmpyyn8Yl/sel_SWW469+1.p_1',fact_0_state__not__singleton__def) ).
fof(5,conjecture,
! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> equal(X1,X2) ) ),
file('/tmp/tmpyyn8Yl/sel_SWW469+1.p_1',conj_1) ).
fof(6,axiom,
hoare_165779456gleton,
file('/tmp/tmpyyn8Yl/sel_SWW469+1.p_1',conj_0) ).
fof(8,negated_conjecture,
~ ! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> equal(X1,X2) ) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(10,plain,
( ( ~ hoare_165779456gleton
| ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& ~ equal(X1,X2) ) )
& ( ! [X1,X2] :
( ~ is_state(X1)
| ~ is_state(X2)
| equal(X1,X2) )
| hoare_165779456gleton ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(11,plain,
( ( ~ hoare_165779456gleton
| ? [X3,X4] :
( is_state(X3)
& is_state(X4)
& ~ equal(X3,X4) ) )
& ( ! [X5,X6] :
( ~ is_state(X5)
| ~ is_state(X6)
| equal(X5,X6) )
| hoare_165779456gleton ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
( ( ~ hoare_165779456gleton
| ( is_state(esk1_0)
& is_state(esk2_0)
& ~ equal(esk1_0,esk2_0) ) )
& ( ! [X5,X6] :
( ~ is_state(X5)
| ~ is_state(X6)
| equal(X5,X6) )
| hoare_165779456gleton ) ),
inference(skolemize,[status(esa)],[11]) ).
fof(13,plain,
! [X5,X6] :
( ( ~ is_state(X5)
| ~ is_state(X6)
| equal(X5,X6)
| hoare_165779456gleton )
& ( ~ hoare_165779456gleton
| ( is_state(esk1_0)
& is_state(esk2_0)
& ~ equal(esk1_0,esk2_0) ) ) ),
inference(shift_quantors,[status(thm)],[12]) ).
fof(14,plain,
! [X5,X6] :
( ( ~ is_state(X5)
| ~ is_state(X6)
| equal(X5,X6)
| hoare_165779456gleton )
& ( is_state(esk1_0)
| ~ hoare_165779456gleton )
& ( is_state(esk2_0)
| ~ hoare_165779456gleton )
& ( ~ equal(esk1_0,esk2_0)
| ~ hoare_165779456gleton ) ),
inference(distribute,[status(thm)],[13]) ).
cnf(15,plain,
( ~ hoare_165779456gleton
| esk1_0 != esk2_0 ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,plain,
( is_state(esk2_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,plain,
( is_state(esk1_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(22,negated_conjecture,
? [X2] :
( is_state(X2)
& ! [X1] :
( ~ is_state(X1)
| equal(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(23,negated_conjecture,
? [X3] :
( is_state(X3)
& ! [X4] :
( ~ is_state(X4)
| equal(X4,X3) ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( is_state(esk3_0)
& ! [X4] :
( ~ is_state(X4)
| equal(X4,esk3_0) ) ),
inference(skolemize,[status(esa)],[23]) ).
fof(25,negated_conjecture,
! [X4] :
( ( ~ is_state(X4)
| equal(X4,esk3_0) )
& is_state(esk3_0) ),
inference(shift_quantors,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
( X1 = esk3_0
| ~ is_state(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(28,plain,
hoare_165779456gleton,
inference(split_conjunct,[status(thm)],[6]) ).
cnf(32,plain,
( is_state(esk1_0)
| $false ),
inference(rw,[status(thm)],[17,28,theory(equality)]) ).
cnf(33,plain,
is_state(esk1_0),
inference(cn,[status(thm)],[32,theory(equality)]) ).
cnf(34,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[27,33,theory(equality)]) ).
cnf(35,plain,
( esk2_0 != esk1_0
| $false ),
inference(rw,[status(thm)],[15,28,theory(equality)]) ).
cnf(36,plain,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[35,theory(equality)]) ).
cnf(37,plain,
( is_state(esk2_0)
| $false ),
inference(rw,[status(thm)],[16,28,theory(equality)]) ).
cnf(38,plain,
is_state(esk2_0),
inference(cn,[status(thm)],[37,theory(equality)]) ).
cnf(39,negated_conjecture,
esk3_0 = esk2_0,
inference(spm,[status(thm)],[27,38,theory(equality)]) ).
cnf(42,plain,
esk2_0 != esk3_0,
inference(rw,[status(thm)],[36,34,theory(equality)]) ).
cnf(44,negated_conjecture,
$false,
inference(sr,[status(thm)],[39,42,theory(equality)]) ).
cnf(45,negated_conjecture,
$false,
44,
[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/SWW/SWW469+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyyn8Yl/sel_SWW469+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/tmpyyn8Yl/sel_SWW469+1.p_1']
% -prover status Theorem
% Problem SWW469+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWW/SWW469+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWW/SWW469+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
%
%------------------------------------------------------------------------------