TSTP Solution File: SET060+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET060+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : monitor.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 08:04:18 EDT 2012
% Result : Theorem 0.05s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 73 ( 32 ~; 23 |; 15 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 2 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X4] :
( member(X4,complement(X1))
<=> ( member(X4,universal_class)
& ~ member(X4,X1) ) ),
file('/tmp/tmprANTLU/sel_SET060+1.p_1',complement) ).
fof(11,axiom,
! [X1,X2,X4] :
( member(X4,intersection(X1,X2))
<=> ( member(X4,X1)
& member(X4,X2) ) ),
file('/tmp/tmprANTLU/sel_SET060+1.p_1',intersection) ).
fof(13,conjecture,
! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
file('/tmp/tmprANTLU/sel_SET060+1.p_1',special_classes_lemma) ).
fof(14,negated_conjecture,
~ ! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
inference(assume_negation,[status(cth)],[13]) ).
fof(15,plain,
! [X1,X4] :
( member(X4,complement(X1))
<=> ( member(X4,universal_class)
& ~ member(X4,X1) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(17,negated_conjecture,
~ ! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(32,plain,
! [X1,X4] :
( ( ~ member(X4,complement(X1))
| ( member(X4,universal_class)
& ~ member(X4,X1) ) )
& ( ~ member(X4,universal_class)
| member(X4,X1)
| member(X4,complement(X1)) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(33,plain,
! [X5,X6] :
( ( ~ member(X6,complement(X5))
| ( member(X6,universal_class)
& ~ member(X6,X5) ) )
& ( ~ member(X6,universal_class)
| member(X6,X5)
| member(X6,complement(X5)) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,plain,
! [X5,X6] :
( ( member(X6,universal_class)
| ~ member(X6,complement(X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,complement(X5)) )
& ( ~ member(X6,universal_class)
| member(X6,X5)
| member(X6,complement(X5)) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(36,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(64,plain,
! [X1,X2,X4] :
( ( ~ member(X4,intersection(X1,X2))
| ( member(X4,X1)
& member(X4,X2) ) )
& ( ~ member(X4,X1)
| ~ member(X4,X2)
| member(X4,intersection(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(65,plain,
! [X5,X6,X7] :
( ( ~ member(X7,intersection(X5,X6))
| ( member(X7,X5)
& member(X7,X6) ) )
& ( ~ member(X7,X5)
| ~ member(X7,X6)
| member(X7,intersection(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[64]) ).
fof(66,plain,
! [X5,X6,X7] :
( ( member(X7,X5)
| ~ member(X7,intersection(X5,X6)) )
& ( member(X7,X6)
| ~ member(X7,intersection(X5,X6)) )
& ( ~ member(X7,X5)
| ~ member(X7,X6)
| member(X7,intersection(X5,X6)) ) ),
inference(distribute,[status(thm)],[65]) ).
cnf(68,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(69,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(72,negated_conjecture,
? [X1,X2] : member(X2,intersection(complement(X1),X1)),
inference(fof_nnf,[status(thm)],[17]) ).
fof(73,negated_conjecture,
? [X3,X4] : member(X4,intersection(complement(X3),X3)),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,negated_conjecture,
member(esk3_0,intersection(complement(esk2_0),esk2_0)),
inference(skolemize,[status(esa)],[73]) ).
cnf(75,negated_conjecture,
member(esk3_0,intersection(complement(esk2_0),esk2_0)),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(78,negated_conjecture,
member(esk3_0,esk2_0),
inference(spm,[status(thm)],[68,75,theory(equality)]) ).
cnf(79,negated_conjecture,
member(esk3_0,complement(esk2_0)),
inference(spm,[status(thm)],[69,75,theory(equality)]) ).
cnf(107,negated_conjecture,
~ member(esk3_0,esk2_0),
inference(spm,[status(thm)],[36,79,theory(equality)]) ).
cnf(109,negated_conjecture,
$false,
inference(rw,[status(thm)],[107,78,theory(equality)]) ).
cnf(110,negated_conjecture,
$false,
inference(cn,[status(thm)],[109,theory(equality)]) ).
cnf(111,negated_conjecture,
$false,
110,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET060+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmprANTLU/sel_SET060+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmprANTLU/sel_SET060+1.p_1']
% -prover status Theorem
% Problem SET060+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET060+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET060+1.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
%
%------------------------------------------------------------------------------