TSTP Solution File: SET027+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET027+1 : TPTP v5.3.0. Bugfixed v5.4.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 : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 08:04:01 EDT 2012
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 73 ( 27 ~; 24 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpVXaiFn/sel_SET027+1.p_1',subclass_defn) ).
fof(4,conjecture,
! [X1,X2,X4] :
( ( subclass(X1,X2)
& subclass(X2,X4) )
=> subclass(X1,X4) ),
file('/tmp/tmpVXaiFn/sel_SET027+1.p_1',transitivity) ).
fof(5,negated_conjecture,
~ ! [X1,X2,X4] :
( ( subclass(X1,X2)
& subclass(X2,X4) )
=> subclass(X1,X4) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(12,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(13,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)],[12]) ).
fof(14,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)],[13]) ).
fof(15,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)],[14]) ).
fof(16,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)],[15]) ).
cnf(17,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(19,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(22,negated_conjecture,
? [X1,X2,X4] :
( subclass(X1,X2)
& subclass(X2,X4)
& ~ subclass(X1,X4) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(23,negated_conjecture,
? [X5,X6,X7] :
( subclass(X5,X6)
& subclass(X6,X7)
& ~ subclass(X5,X7) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( subclass(esk2_0,esk3_0)
& subclass(esk3_0,esk4_0)
& ~ subclass(esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[23]) ).
cnf(25,negated_conjecture,
~ subclass(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,negated_conjecture,
subclass(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
subclass(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(33,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[19,27,theory(equality)]) ).
cnf(34,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[19,26,theory(equality)]) ).
cnf(41,negated_conjecture,
( subclass(X1,esk4_0)
| ~ member(esk1_2(X1,esk4_0),esk3_0) ),
inference(spm,[status(thm)],[17,34,theory(equality)]) ).
cnf(45,negated_conjecture,
( subclass(X1,esk4_0)
| ~ member(esk1_2(X1,esk4_0),esk2_0) ),
inference(spm,[status(thm)],[41,33,theory(equality)]) ).
cnf(47,negated_conjecture,
subclass(esk2_0,esk4_0),
inference(spm,[status(thm)],[45,18,theory(equality)]) ).
cnf(48,negated_conjecture,
$false,
inference(sr,[status(thm)],[47,25,theory(equality)]) ).
cnf(49,negated_conjecture,
$false,
48,
[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/SET027+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpVXaiFn/sel_SET027+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/tmpVXaiFn/sel_SET027+1.p_1']
% -prover status Theorem
% Problem SET027+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET027+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET027+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
%
%------------------------------------------------------------------------------