TSTP Solution File: SET589+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET589+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 02:58:57 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 57 ( 24 ~; 19 |; 9 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 35 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
file('/tmp/tmpNGr6og/sel_SET589+3.p_1',difference_subset1) ).
fof(3,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(difference(X1,X4),difference(X2,X3)) ),
file('/tmp/tmpNGr6og/sel_SET589+3.p_1',prove_th48) ).
fof(5,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpNGr6og/sel_SET589+3.p_1',transitivity_of_subset) ).
fof(7,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X3,X2),difference(X3,X1)) ),
file('/tmp/tmpNGr6og/sel_SET589+3.p_1',difference_subset2) ).
fof(8,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(difference(X1,X4),difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(18,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| subset(difference(X1,X3),difference(X2,X3)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(19,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(difference(X4,X6),difference(X5,X6)) ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(20,plain,
( subset(difference(X1,X2),difference(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,negated_conjecture,
? [X1,X2,X3,X4] :
( subset(X1,X2)
& subset(X3,X4)
& ~ subset(difference(X1,X4),difference(X2,X3)) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(22,negated_conjecture,
? [X5,X6,X7,X8] :
( subset(X5,X6)
& subset(X7,X8)
& ~ subset(difference(X5,X8),difference(X6,X7)) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,negated_conjecture,
( subset(esk2_0,esk3_0)
& subset(esk4_0,esk5_0)
& ~ subset(difference(esk2_0,esk5_0),difference(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,negated_conjecture,
~ subset(difference(esk2_0,esk5_0),difference(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(26,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[23]) ).
fof(33,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(34,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[33]) ).
cnf(35,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(38,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| subset(difference(X3,X2),difference(X3,X1)) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(39,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(difference(X6,X5),difference(X6,X4)) ),
inference(variable_rename,[status(thm)],[38]) ).
cnf(40,plain,
( subset(difference(X1,X2),difference(X1,X3))
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(44,plain,
( subset(X1,difference(X2,X3))
| ~ subset(X1,difference(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[35,20,theory(equality)]) ).
cnf(66,plain,
( subset(difference(X1,X2),difference(X3,X4))
| ~ subset(X1,X3)
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[44,40,theory(equality)]) ).
cnf(90,negated_conjecture,
( ~ subset(esk2_0,esk3_0)
| ~ subset(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[24,66,theory(equality)]) ).
cnf(95,negated_conjecture,
( $false
| ~ subset(esk4_0,esk5_0) ),
inference(rw,[status(thm)],[90,26,theory(equality)]) ).
cnf(96,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[95,25,theory(equality)]) ).
cnf(97,negated_conjecture,
$false,
inference(cn,[status(thm)],[96,theory(equality)]) ).
cnf(98,negated_conjecture,
$false,
97,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET589+3.p
% --creating new selector for []
% -running prover on /tmp/tmpNGr6og/sel_SET589+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET589+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET589+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET589+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
%
%------------------------------------------------------------------------------