TSTP Solution File: SET631+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET631+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:46 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 111 ( 45 ~; 38 |; 22 &)
% ( 3 <=>; 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 : 74 ( 2 sgn 44 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('/tmp/tmpkiDDtl/sel_SET631+3.p_1',symmetry_of_intersect) ).
fof(2,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/tmp/tmpkiDDtl/sel_SET631+3.p_1',difference_defn) ).
fof(3,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmpkiDDtl/sel_SET631+3.p_1',intersect_defn) ).
fof(4,conjecture,
! [X1,X2,X3] :
( intersect(X1,difference(X2,X3))
=> intersect(X1,X2) ),
file('/tmp/tmpkiDDtl/sel_SET631+3.p_1',prove_th113) ).
fof(5,negated_conjecture,
~ ! [X1,X2,X3] :
( intersect(X1,difference(X2,X3))
=> intersect(X1,X2) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(7,plain,
! [X1,X2] :
( ~ intersect(X1,X2)
| intersect(X2,X1) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(8,plain,
! [X3,X4] :
( ~ intersect(X3,X4)
| intersect(X4,X3) ),
inference(variable_rename,[status(thm)],[7]) ).
cnf(9,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
fof(10,plain,
! [X1,X2,X3] :
( ( ~ member(X3,difference(X1,X2))
| ( member(X3,X1)
& ~ member(X3,X2) ) )
& ( ~ member(X3,X1)
| member(X3,X2)
| member(X3,difference(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(11,plain,
! [X4,X5,X6] :
( ( ~ member(X6,difference(X4,X5))
| ( member(X6,X4)
& ~ member(X6,X5) ) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[status(thm)],[11]) ).
cnf(15,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(16,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)],[3]) ).
fof(17,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)],[16]) ).
fof(18,plain,
! [X4,X5] :
( ( ~ intersect(X4,X5)
| ( member(esk1_2(X4,X5),X4)
& member(esk1_2(X4,X5),X5) ) )
& ( ! [X7] :
( ~ member(X7,X4)
| ~ member(X7,X5) )
| intersect(X4,X5) ) ),
inference(skolemize,[status(esa)],[17]) ).
fof(19,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( ~ intersect(X4,X5)
| ( member(esk1_2(X4,X5),X4)
& member(esk1_2(X4,X5),X5) ) ) ),
inference(shift_quantors,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk1_2(X4,X5),X5)
| ~ intersect(X4,X5) ) ),
inference(distribute,[status(thm)],[19]) ).
cnf(21,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(23,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,negated_conjecture,
? [X1,X2,X3] :
( intersect(X1,difference(X2,X3))
& ~ intersect(X1,X2) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(25,negated_conjecture,
? [X4,X5,X6] :
( intersect(X4,difference(X5,X6))
& ~ intersect(X4,X5) ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,negated_conjecture,
( intersect(esk2_0,difference(esk3_0,esk4_0))
& ~ intersect(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[25]) ).
cnf(27,negated_conjecture,
~ intersect(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(28,negated_conjecture,
intersect(esk2_0,difference(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(29,negated_conjecture,
intersect(difference(esk3_0,esk4_0),esk2_0),
inference(spm,[status(thm)],[9,28,theory(equality)]) ).
cnf(31,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| ~ intersect(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[15,22,theory(equality)]) ).
cnf(32,plain,
( intersect(X1,X2)
| ~ member(esk1_2(X3,X2),X1)
| ~ intersect(X3,X2) ),
inference(spm,[status(thm)],[23,21,theory(equality)]) ).
cnf(79,plain,
( intersect(X1,X2)
| ~ intersect(difference(X1,X3),X2) ),
inference(spm,[status(thm)],[32,31,theory(equality)]) ).
cnf(91,negated_conjecture,
intersect(esk3_0,esk2_0),
inference(spm,[status(thm)],[79,29,theory(equality)]) ).
cnf(96,negated_conjecture,
intersect(esk2_0,esk3_0),
inference(spm,[status(thm)],[9,91,theory(equality)]) ).
cnf(98,negated_conjecture,
$false,
inference(sr,[status(thm)],[96,27,theory(equality)]) ).
cnf(99,negated_conjecture,
$false,
98,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET631+3.p
% --creating new selector for []
% -running prover on /tmp/tmpkiDDtl/sel_SET631+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET631+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET631+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET631+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
%
%------------------------------------------------------------------------------