TSTP Solution File: SET064+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET064+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : merrimac.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:33 EDT 2012
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 86 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 99 ( 43 ~; 32 |; 21 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : ~ member(X1,null_class),
file('/tmp/tmpGQ_p1F/sel_SET064+1.p_5',null_class_defn) ).
fof(7,axiom,
! [X1,X3] :
( equal(X1,X3)
<=> ( subclass(X1,X3)
& subclass(X3,X1) ) ),
file('/tmp/tmpGQ_p1F/sel_SET064+1.p_5',extensionality) ).
fof(20,axiom,
! [X1,X3] :
( subclass(X1,X3)
<=> ! [X4] :
( member(X4,X1)
=> member(X4,X3) ) ),
file('/tmp/tmpGQ_p1F/sel_SET064+1.p_5',subclass_defn) ).
fof(27,conjecture,
! [X2] :
( equal(X2,null_class)
| ? [X3] : member(X3,X2) ),
file('/tmp/tmpGQ_p1F/sel_SET064+1.p_5',null_class_is_unique) ).
fof(28,negated_conjecture,
~ ! [X2] :
( equal(X2,null_class)
| ? [X3] : member(X3,X2) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(29,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(30,plain,
! [X2] : ~ member(X2,null_class),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[30]) ).
fof(58,plain,
! [X1,X3] :
( ( ~ equal(X1,X3)
| ( subclass(X1,X3)
& subclass(X3,X1) ) )
& ( ~ subclass(X1,X3)
| ~ subclass(X3,X1)
| equal(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(59,plain,
! [X4,X5] :
( ( ~ equal(X4,X5)
| ( subclass(X4,X5)
& subclass(X5,X4) ) )
& ( ~ subclass(X4,X5)
| ~ subclass(X5,X4)
| equal(X4,X5) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X4,X5] :
( ( subclass(X4,X5)
| ~ equal(X4,X5) )
& ( subclass(X5,X4)
| ~ equal(X4,X5) )
& ( ~ subclass(X4,X5)
| ~ subclass(X5,X4)
| equal(X4,X5) ) ),
inference(distribute,[status(thm)],[59]) ).
cnf(61,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(109,plain,
! [X1,X3] :
( ( ~ subclass(X1,X3)
| ! [X4] :
( ~ member(X4,X1)
| member(X4,X3) ) )
& ( ? [X4] :
( member(X4,X1)
& ~ member(X4,X3) )
| subclass(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(110,plain,
! [X5,X6] :
( ( ~ subclass(X5,X6)
| ! [X7] :
( ~ member(X7,X5)
| member(X7,X6) ) )
& ( ? [X8] :
( member(X8,X5)
& ~ member(X8,X6) )
| subclass(X5,X6) ) ),
inference(variable_rename,[status(thm)],[109]) ).
fof(111,plain,
! [X5,X6] :
( ( ~ subclass(X5,X6)
| ! [X7] :
( ~ member(X7,X5)
| member(X7,X6) ) )
& ( ( member(esk4_2(X5,X6),X5)
& ~ member(esk4_2(X5,X6),X6) )
| subclass(X5,X6) ) ),
inference(skolemize,[status(esa)],[110]) ).
fof(112,plain,
! [X5,X6,X7] :
( ( ~ member(X7,X5)
| member(X7,X6)
| ~ subclass(X5,X6) )
& ( ( member(esk4_2(X5,X6),X5)
& ~ member(esk4_2(X5,X6),X6) )
| subclass(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[111]) ).
fof(113,plain,
! [X5,X6,X7] :
( ( ~ member(X7,X5)
| member(X7,X6)
| ~ subclass(X5,X6) )
& ( member(esk4_2(X5,X6),X5)
| subclass(X5,X6) )
& ( ~ member(esk4_2(X5,X6),X6)
| subclass(X5,X6) ) ),
inference(distribute,[status(thm)],[112]) ).
cnf(115,plain,
( subclass(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(139,negated_conjecture,
? [X2] :
( ~ equal(X2,null_class)
& ! [X3] : ~ member(X3,X2) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(140,negated_conjecture,
? [X4] :
( ~ equal(X4,null_class)
& ! [X5] : ~ member(X5,X4) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,negated_conjecture,
( ~ equal(esk5_0,null_class)
& ! [X5] : ~ member(X5,esk5_0) ),
inference(skolemize,[status(esa)],[140]) ).
fof(142,negated_conjecture,
! [X5] :
( ~ member(X5,esk5_0)
& ~ equal(esk5_0,null_class) ),
inference(shift_quantors,[status(thm)],[141]) ).
cnf(143,negated_conjecture,
esk5_0 != null_class,
inference(split_conjunct,[status(thm)],[142]) ).
cnf(144,negated_conjecture,
~ member(X1,esk5_0),
inference(split_conjunct,[status(thm)],[142]) ).
cnf(186,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[31,115,theory(equality)]) ).
cnf(187,negated_conjecture,
subclass(esk5_0,X1),
inference(spm,[status(thm)],[144,115,theory(equality)]) ).
cnf(263,plain,
( X1 = null_class
| ~ subclass(X1,null_class) ),
inference(spm,[status(thm)],[61,186,theory(equality)]) ).
cnf(294,negated_conjecture,
esk5_0 = null_class,
inference(spm,[status(thm)],[263,187,theory(equality)]) ).
cnf(297,negated_conjecture,
$false,
inference(sr,[status(thm)],[294,143,theory(equality)]) ).
cnf(298,negated_conjecture,
$false,
297,
[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/SET064+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpGQ_p1F/sel_SET064+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/tmpGQ_p1F/sel_SET064+1.p_1']
% -prover status CounterSatisfiable
% -running prover on /tmp/tmpGQ_p1F/sel_SET064+1.p_2 with time limit 89
% -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=89', '/tmp/tmpGQ_p1F/sel_SET064+1.p_2']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpGQ_p1F/sel_SET064+1.p_3 with time limit 119
% -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=119', '/tmp/tmpGQ_p1F/sel_SET064+1.p_3']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpGQ_p1F/sel_SET064+1.p_4 with time limit 149
% -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=149', '/tmp/tmpGQ_p1F/sel_SET064+1.p_4']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpGQ_p1F/sel_SET064+1.p_5 with time limit 299
% -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=299', '/tmp/tmpGQ_p1F/sel_SET064+1.p_5']
% -prover status Theorem
% Problem SET064+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET064+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET064+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
%
%------------------------------------------------------------------------------