TSTP Solution File: SEU158+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU158+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 04:55:36 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 18 ~; 15 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmpP_zFF7/sel_SEU158+1.p_1',t37_zfmisc_1) ).
fof(3,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmpP_zFF7/sel_SEU158+1.p_1',l2_zfmisc_1) ).
fof(6,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(8,negated_conjecture,
? [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| ~ in(X1,X2) )
& ( subset(singleton(X1),X2)
| in(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(9,negated_conjecture,
? [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| ~ in(X3,X4) )
& ( subset(singleton(X3),X4)
| in(X3,X4) ) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(10,negated_conjecture,
( ( ~ subset(singleton(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) )
& ( subset(singleton(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[9]) ).
cnf(11,negated_conjecture,
( in(esk1_0,esk2_0)
| subset(singleton(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,negated_conjecture,
( ~ in(esk1_0,esk2_0)
| ~ subset(singleton(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(16,plain,
! [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| in(X1,X2) )
& ( ~ in(X1,X2)
| subset(singleton(X1),X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(17,plain,
! [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(18,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(26,negated_conjecture,
in(esk1_0,esk2_0),
inference(spm,[status(thm)],[19,11,theory(equality)]) ).
cnf(29,negated_conjecture,
( $false
| ~ subset(singleton(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[12,26,theory(equality)]) ).
cnf(30,negated_conjecture,
~ subset(singleton(esk1_0),esk2_0),
inference(cn,[status(thm)],[29,theory(equality)]) ).
cnf(32,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(spm,[status(thm)],[30,18,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
inference(rw,[status(thm)],[32,26,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,negated_conjecture,
$false,
34,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU158+1.p
% --creating new selector for []
% -running prover on /tmp/tmpP_zFF7/sel_SEU158+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU158+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU158+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU158+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
%
%------------------------------------------------------------------------------