TSTP Solution File: SET625+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET625+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 03:05:00 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 127 ( 49 ~; 44 |; 29 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 41 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpSHm0n7/sel_SET625+3.p_1',subset_defn) ).
fof(3,conjecture,
! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
file('/tmp/tmpSHm0n7/sel_SET625+3.p_1',prove_th101) ).
fof(4,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmpSHm0n7/sel_SET625+3.p_1',intersect_defn) ).
fof(6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(10,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)],[2]) ).
fof(11,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)],[10]) ).
fof(12,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)],[11]) ).
fof(13,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)],[12]) ).
fof(14,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)],[13]) ).
cnf(17,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(18,negated_conjecture,
? [X1,X2,X3] :
( intersect(X1,X2)
& subset(X2,X3)
& ~ intersect(X1,X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(19,negated_conjecture,
? [X4,X5,X6] :
( intersect(X4,X5)
& subset(X5,X6)
& ~ intersect(X4,X6) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,negated_conjecture,
( intersect(esk2_0,esk3_0)
& subset(esk3_0,esk4_0)
& ~ intersect(esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[19]) ).
cnf(21,negated_conjecture,
~ intersect(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(23,negated_conjecture,
intersect(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
! [X1,X2] :
( ( ~ intersect(X1,X2)
| ? [X3] :
( member(X3,X1)
& member(X3,X2) ) )
& ( ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X2) )
| intersect(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(25,plain,
! [X4,X5] :
( ( ~ intersect(X4,X5)
| ? [X6] :
( member(X6,X4)
& member(X6,X5) ) )
& ( ! [X7] :
( ~ member(X7,X4)
| ~ member(X7,X5) )
| intersect(X4,X5) ) ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,plain,
! [X4,X5] :
( ( ~ intersect(X4,X5)
| ( member(esk5_2(X4,X5),X4)
& member(esk5_2(X4,X5),X5) ) )
& ( ! [X7] :
( ~ member(X7,X4)
| ~ member(X7,X5) )
| intersect(X4,X5) ) ),
inference(skolemize,[status(esa)],[25]) ).
fof(27,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( ~ intersect(X4,X5)
| ( member(esk5_2(X4,X5),X4)
& member(esk5_2(X4,X5),X5) ) ) ),
inference(shift_quantors,[status(thm)],[26]) ).
fof(28,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( member(esk5_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk5_2(X4,X5),X5)
| ~ intersect(X4,X5) ) ),
inference(distribute,[status(thm)],[27]) ).
cnf(29,plain,
( member(esk5_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( member(esk5_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(31,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(40,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[17,22,theory(equality)]) ).
cnf(44,negated_conjecture,
( intersect(X1,esk4_0)
| ~ member(X2,X1)
| ~ member(X2,esk3_0) ),
inference(spm,[status(thm)],[31,40,theory(equality)]) ).
cnf(49,negated_conjecture,
( intersect(X1,esk4_0)
| ~ member(esk5_2(X2,esk3_0),X1)
| ~ intersect(X2,esk3_0) ),
inference(spm,[status(thm)],[44,29,theory(equality)]) ).
cnf(106,negated_conjecture,
( intersect(X1,esk4_0)
| ~ intersect(X1,esk3_0) ),
inference(spm,[status(thm)],[49,30,theory(equality)]) ).
cnf(141,negated_conjecture,
~ intersect(esk2_0,esk3_0),
inference(spm,[status(thm)],[21,106,theory(equality)]) ).
cnf(145,negated_conjecture,
$false,
inference(rw,[status(thm)],[141,23,theory(equality)]) ).
cnf(146,negated_conjecture,
$false,
inference(cn,[status(thm)],[145,theory(equality)]) ).
cnf(147,negated_conjecture,
$false,
146,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET625+3.p
% --creating new selector for []
% -running prover on /tmp/tmpSHm0n7/sel_SET625+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET625+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET625+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET625+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
%
%------------------------------------------------------------------------------