TSTP Solution File: SET575+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET575+3 : TPTP v5.0.0. Released v2.2.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 02:57:06 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 23 |; 17 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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-2 aty)
% Number of variables : 39 ( 0 sgn 25 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmp7IoYYa/sel_SET575+3.p_1',intersect_defn) ).
fof(3,conjecture,
! [X1,X2] :
( intersect(X1,X2)
=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmp7IoYYa/sel_SET575+3.p_1',prove_th15) ).
fof(4,negated_conjecture,
~ ! [X1,X2] :
( intersect(X1,X2)
=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(8,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)],[2]) ).
fof(9,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)],[8]) ).
fof(10,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)],[9]) ).
fof(11,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)],[10]) ).
fof(12,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)],[11]) ).
cnf(13,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(16,negated_conjecture,
? [X1,X2] :
( intersect(X1,X2)
& ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(17,negated_conjecture,
? [X4,X5] :
( intersect(X4,X5)
& ! [X6] :
( ~ member(X6,X4)
| ~ member(X6,X5) ) ),
inference(variable_rename,[status(thm)],[16]) ).
fof(18,negated_conjecture,
( intersect(esk2_0,esk3_0)
& ! [X6] :
( ~ member(X6,esk2_0)
| ~ member(X6,esk3_0) ) ),
inference(skolemize,[status(esa)],[17]) ).
fof(19,negated_conjecture,
! [X6] :
( ( ~ member(X6,esk2_0)
| ~ member(X6,esk3_0) )
& intersect(esk2_0,esk3_0) ),
inference(shift_quantors,[status(thm)],[18]) ).
cnf(20,negated_conjecture,
intersect(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(21,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(23,negated_conjecture,
member(esk1_2(esk2_0,esk3_0),esk3_0),
inference(spm,[status(thm)],[13,20,theory(equality)]) ).
cnf(24,negated_conjecture,
member(esk1_2(esk2_0,esk3_0),esk2_0),
inference(spm,[status(thm)],[14,20,theory(equality)]) ).
cnf(30,negated_conjecture,
~ member(esk1_2(esk2_0,esk3_0),esk3_0),
inference(spm,[status(thm)],[21,24,theory(equality)]) ).
cnf(32,negated_conjecture,
$false,
inference(rw,[status(thm)],[30,23,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
inference(cn,[status(thm)],[32,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
33,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET575+3.p
% --creating new selector for []
% -running prover on /tmp/tmp7IoYYa/sel_SET575+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET575+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET575+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET575+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
%
%------------------------------------------------------------------------------