TSTP Solution File: SET588+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET588+3 : 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:03:16 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 114 ( 44 ~; 43 |; 21 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 82 ( 4 sgn 39 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/tmp/tmpxGmVlK/sel_SET588+3.p_1',difference_defn) ).
fof(2,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpxGmVlK/sel_SET588+3.p_1',subset_defn) ).
fof(4,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
file('/tmp/tmpxGmVlK/sel_SET588+3.p_1',prove_difference_subset1) ).
fof(5,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
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)],[1,theory(equality)]) ).
fof(7,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(8,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)],[7]) ).
fof(9,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)],[8]) ).
cnf(10,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(11,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(12,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(13,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)],[2]) ).
fof(14,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)],[13]) ).
fof(15,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)],[14]) ).
fof(16,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)],[15]) ).
fof(17,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)],[16]) ).
cnf(18,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(20,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(23,negated_conjecture,
? [X1,X2,X3] :
( subset(X1,X2)
& ~ subset(difference(X1,X3),difference(X2,X3)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(24,negated_conjecture,
? [X4,X5,X6] :
( subset(X4,X5)
& ~ subset(difference(X4,X6),difference(X5,X6)) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,negated_conjecture,
( subset(esk2_0,esk3_0)
& ~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[24]) ).
cnf(26,negated_conjecture,
~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(30,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[12,19,theory(equality)]) ).
cnf(31,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[20,27,theory(equality)]) ).
cnf(33,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk1_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[11,19,theory(equality)]) ).
cnf(34,plain,
( subset(X1,difference(X2,X3))
| member(esk1_2(X1,difference(X2,X3)),X3)
| ~ member(esk1_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[18,10,theory(equality)]) ).
cnf(41,negated_conjecture,
( subset(X1,esk3_0)
| ~ member(esk1_2(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[18,31,theory(equality)]) ).
cnf(55,negated_conjecture,
subset(difference(esk2_0,X1),esk3_0),
inference(spm,[status(thm)],[41,30,theory(equality)]) ).
cnf(76,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,difference(esk2_0,X2)) ),
inference(spm,[status(thm)],[20,55,theory(equality)]) ).
cnf(78,negated_conjecture,
( member(esk1_2(difference(esk2_0,X1),X2),esk3_0)
| subset(difference(esk2_0,X1),X2) ),
inference(spm,[status(thm)],[76,19,theory(equality)]) ).
cnf(115,negated_conjecture,
( subset(difference(esk2_0,X1),difference(esk3_0,X2))
| member(esk1_2(difference(esk2_0,X1),difference(esk3_0,X2)),X2) ),
inference(spm,[status(thm)],[34,78,theory(equality)]) ).
cnf(200,negated_conjecture,
subset(difference(esk2_0,X1),difference(esk3_0,X1)),
inference(spm,[status(thm)],[33,115,theory(equality)]) ).
cnf(218,negated_conjecture,
$false,
inference(rw,[status(thm)],[26,200,theory(equality)]) ).
cnf(219,negated_conjecture,
$false,
inference(cn,[status(thm)],[218,theory(equality)]) ).
cnf(220,negated_conjecture,
$false,
219,
[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/SET588+3.p
% --creating new selector for []
% -running prover on /tmp/tmpxGmVlK/sel_SET588+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET588+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET588+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET588+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
%
%------------------------------------------------------------------------------