TSTP Solution File: SET027+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET027+4 : TPTP v5.0.0. Released v2.2.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 @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 02:39:01 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 26 ~; 24 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmp6FiHf_/sel_SET027+4.p_1',subset) ).
fof(2,conjecture,
! [X1,X2,X4] :
( ( subset(X1,X2)
& subset(X2,X4) )
=> subset(X1,X4) ),
file('/tmp/tmp6FiHf_/sel_SET027+4.p_1',thI03) ).
fof(3,negated_conjecture,
~ ! [X1,X2,X4] :
( ( subset(X1,X2)
& subset(X2,X4) )
=> subset(X1,X4) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(4,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(5,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(10,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(11,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
fof(12,negated_conjecture,
? [X1,X2,X4] :
( subset(X1,X2)
& subset(X2,X4)
& ~ subset(X1,X4) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(13,negated_conjecture,
? [X5,X6,X7] :
( subset(X5,X6)
& subset(X6,X7)
& ~ subset(X5,X7) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( subset(esk2_0,esk3_0)
& subset(esk3_0,esk4_0)
& ~ subset(esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[13]) ).
cnf(15,negated_conjecture,
~ subset(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(19,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[11,17,theory(equality)]) ).
cnf(20,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[11,16,theory(equality)]) ).
cnf(22,negated_conjecture,
( member(esk1_2(esk2_0,X1),esk3_0)
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[19,10,theory(equality)]) ).
cnf(23,negated_conjecture,
( subset(X1,esk4_0)
| ~ member(esk1_2(X1,esk4_0),esk3_0) ),
inference(spm,[status(thm)],[9,20,theory(equality)]) ).
cnf(27,negated_conjecture,
subset(esk2_0,esk4_0),
inference(spm,[status(thm)],[23,22,theory(equality)]) ).
cnf(29,negated_conjecture,
$false,
inference(sr,[status(thm)],[27,15,theory(equality)]) ).
cnf(30,negated_conjecture,
$false,
29,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET027+4.p
% --creating new selector for [SET006+0.ax]
% -running prover on /tmp/tmp6FiHf_/sel_SET027+4.p_1 with time limit 29
% -prover status Theorem
% Problem SET027+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET027+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET027+4.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
%
%------------------------------------------------------------------------------