TSTP Solution File: SET014+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET014+3 : 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:37:17 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 104 ( 35 ~; 40 |; 24 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpmkfmU4/sel_SET014+3.p_1',subset_defn) ).
fof(2,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/tmp/tmpmkfmU4/sel_SET014+3.p_1',union_defn) ).
fof(5,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(union(X1,X3),X2) ),
file('/tmp/tmpmkfmU4/sel_SET014+3.p_1',prove_union_subset) ).
fof(7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(union(X1,X3),X2) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(8,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(9,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)],[8]) ).
fof(10,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)],[9]) ).
fof(11,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)],[10]) ).
fof(12,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)],[11]) ).
cnf(13,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(15,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(16,plain,
! [X1,X2,X3] :
( ( ~ member(X3,union(X1,X2))
| member(X3,X1)
| member(X3,X2) )
& ( ( ~ member(X3,X1)
& ~ member(X3,X2) )
| member(X3,union(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(17,plain,
! [X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ( ~ member(X6,X4)
& ~ member(X6,X5) )
| member(X6,union(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[16]) ).
fof(18,plain,
! [X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[17]) ).
cnf(21,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(33,negated_conjecture,
? [X1,X2,X3] :
( subset(X1,X2)
& subset(X3,X2)
& ~ subset(union(X1,X3),X2) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(34,negated_conjecture,
? [X4,X5,X6] :
( subset(X4,X5)
& subset(X6,X5)
& ~ subset(union(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[33]) ).
fof(35,negated_conjecture,
( subset(esk3_0,esk4_0)
& subset(esk5_0,esk4_0)
& ~ subset(union(esk3_0,esk5_0),esk4_0) ),
inference(skolemize,[status(esa)],[34]) ).
cnf(36,negated_conjecture,
~ subset(union(esk3_0,esk5_0),esk4_0),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(37,negated_conjecture,
subset(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(38,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(45,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[15,38,theory(equality)]) ).
cnf(46,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[15,37,theory(equality)]) ).
cnf(54,plain,
( member(esk1_2(union(X1,X2),X3),X2)
| member(esk1_2(union(X1,X2),X3),X1)
| subset(union(X1,X2),X3) ),
inference(spm,[status(thm)],[21,14,theory(equality)]) ).
cnf(175,negated_conjecture,
( member(esk1_2(union(esk3_0,X1),X2),esk4_0)
| member(esk1_2(union(esk3_0,X1),X2),X1)
| subset(union(esk3_0,X1),X2) ),
inference(spm,[status(thm)],[45,54,theory(equality)]) ).
cnf(1721,negated_conjecture,
( member(esk1_2(union(esk3_0,esk5_0),X1),esk4_0)
| subset(union(esk3_0,esk5_0),X1) ),
inference(spm,[status(thm)],[46,175,theory(equality)]) ).
cnf(1886,negated_conjecture,
subset(union(esk3_0,esk5_0),esk4_0),
inference(spm,[status(thm)],[13,1721,theory(equality)]) ).
cnf(1893,negated_conjecture,
$false,
inference(sr,[status(thm)],[1886,36,theory(equality)]) ).
cnf(1894,negated_conjecture,
$false,
1893,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET014+3.p
% --creating new selector for []
% -running prover on /tmp/tmpmkfmU4/sel_SET014+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET014+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET014+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET014+3.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
%
%------------------------------------------------------------------------------