TSTP Solution File: SET102+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET102+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : yorktown.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:06:57 EDT 2012
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 22 unt; 0 def)
% Number of atoms : 58 ( 4 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 19 |; 10 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 4 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( member(X1,unordered_pair(X2,X3))
<=> ( member(X1,universal_class)
& ( equal(X1,X2)
| equal(X1,X3) ) ) ),
file('/tmp/tmpBVTfpH/sel_SET102+1.p_1',unordered_pair_defn) ).
fof(2,axiom,
! [X2,X3] : member(unordered_pair(X2,X3),universal_class),
file('/tmp/tmpBVTfpH/sel_SET102+1.p_1',unordered_pair) ).
fof(3,axiom,
! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
file('/tmp/tmpBVTfpH/sel_SET102+1.p_1',singleton_set_defn) ).
fof(5,axiom,
! [X2,X3] : equal(ordered_pair(X2,X3),unordered_pair(singleton(X2),unordered_pair(X2,singleton(X3)))),
file('/tmp/tmpBVTfpH/sel_SET102+1.p_1',ordered_pair_defn) ).
fof(6,conjecture,
! [X2,X3] : member(unordered_pair(X2,singleton(X3)),ordered_pair(X2,X3)),
file('/tmp/tmpBVTfpH/sel_SET102+1.p_1',unordered_pair_member_of_ordered_pair) ).
fof(7,negated_conjecture,
~ ! [X2,X3] : member(unordered_pair(X2,singleton(X3)),ordered_pair(X2,X3)),
inference(assume_negation,[status(cth)],[6]) ).
fof(8,plain,
! [X1,X2,X3] :
( ( ~ member(X1,unordered_pair(X2,X3))
| ( member(X1,universal_class)
& ( equal(X1,X2)
| equal(X1,X3) ) ) )
& ( ~ member(X1,universal_class)
| ( ~ equal(X1,X2)
& ~ equal(X1,X3) )
| member(X1,unordered_pair(X2,X3)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(9,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)],[8]) ).
fof(10,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)],[9]) ).
cnf(11,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(15,plain,
! [X4,X5] : member(unordered_pair(X4,X5),universal_class),
inference(variable_rename,[status(thm)],[2]) ).
cnf(16,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[15]) ).
fof(17,plain,
! [X3] : equal(singleton(X3),unordered_pair(X3,X3)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(18,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[17]) ).
fof(25,plain,
! [X4,X5] : equal(ordered_pair(X4,X5),unordered_pair(singleton(X4),unordered_pair(X4,singleton(X5)))),
inference(variable_rename,[status(thm)],[5]) ).
cnf(26,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,negated_conjecture,
? [X2,X3] : ~ member(unordered_pair(X2,singleton(X3)),ordered_pair(X2,X3)),
inference(fof_nnf,[status(thm)],[7]) ).
fof(28,negated_conjecture,
? [X4,X5] : ~ member(unordered_pair(X4,singleton(X5)),ordered_pair(X4,X5)),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,negated_conjecture,
~ member(unordered_pair(esk1_0,singleton(esk2_0)),ordered_pair(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[28]) ).
cnf(30,negated_conjecture,
~ member(unordered_pair(esk1_0,singleton(esk2_0)),ordered_pair(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[26,18,theory(equality)]),18,theory(equality)]),
[unfolding] ).
cnf(32,negated_conjecture,
~ member(unordered_pair(esk1_0,unordered_pair(esk2_0,esk2_0)),ordered_pair(esk1_0,esk2_0)),
inference(rw,[status(thm)],[30,18,theory(equality)]),
[unfolding] ).
cnf(36,negated_conjecture,
~ member(unordered_pair(esk1_0,unordered_pair(esk2_0,esk2_0)),unordered_pair(unordered_pair(esk1_0,esk1_0),unordered_pair(esk1_0,unordered_pair(esk2_0,esk2_0)))),
inference(rw,[status(thm)],[32,31,theory(equality)]),
[unfolding] ).
cnf(37,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[11,theory(equality)]) ).
cnf(41,negated_conjecture,
~ member(unordered_pair(esk1_0,unordered_pair(esk2_0,esk2_0)),universal_class),
inference(spm,[status(thm)],[36,37,theory(equality)]) ).
cnf(43,negated_conjecture,
$false,
inference(rw,[status(thm)],[41,16,theory(equality)]) ).
cnf(44,negated_conjecture,
$false,
inference(cn,[status(thm)],[43,theory(equality)]) ).
cnf(45,negated_conjecture,
$false,
44,
[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/SET102+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpBVTfpH/sel_SET102+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/tmpBVTfpH/sel_SET102+1.p_1']
% -prover status Theorem
% Problem SET102+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET102+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET102+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
%
%------------------------------------------------------------------------------