TSTP Solution File: SET108+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET108+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:07:20 EDT 2012
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 91 ( 16 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 121 ( 54 ~; 41 |; 24 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 4 sgn 12 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,conjecture,
! [X3] :
? [X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class)
& equal(X3,ordered_pair(X1,X2)) )
| ( ~ ? [X4,X5] :
( member(X4,universal_class)
& member(X5,universal_class)
& equal(X3,ordered_pair(X4,X5)) )
& equal(X1,X3)
& equal(X2,X3) ) ),
file('/tmp/tmpRU7xFi/sel_SET108+1.p_1',existence_of_first_and_second) ).
fof(3,negated_conjecture,
~ ! [X3] :
? [X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class)
& equal(X3,ordered_pair(X1,X2)) )
| ( ~ ? [X4,X5] :
( member(X4,universal_class)
& member(X5,universal_class)
& equal(X3,ordered_pair(X4,X5)) )
& equal(X1,X3)
& equal(X2,X3) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(10,negated_conjecture,
? [X3] :
! [X1,X2] :
( ( ~ member(X1,universal_class)
| ~ member(X2,universal_class)
| ~ equal(X3,ordered_pair(X1,X2)) )
& ( ? [X4,X5] :
( member(X4,universal_class)
& member(X5,universal_class)
& equal(X3,ordered_pair(X4,X5)) )
| ~ equal(X1,X3)
| ~ equal(X2,X3) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(11,negated_conjecture,
? [X6] :
! [X7,X8] :
( ( ~ member(X7,universal_class)
| ~ member(X8,universal_class)
| ~ equal(X6,ordered_pair(X7,X8)) )
& ( ? [X9,X10] :
( member(X9,universal_class)
& member(X10,universal_class)
& equal(X6,ordered_pair(X9,X10)) )
| ~ equal(X7,X6)
| ~ equal(X8,X6) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,negated_conjecture,
! [X7,X8] :
( ( ~ member(X7,universal_class)
| ~ member(X8,universal_class)
| ~ equal(esk1_0,ordered_pair(X7,X8)) )
& ( ( member(esk2_2(X7,X8),universal_class)
& member(esk3_2(X7,X8),universal_class)
& equal(esk1_0,ordered_pair(esk2_2(X7,X8),esk3_2(X7,X8))) )
| ~ equal(X7,esk1_0)
| ~ equal(X8,esk1_0) ) ),
inference(skolemize,[status(esa)],[11]) ).
fof(13,negated_conjecture,
! [X7,X8] :
( ( ~ member(X7,universal_class)
| ~ member(X8,universal_class)
| ~ equal(esk1_0,ordered_pair(X7,X8)) )
& ( member(esk2_2(X7,X8),universal_class)
| ~ equal(X7,esk1_0)
| ~ equal(X8,esk1_0) )
& ( member(esk3_2(X7,X8),universal_class)
| ~ equal(X7,esk1_0)
| ~ equal(X8,esk1_0) )
& ( equal(esk1_0,ordered_pair(esk2_2(X7,X8),esk3_2(X7,X8)))
| ~ equal(X7,esk1_0)
| ~ equal(X8,esk1_0) ) ),
inference(distribute,[status(thm)],[12]) ).
cnf(14,negated_conjecture,
( esk1_0 = ordered_pair(esk2_2(X2,X1),esk3_2(X2,X1))
| X1 != esk1_0
| X2 != esk1_0 ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(15,negated_conjecture,
( member(esk3_2(X2,X1),universal_class)
| X1 != esk1_0
| X2 != esk1_0 ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(16,negated_conjecture,
( member(esk2_2(X2,X1),universal_class)
| X1 != esk1_0
| X2 != esk1_0 ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(17,negated_conjecture,
( esk1_0 != ordered_pair(X1,X2)
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(18,negated_conjecture,
( ~ member(esk3_2(X1,X2),universal_class)
| ~ member(esk2_2(X1,X2),universal_class)
| esk1_0 != X1
| esk1_0 != X2 ),
inference(spm,[status(thm)],[17,14,theory(equality)]) ).
cnf(24,negated_conjecture,
( esk1_0 != X1
| esk1_0 != X2
| ~ member(esk3_2(X1,X2),universal_class) ),
inference(csr,[status(thm)],[18,16]) ).
cnf(25,negated_conjecture,
( esk1_0 != X1
| esk1_0 != X2 ),
inference(csr,[status(thm)],[24,15]) ).
fof(26,plain,
( ~ epred1_0
<=> ! [X1] : ~ equal(esk1_0,X1) ),
introduced(definition),
[split] ).
cnf(27,plain,
( epred1_0
| esk1_0 != X1 ),
inference(split_equiv,[status(thm)],[26]) ).
fof(28,plain,
( ~ epred2_0
<=> ! [X2] : ~ equal(esk1_0,X2) ),
introduced(definition),
[split] ).
cnf(29,plain,
( epred2_0
| esk1_0 != X2 ),
inference(split_equiv,[status(thm)],[28]) ).
cnf(30,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[25,26,theory(equality)]),28,theory(equality)]),
[split] ).
cnf(31,negated_conjecture,
epred1_0,
inference(er,[status(thm)],[27,theory(equality)]) ).
cnf(33,negated_conjecture,
epred2_0,
inference(er,[status(thm)],[29,theory(equality)]) ).
cnf(37,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[30,33,theory(equality)]) ).
cnf(38,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[37,31,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
inference(cn,[status(thm)],[38,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
39,
[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/SET108+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpRU7xFi/sel_SET108+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/tmpRU7xFi/sel_SET108+1.p_1']
% -prover status Theorem
% Problem SET108+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET108+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET108+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
%
%------------------------------------------------------------------------------