TSTP Solution File: SET067+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET067+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : newtonia.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:48 EDT 2012
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 111 ( 8 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 119 ( 46 ~; 50 |; 20 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 5 sgn 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpsYo8Zt/sel_SET067+1.p_1',subclass_defn) ).
fof(5,axiom,
! [X1] : subclass(X1,universal_class),
file('/tmp/tmpsYo8Zt/sel_SET067+1.p_1',class_elements_are_sets) ).
fof(7,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( equal(X3,X1)
| equal(X3,X2) ) ) ),
file('/tmp/tmpsYo8Zt/sel_SET067+1.p_1',unordered_pair_defn) ).
fof(9,conjecture,
! [X1,X2] : subclass(unordered_pair(X1,X1),unordered_pair(X1,X2)),
file('/tmp/tmpsYo8Zt/sel_SET067+1.p_1',pair_contains_other) ).
fof(10,negated_conjecture,
~ ! [X1,X2] : subclass(unordered_pair(X1,X1),unordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[9]) ).
fof(17,plain,
! [X1,X2] :
( ( ~ subclass(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subclass(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(18,plain,
! [X4,X5] :
( ( ~ subclass(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subclass(X4,X5) ) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(19,plain,
! [X4,X5] :
( ( ~ subclass(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subclass(X4,X5) ) ),
inference(skolemize,[status(esa)],[18]) ).
fof(20,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subclass(X4,X5) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subclass(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[19]) ).
fof(21,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subclass(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| subclass(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subclass(X4,X5) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(22,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(33,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[5]) ).
cnf(34,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[33]) ).
fof(37,plain,
! [X3,X1,X2] :
( ( ~ member(X3,unordered_pair(X1,X2))
| ( member(X3,universal_class)
& ( equal(X3,X1)
| equal(X3,X2) ) ) )
& ( ~ member(X3,universal_class)
| ( ~ equal(X3,X1)
& ~ equal(X3,X2) )
| member(X3,unordered_pair(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(38,plain,
! [X4,X5,X6] :
( ( ~ member(X4,unordered_pair(X5,X6))
| ( member(X4,universal_class)
& ( equal(X4,X5)
| equal(X4,X6) ) ) )
& ( ~ member(X4,universal_class)
| ( ~ equal(X4,X5)
& ~ equal(X4,X6) )
| member(X4,unordered_pair(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( equal(X4,X5)
| equal(X4,X6)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( ~ equal(X4,X5)
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( ~ equal(X4,X6)
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[38]) ).
cnf(41,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(42,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(46,negated_conjecture,
? [X1,X2] : ~ subclass(unordered_pair(X1,X1),unordered_pair(X1,X2)),
inference(fof_nnf,[status(thm)],[10]) ).
fof(47,negated_conjecture,
? [X3,X4] : ~ subclass(unordered_pair(X3,X3),unordered_pair(X3,X4)),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,negated_conjecture,
~ subclass(unordered_pair(esk2_0,esk2_0),unordered_pair(esk2_0,esk3_0)),
inference(skolemize,[status(esa)],[47]) ).
cnf(49,negated_conjecture,
~ subclass(unordered_pair(esk2_0,esk2_0),unordered_pair(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(58,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[24,34,theory(equality)]) ).
cnf(60,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X1
| esk1_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[42,23,theory(equality)]) ).
cnf(62,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[41,theory(equality)]) ).
cnf(69,plain,
( member(esk1_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[58,23,theory(equality)]) ).
cnf(78,plain,
( esk1_2(unordered_pair(X4,X5),X6) = X4
| subclass(unordered_pair(X4,X5),X6)
| X5 != X4 ),
inference(ef,[status(thm)],[60,theory(equality)]) ).
cnf(86,plain,
( esk1_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[78,theory(equality)]) ).
cnf(93,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[22,86,theory(equality)]) ).
cnf(94,plain,
( member(X1,universal_class)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[69,86,theory(equality)]) ).
cnf(95,negated_conjecture,
member(esk2_0,universal_class),
inference(spm,[status(thm)],[49,94,theory(equality)]) ).
cnf(100,negated_conjecture,
~ member(esk2_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[49,93,theory(equality)]) ).
cnf(103,negated_conjecture,
~ member(esk2_0,universal_class),
inference(spm,[status(thm)],[100,62,theory(equality)]) ).
cnf(104,negated_conjecture,
$false,
inference(rw,[status(thm)],[103,95,theory(equality)]) ).
cnf(105,negated_conjecture,
$false,
inference(cn,[status(thm)],[104,theory(equality)]) ).
cnf(106,negated_conjecture,
$false,
105,
[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/SET067+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpsYo8Zt/sel_SET067+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/tmpsYo8Zt/sel_SET067+1.p_1']
% -prover status Theorem
% Problem SET067+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET067+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET067+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
%
%------------------------------------------------------------------------------