TSTP Solution File: SET767+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET767+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 03:39:46 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 87 ( 32 ~; 30 |; 20 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 63 ( 4 sgn 40 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpbrKVqd/sel_SET767+4.p_1',subset) ).
fof(3,axiom,
! [X4,X7,X1,X3] :
( member(X3,equivalence_class(X1,X7,X4))
<=> ( member(X3,X7)
& apply(X4,X1,X3) ) ),
file('/tmp/tmpbrKVqd/sel_SET767+4.p_1',equivalence_class) ).
fof(4,conjecture,
! [X7,X4,X1] :
( equivalence(X4,X7)
=> subset(equivalence_class(X1,X7,X4),X7) ),
file('/tmp/tmpbrKVqd/sel_SET767+4.p_1',thIII03) ).
fof(5,negated_conjecture,
~ ! [X7,X4,X1] :
( equivalence(X4,X7)
=> subset(equivalence_class(X1,X7,X4),X7) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(8,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)],[1]) ).
fof(9,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)],[8]) ).
fof(10,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)],[9]) ).
fof(11,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)],[10]) ).
fof(12,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)],[11]) ).
cnf(13,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(20,plain,
! [X4,X7,X1,X3] :
( ( ~ member(X3,equivalence_class(X1,X7,X4))
| ( member(X3,X7)
& apply(X4,X1,X3) ) )
& ( ~ member(X3,X7)
| ~ apply(X4,X1,X3)
| member(X3,equivalence_class(X1,X7,X4)) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(21,plain,
! [X8,X9,X10,X11] :
( ( ~ member(X11,equivalence_class(X10,X9,X8))
| ( member(X11,X9)
& apply(X8,X10,X11) ) )
& ( ~ member(X11,X9)
| ~ apply(X8,X10,X11)
| member(X11,equivalence_class(X10,X9,X8)) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X8,X9,X10,X11] :
( ( member(X11,X9)
| ~ member(X11,equivalence_class(X10,X9,X8)) )
& ( apply(X8,X10,X11)
| ~ member(X11,equivalence_class(X10,X9,X8)) )
& ( ~ member(X11,X9)
| ~ apply(X8,X10,X11)
| member(X11,equivalence_class(X10,X9,X8)) ) ),
inference(distribute,[status(thm)],[21]) ).
cnf(25,plain,
( member(X1,X3)
| ~ member(X1,equivalence_class(X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[22]) ).
fof(26,negated_conjecture,
? [X7,X4,X1] :
( equivalence(X4,X7)
& ~ subset(equivalence_class(X1,X7,X4),X7) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(27,negated_conjecture,
? [X8,X9,X10] :
( equivalence(X9,X8)
& ~ subset(equivalence_class(X10,X8,X9),X8) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( equivalence(esk3_0,esk2_0)
& ~ subset(equivalence_class(esk4_0,esk2_0,esk3_0),esk2_0) ),
inference(skolemize,[status(esa)],[27]) ).
cnf(29,negated_conjecture,
~ subset(equivalence_class(esk4_0,esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(90,plain,
( member(esk1_2(equivalence_class(X1,X2,X3),X4),X2)
| subset(equivalence_class(X1,X2,X3),X4) ),
inference(spm,[status(thm)],[25,14,theory(equality)]) ).
cnf(161,plain,
subset(equivalence_class(X1,X2,X3),X2),
inference(spm,[status(thm)],[13,90,theory(equality)]) ).
cnf(165,negated_conjecture,
$false,
inference(rw,[status(thm)],[29,161,theory(equality)]) ).
cnf(166,negated_conjecture,
$false,
inference(cn,[status(thm)],[165,theory(equality)]) ).
cnf(167,negated_conjecture,
$false,
166,
[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/SET767+4.p
% --creating new selector for [SET006+0.ax, SET006+2.ax]
% -running prover on /tmp/tmpbrKVqd/sel_SET767+4.p_1 with time limit 29
% -prover status Theorem
% Problem SET767+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET767+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET767+4.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
%
%------------------------------------------------------------------------------